/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:49:08,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:49:08,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:49:08,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:49:08,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:49:08,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:49:08,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:49:08,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:49:08,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:49:08,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:49:08,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:49:08,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:49:08,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:49:08,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:49:08,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:49:08,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:49:08,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:49:08,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:49:08,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:49:08,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:49:08,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:49:08,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:49:08,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:49:08,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:49:08,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:49:08,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:49:08,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:49:08,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:49:08,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:49:08,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:49:08,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:49:08,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:49:08,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:49:08,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:49:08,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:49:08,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:49:08,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:49:08,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:49:08,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:49:08,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:49:08,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:49:08,615 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,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:49:08,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:49:08,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:49:08,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:49:08,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:49:08,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:49:08,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:49:08,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:49:08,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:49:08,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:49:08,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:49:08,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:49:08,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:08,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:49:08,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:49:08,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:49:08,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:49:08,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:49:08,637 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:49:08,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:49:08,637 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,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:49:08,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:49:08,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:49:08,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:49:08,821 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:49:08,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-01 16:49:08,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2072d10/6149bef5d98243bcbd2a8a9b4addd1c7/FLAG66b7a7ea6 [2022-03-01 16:49:09,281 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:49:09,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-03-01 16:49:09,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2072d10/6149bef5d98243bcbd2a8a9b4addd1c7/FLAG66b7a7ea6 [2022-03-01 16:49:09,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2072d10/6149bef5d98243bcbd2a8a9b4addd1c7 [2022-03-01 16:49:09,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:49:09,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:49:09,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:09,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:49:09,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:49:09,313 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,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772cf7f 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,314 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,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:49:09,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:49:09,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:09,628 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:49:09,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:09,713 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:49:09,714 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,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:09,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:09,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:49:09,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:49:09,721 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,752 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,781 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-03-01 16:49:09,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:09,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:49:09,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:49:09,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:49:09,788 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,788 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,795 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,795 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,804 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,809 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,810 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,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:49:09,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:49:09,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:49:09,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:49:09,819 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,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:09,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:09,852 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,860 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,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:49:09,889 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:49:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:49:09,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:49:09,891 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,011 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:49:10,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:49:10,183 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:49:10,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:49:10,188 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:49:10,190 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,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:49:10,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:49:10,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:49:10,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:49:10,193 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,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8abe3 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,194 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,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8abe3 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,194 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,195 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-03-01 16:49:10,211 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:49:10,211 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:49:10,211 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-01 16:49:10,211 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:49:10,246 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,246 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,246 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,246 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,246 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,246 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,247 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,247 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,247 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,247 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,247 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,247 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,247 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,247 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,248 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,248 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,248 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,248 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,248 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,248 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,251 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,252 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,252 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,252 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,252 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,252 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,263 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,263 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,263 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,264 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,264 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,264 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,264 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,264 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,264 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,264 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,264 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,264 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,264 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,265 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,265 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,265 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,265 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,265 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,265 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,265 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,265 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,266 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,266 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,266 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,266 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,266 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,266 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,267 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,267 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,267 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,267 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,267 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,267 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,267 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,267 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,267 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,268 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,268 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,268 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,268 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,268 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,268 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,268 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,269 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,269 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,269 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,269 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,269 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,269 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,270 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,270 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,270 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,270 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,270 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,271 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,271 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,272 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,272 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,273 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,273 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,273 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,273 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,273 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,273 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,274 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,274 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,274 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,274 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,274 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,275 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,275 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,275 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,275 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,275 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,275 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,276 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,276 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,276 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,276 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,276 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,276 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,277 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,277 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,277 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,277 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,277 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,277 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,277 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,278 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,278 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,278 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,278 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,278 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,278 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,278 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,279 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,279 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,279 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,279 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,279 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,280 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,280 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,280 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,280 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,280 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,280 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,281 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,281 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,281 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,281 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,281 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,281 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,282 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,282 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,282 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,282 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,282 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,282 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,282 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,283 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,283 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,283 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,283 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,283 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,283 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,283 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,294 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,294 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,294 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,294 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,295 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,295 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,295 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,295 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,295 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,297 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,297 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,298 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,298 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,298 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,299 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:49:10,344 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:49:10,348 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,348 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-01 16:49:10,356 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-03-01 16:49:10,437 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,443 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,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 16:49:10,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:10,452 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,452 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,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-03-01 16:49:10,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:10,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059089065] [2022-03-01 16:49:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:10,643 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,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:10,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059089065] [2022-03-01 16:49:10,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059089065] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:10,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:10,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:49:10,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019374568] [2022-03-01 16:49:10,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 16:49:10,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 16:49:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:49:10,680 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,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:10,723 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-03-01 16:49:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 16:49:10,725 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,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:10,751 INFO L225 Difference]: With dead ends: 2321 [2022-03-01 16:49:10,752 INFO L226 Difference]: Without dead ends: 2321 [2022-03-01 16:49:10,753 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,757 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,758 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-03-01 16:49:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-03-01 16:49:10,863 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,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-03-01 16:49:10,870 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-03-01 16:49:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:10,871 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-03-01 16:49:10,871 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,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-03-01 16:49:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 16:49:10,877 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:10,877 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,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:49:10,879 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,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-03-01 16:49:10,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:10,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029427941] [2022-03-01 16:49:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:10,937 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,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:10,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029427941] [2022-03-01 16:49:10,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029427941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:10,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:10,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:49:10,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303318654] [2022-03-01 16:49:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:49:10,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:49:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:49:10,992 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,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,016 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-03-01 16:49:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:49:11,017 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,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:11,024 INFO L225 Difference]: With dead ends: 2325 [2022-03-01 16:49:11,024 INFO L226 Difference]: Without dead ends: 2325 [2022-03-01 16:49:11,024 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,025 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,025 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,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-03-01 16:49:11,076 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,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-03-01 16:49:11,084 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-03-01 16:49:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:11,085 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-03-01 16:49:11,092 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,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-03-01 16:49:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-01 16:49:11,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:11,094 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,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:49:11,094 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,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-03-01 16:49:11,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:11,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029125103] [2022-03-01 16:49:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,149 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,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:11,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029125103] [2022-03-01 16:49:11,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029125103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:11,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723566546] [2022-03-01 16:49:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:11,152 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,153 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,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-01 16:49:11,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:11,326 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,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:11,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723566546] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:11,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:11,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-01 16:49:11,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961289954] [2022-03-01 16:49:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:11,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:49:11,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:49:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:11,329 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,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,377 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-03-01 16:49:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:49:11,378 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,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:11,389 INFO L225 Difference]: With dead ends: 3432 [2022-03-01 16:49:11,389 INFO L226 Difference]: Without dead ends: 3432 [2022-03-01 16:49:11,389 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,390 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,390 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,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-03-01 16:49:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-03-01 16:49:11,435 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,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-03-01 16:49:11,440 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-03-01 16:49:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:11,440 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-03-01 16:49:11,440 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,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-03-01 16:49:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-01 16:49:11,441 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:11,441 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,473 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,654 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,655 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,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-03-01 16:49:11,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:11,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61277988] [2022-03-01 16:49:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,714 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,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:11,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61277988] [2022-03-01 16:49:11,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61277988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:11,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030985904] [2022-03-01 16:49:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:11,717 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,718 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,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:49:11,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:11,868 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,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:11,936 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,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030985904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:11,937 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:11,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:49:11,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569878186] [2022-03-01 16:49:11,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:11,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:11,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:49:11,938 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:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,995 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-03-01 16:49:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:49:11,996 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:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,003 INFO L225 Difference]: With dead ends: 2369 [2022-03-01 16:49:12,003 INFO L226 Difference]: Without dead ends: 2369 [2022-03-01 16:49:12,003 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,004 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,004 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,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-01 16:49:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-01 16:49:12,033 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,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-03-01 16:49:12,039 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-03-01 16:49:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:12,039 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-03-01 16:49:12,040 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,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-03-01 16:49:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:12,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:12,041 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,072 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,274 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,274 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,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-03-01 16:49:12,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:12,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732661086] [2022-03-01 16:49:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:12,373 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,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:12,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732661086] [2022-03-01 16:49:12,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732661086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:12,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043933206] [2022-03-01 16:49:12,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:12,374 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,393 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,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:12,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:12,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-01 16:49:12,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:12,536 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,556 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-01 16:49:12,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 16:49:12,591 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-01 16:49:12,591 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,637 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:49:12,637 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,654 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,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:12,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043933206] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:12,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:12,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-01 16:49:12,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427678739] [2022-03-01 16:49:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:12,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-01 16:49:12,655 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,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:12,822 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-03-01 16:49:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:12,825 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,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,834 INFO L225 Difference]: With dead ends: 2638 [2022-03-01 16:49:12,834 INFO L226 Difference]: Without dead ends: 2638 [2022-03-01 16:49:12,834 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,835 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,839 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,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-03-01 16:49:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-03-01 16:49:12,870 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:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-03-01 16:49:12,875 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-03-01 16:49:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:12,875 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-03-01 16:49:12,876 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:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-03-01 16:49:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:12,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:12,877 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,895 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,087 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,088 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,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-03-01 16:49:13,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:13,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766837427] [2022-03-01 16:49:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,174 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,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:13,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766837427] [2022-03-01 16:49:13,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766837427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:13,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344899519] [2022-03-01 16:49:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:13,176 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,177 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,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 16:49:13,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:13,319 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,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:13,433 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,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344899519] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:13,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:13,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 16:49:13,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229686639] [2022-03-01 16:49:13,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:13,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 16:49:13,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 16:49:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:13,434 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,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:13,590 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-03-01 16:49:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:49:13,591 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,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:13,598 INFO L225 Difference]: With dead ends: 2522 [2022-03-01 16:49:13,598 INFO L226 Difference]: Without dead ends: 2522 [2022-03-01 16:49:13,599 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,599 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:13,599 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.1s Time] [2022-03-01 16:49:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-03-01 16:49:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-03-01 16:49:13,629 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,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-03-01 16:49:13,635 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-03-01 16:49:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:13,635 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-03-01 16:49:13,635 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,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-03-01 16:49:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-01 16:49:13,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:13,636 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,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:13,851 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:13,851 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:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-03-01 16:49:13,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:13,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149776615] [2022-03-01 16:49:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:14,006 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,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:14,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149776615] [2022-03-01 16:49:14,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149776615] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:14,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326668854] [2022-03-01 16:49:14,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:14,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:14,008 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,043 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,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:14,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:14,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-01 16:49:14,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:14,252 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,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,277 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,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,307 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:14,307 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,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:14,343 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,368 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,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:14,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326668854] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:14,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:14,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-01 16:49:14,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623859955] [2022-03-01 16:49:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:14,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:14,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:14,369 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:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:14,836 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-03-01 16:49:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:14,836 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:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:14,853 INFO L225 Difference]: With dead ends: 5451 [2022-03-01 16:49:14,853 INFO L226 Difference]: Without dead ends: 5451 [2022-03-01 16:49:14,854 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:14,854 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.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:14,854 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.3s Time] [2022-03-01 16:49:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-01 16:49:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-03-01 16:49:14,917 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:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-03-01 16:49:14,923 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-03-01 16:49:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:14,923 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-03-01 16:49:14,924 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:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-03-01 16:49:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-01 16:49:14,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:14,925 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:14,951 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,143 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,144 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,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-03-01 16:49:15,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:15,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815820345] [2022-03-01 16:49:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:15,270 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,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:15,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815820345] [2022-03-01 16:49:15,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815820345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:15,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552189429] [2022-03-01 16:49:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:15,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:15,272 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,273 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,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:15,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 16:49:15,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:15,472 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,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:15,643 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,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552189429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:15,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:15,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-01 16:49:15,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71974486] [2022-03-01 16:49:15,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:15,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:49:15,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:49:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:15,644 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:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:15,838 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-03-01 16:49:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:15,851 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:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:15,872 INFO L225 Difference]: With dead ends: 3356 [2022-03-01 16:49:15,872 INFO L226 Difference]: Without dead ends: 3356 [2022-03-01 16:49:15,873 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:15,873 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:15,874 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.0s Time] [2022-03-01 16:49:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-03-01 16:49:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-03-01 16:49:15,912 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:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-03-01 16:49:15,918 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-03-01 16:49:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:15,919 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-03-01 16:49:15,919 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:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-03-01 16:49:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:15,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:15,920 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:15,943 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,137 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,138 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,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-03-01 16:49:16,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677457972] [2022-03-01 16:49:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:16,211 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,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:16,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677457972] [2022-03-01 16:49:16,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677457972] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:16,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:16,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:16,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513168026] [2022-03-01 16:49:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:16,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:16,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:16,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:16,213 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,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:16,316 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-03-01 16:49:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:16,317 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,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:16,323 INFO L225 Difference]: With dead ends: 3594 [2022-03-01 16:49:16,323 INFO L226 Difference]: Without dead ends: 3594 [2022-03-01 16:49:16,323 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,323 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,324 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,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-03-01 16:49:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-03-01 16:49:16,360 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,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-03-01 16:49:16,366 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-03-01 16:49:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:16,366 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-03-01 16:49:16,366 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,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-03-01 16:49:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:16,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:16,367 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,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:49:16,367 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,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-03-01 16:49:16,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141924712] [2022-03-01 16:49:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:16,437 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,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:16,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141924712] [2022-03-01 16:49:16,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141924712] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:16,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:16,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:16,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524145511] [2022-03-01 16:49:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:16,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:16,438 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:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:16,669 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-03-01 16:49:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:16,669 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,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:16,676 INFO L225 Difference]: With dead ends: 3912 [2022-03-01 16:49:16,677 INFO L226 Difference]: Without dead ends: 3912 [2022-03-01 16:49:16,677 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,677 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:16,677 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:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-03-01 16:49:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-03-01 16:49:16,731 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:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-03-01 16:49:16,738 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-03-01 16:49:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:16,739 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-03-01 16:49:16,739 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,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-03-01 16:49:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:16,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:16,741 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:16,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:49:16,741 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:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-03-01 16:49:16,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650168971] [2022-03-01 16:49:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:17,173 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,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:17,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650168971] [2022-03-01 16:49:17,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650168971] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:17,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826290465] [2022-03-01 16:49:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:17,175 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,176 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,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:17,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:17,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:17,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:49:17,648 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,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:17,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826290465] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:17,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:17,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:17,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471464306] [2022-03-01 16:49:17,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:17,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:17,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:17,650 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,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:18,073 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-03-01 16:49:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:18,073 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,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:18,087 INFO L225 Difference]: With dead ends: 8247 [2022-03-01 16:49:18,088 INFO L226 Difference]: Without dead ends: 8247 [2022-03-01 16:49:18,088 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,088 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,089 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,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-01 16:49:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-03-01 16:49:18,165 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,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-03-01 16:49:18,172 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-03-01 16:49:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:18,172 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-03-01 16:49:18,172 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,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-03-01 16:49:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:18,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:18,174 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,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-01 16:49:18,387 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,387 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,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:18,388 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-03-01 16:49:18,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:18,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110240753] [2022-03-01 16:49:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:18,558 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,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:18,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110240753] [2022-03-01 16:49:18,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110240753] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:18,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112168969] [2022-03-01 16:49:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:18,559 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,560 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:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:18,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:18,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:18,844 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:18,923 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:18,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:18,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112168969] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:18,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:18,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:18,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568443384] [2022-03-01 16:49:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:18,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:18,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:18,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:18,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:18,924 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,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:19,405 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-03-01 16:49:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:19,405 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,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:19,422 INFO L225 Difference]: With dead ends: 9773 [2022-03-01 16:49:19,422 INFO L226 Difference]: Without dead ends: 9773 [2022-03-01 16:49:19,423 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,423 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.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:19,423 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.3s Time] [2022-03-01 16:49:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-03-01 16:49:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-03-01 16:49:19,507 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-03-01 16:49:19,512 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-03-01 16:49:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:19,512 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-03-01 16:49:19,512 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,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-03-01 16:49:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:19,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:19,514 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,533 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:19,730 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:19,730 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:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-03-01 16:49:19,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:19,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427657376] [2022-03-01 16:49:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:19,880 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:19,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:19,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427657376] [2022-03-01 16:49:19,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427657376] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:19,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129541393] [2022-03-01 16:49:19,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:19,882 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:19,882 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:19,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:19,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:19,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:19,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:20,211 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,261 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,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:20,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129541393] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:20,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:20,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:20,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568992883] [2022-03-01 16:49:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:20,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:20,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:20,263 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:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:20,973 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-03-01 16:49:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:20,973 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:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:20,988 INFO L225 Difference]: With dead ends: 10247 [2022-03-01 16:49:20,989 INFO L226 Difference]: Without dead ends: 10247 [2022-03-01 16:49:20,989 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:20,989 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1057 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:20,990 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,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-03-01 16:49:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-03-01 16:49:21,086 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,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-03-01 16:49:21,092 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-03-01 16:49:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:21,092 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-03-01 16:49:21,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-03-01 16:49:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:21,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:21,094 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,125 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,307 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,307 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,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-03-01 16:49:21,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:21,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659513584] [2022-03-01 16:49:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:21,419 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,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:21,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659513584] [2022-03-01 16:49:21,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659513584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:21,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453774625] [2022-03-01 16:49:21,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:21,421 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,422 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,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:21,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:21,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:21,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:21,745 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:21,778 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:21,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:21,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453774625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:21,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:21,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:21,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380274329] [2022-03-01 16:49:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:21,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:21,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:21,779 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:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:22,812 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-03-01 16:49:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:22,815 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:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:22,845 INFO L225 Difference]: With dead ends: 9750 [2022-03-01 16:49:22,845 INFO L226 Difference]: Without dead ends: 9750 [2022-03-01 16:49:22,846 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:22,846 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:22,846 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:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-03-01 16:49:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-03-01 16:49:22,899 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:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-03-01 16:49:22,905 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-03-01 16:49:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:22,905 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-03-01 16:49:22,905 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:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-03-01 16:49:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:22,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:22,907 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:22,929 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,123 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,123 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,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-03-01 16:49:23,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:23,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455300322] [2022-03-01 16:49:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:23,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:23,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455300322] [2022-03-01 16:49:23,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455300322] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:23,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757711] [2022-03-01 16:49:23,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:23,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:23,374 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,375 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,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:23,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:23,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:23,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:23,771 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:23,806 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:23,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:23,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757711] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:23,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:23,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:23,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955193240] [2022-03-01 16:49:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:23,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:23,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:23,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:23,808 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,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:25,097 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-03-01 16:49:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:25,097 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,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:25,115 INFO L225 Difference]: With dead ends: 13148 [2022-03-01 16:49:25,115 INFO L226 Difference]: Without dead ends: 13148 [2022-03-01 16:49:25,116 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,116 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:25,118 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.6s Time] [2022-03-01 16:49:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-03-01 16:49:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-03-01 16:49:25,204 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,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:25,209 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:25,210 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:25,210 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,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:25,212 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:25,212 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,230 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,427 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,427 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,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-03-01 16:49:25,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:25,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777627762] [2022-03-01 16:49:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:25,657 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:25,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:25,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777627762] [2022-03-01 16:49:25,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777627762] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:25,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241694945] [2022-03-01 16:49:25,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:25,658 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:25,660 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:25,776 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:25,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:25,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:25,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:26,009 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,066 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,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:26,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241694945] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:26,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:26,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:26,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385191833] [2022-03-01 16:49:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:26,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:26,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:26,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:26,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:26,067 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:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:26,806 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-03-01 16:49:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:26,807 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:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:26,824 INFO L225 Difference]: With dead ends: 12864 [2022-03-01 16:49:26,824 INFO L226 Difference]: Without dead ends: 12864 [2022-03-01 16:49:26,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:49:26,825 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:26,825 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:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-03-01 16:49:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-03-01 16:49:26,907 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:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-03-01 16:49:26,912 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-03-01 16:49:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:26,913 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-03-01 16:49:26,913 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:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-03-01 16:49:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:26,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:26,915 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:26,944 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,135 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,135 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,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-03-01 16:49:27,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:27,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632436498] [2022-03-01 16:49:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:27,363 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,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:27,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632436498] [2022-03-01 16:49:27,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632436498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:27,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900897474] [2022-03-01 16:49:27,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:27,372 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,373 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,465 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:27,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:27,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:27,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:27,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:27,797 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:27,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:27,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900897474] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:27,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:27,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:27,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420176056] [2022-03-01 16:49:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:27,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:27,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:27,799 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:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:28,959 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-03-01 16:49:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:28,959 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:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:28,976 INFO L225 Difference]: With dead ends: 13826 [2022-03-01 16:49:28,977 INFO L226 Difference]: Without dead ends: 13826 [2022-03-01 16:49:28,977 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:28,978 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:28,978 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:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-01 16:49:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-03-01 16:49:29,059 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,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:29,065 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:29,065 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,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:29,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:29,067 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,089 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,281 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,281 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,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-03-01 16:49:29,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:29,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096122842] [2022-03-01 16:49:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:29,499 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:29,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:29,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096122842] [2022-03-01 16:49:29,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096122842] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:29,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901862982] [2022-03-01 16:49:29,500 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:29,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:29,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:29,501 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:29,502 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:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:29,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:29,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:29,839 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:29,917 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:29,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:29,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901862982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:29,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:29,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:29,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512574945] [2022-03-01 16:49:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:29,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:29,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:29,918 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,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:30,409 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-03-01 16:49:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:30,409 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,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:30,422 INFO L225 Difference]: With dead ends: 11072 [2022-03-01 16:49:30,422 INFO L226 Difference]: Without dead ends: 11072 [2022-03-01 16:49:30,422 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,423 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,423 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,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-03-01 16:49:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-03-01 16:49:30,482 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:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-03-01 16:49:30,487 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-03-01 16:49:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:30,487 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-03-01 16:49:30,487 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:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-03-01 16:49:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:30,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:30,505 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:30,525 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:30,719 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:30,719 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:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-03-01 16:49:30,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:30,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581626337] [2022-03-01 16:49:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:30,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:30,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581626337] [2022-03-01 16:49:30,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581626337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:30,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690197995] [2022-03-01 16:49:30,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:30,940 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:30,950 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,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:31,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:31,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:31,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:31,279 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,334 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,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:31,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690197995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:31,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:31,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:31,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687403515] [2022-03-01 16:49:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:31,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:31,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:31,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:31,336 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,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:32,077 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-03-01 16:49:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:32,078 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,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:32,090 INFO L225 Difference]: With dead ends: 12770 [2022-03-01 16:49:32,090 INFO L226 Difference]: Without dead ends: 12770 [2022-03-01 16:49:32,091 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,091 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,091 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,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-03-01 16:49:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-03-01 16:49:32,151 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,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-03-01 16:49:32,155 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-03-01 16:49:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:32,155 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-03-01 16:49:32,155 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,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-03-01 16:49:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:32,157 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:32,157 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,174 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:32,363 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:32,363 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:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-03-01 16:49:32,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:32,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910266978] [2022-03-01 16:49:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:32,531 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:32,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:32,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910266978] [2022-03-01 16:49:32,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910266978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:32,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329603366] [2022-03-01 16:49:32,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:32,533 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:32,534 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:32,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:32,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:32,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:32,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:32,873 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:32,907 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:32,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:32,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329603366] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:32,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:32,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:32,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921841459] [2022-03-01 16:49:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:32,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:32,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:32,909 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:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:33,966 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-03-01 16:49:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:33,967 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:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:33,979 INFO L225 Difference]: With dead ends: 12273 [2022-03-01 16:49:33,979 INFO L226 Difference]: Without dead ends: 12273 [2022-03-01 16:49:33,979 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:33,980 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:33,980 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:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-03-01 16:49:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-03-01 16:49:34,040 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:34,044 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:34,045 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:34,045 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,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:34,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:34,046 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,064 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,259 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,259 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,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-03-01 16:49:34,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:34,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785985415] [2022-03-01 16:49:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:34,526 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:34,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:34,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785985415] [2022-03-01 16:49:34,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785985415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:34,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109380244] [2022-03-01 16:49:34,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:34,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:34,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:34,528 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:34,532 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:34,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:34,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:34,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:34,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:34,826 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:34,892 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:34,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:34,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109380244] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:34,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:34,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-01 16:49:34,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530679700] [2022-03-01 16:49:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:34,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:34,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:34,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:34,893 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:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:35,441 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-03-01 16:49:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:49:35,441 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:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:35,452 INFO L225 Difference]: With dead ends: 9102 [2022-03-01 16:49:35,452 INFO L226 Difference]: Without dead ends: 9102 [2022-03-01 16:49:35,452 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:35,453 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:35,453 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:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-03-01 16:49:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-03-01 16:49:35,522 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:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:35,527 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:35,527 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:35,527 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:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:35,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:35,530 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:35,550 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:35,735 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:35,735 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:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-03-01 16:49:35,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:35,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763836488] [2022-03-01 16:49:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:35,975 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,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:35,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763836488] [2022-03-01 16:49:35,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763836488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:35,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497479724] [2022-03-01 16:49:35,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:35,978 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:35,979 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,120 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:36,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:36,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:36,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:36,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:49:36,429 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:36,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:36,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497479724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:36,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:36,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:36,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332606006] [2022-03-01 16:49:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:36,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:36,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:36,431 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:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:37,394 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-03-01 16:49:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:37,394 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:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:37,406 INFO L225 Difference]: With dead ends: 10156 [2022-03-01 16:49:37,406 INFO L226 Difference]: Without dead ends: 10156 [2022-03-01 16:49:37,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:37,407 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:37,407 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:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-03-01 16:49:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-03-01 16:49:37,483 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:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:37,487 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:37,488 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:37,488 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:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:37,489 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:37,489 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:37,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-01 16:49:37,703 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:37,703 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:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-03-01 16:49:37,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:37,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903016676] [2022-03-01 16:49:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:37,860 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:37,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:37,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903016676] [2022-03-01 16:49:37,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903016676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:37,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085756039] [2022-03-01 16:49:37,860 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:37,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:37,861 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:37,895 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:37,988 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:37,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:37,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:37,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:38,222 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,253 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,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:38,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085756039] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:38,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:38,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:38,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139233095] [2022-03-01 16:49:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:38,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:38,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:38,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:38,255 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,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:39,231 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-03-01 16:49:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:39,232 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,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:39,252 INFO L225 Difference]: With dead ends: 14218 [2022-03-01 16:49:39,252 INFO L226 Difference]: Without dead ends: 14218 [2022-03-01 16:49:39,253 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,253 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1402 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:39,253 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.5s Time] [2022-03-01 16:49:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-03-01 16:49:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-03-01 16:49:39,342 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:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-03-01 16:49:39,347 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-03-01 16:49:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:39,347 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-03-01 16:49:39,347 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:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-03-01 16:49:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:39,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:39,348 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:39,365 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:39,549 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:39,549 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:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-03-01 16:49:39,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:39,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139184205] [2022-03-01 16:49:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:39,702 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:39,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:39,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139184205] [2022-03-01 16:49:39,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139184205] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:39,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638016180] [2022-03-01 16:49:39,702 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:39,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:39,703 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:39,731 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:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:39,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:39,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:40,061 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,110 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,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:40,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638016180] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:40,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:40,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:40,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927302488] [2022-03-01 16:49:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:40,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:40,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:40,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:40,111 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:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:40,615 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-03-01 16:49:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:49:40,616 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:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:40,627 INFO L225 Difference]: With dead ends: 9882 [2022-03-01 16:49:40,627 INFO L226 Difference]: Without dead ends: 9882 [2022-03-01 16:49:40,627 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:40,628 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:40,628 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:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-03-01 16:49:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-03-01 16:49:40,684 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:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-01 16:49:40,689 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-01 16:49:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:40,689 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-01 16:49:40,689 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,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-01 16:49:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:40,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:40,691 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,707 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:40,903 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:40,903 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:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:40,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-03-01 16:49:40,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:40,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198419666] [2022-03-01 16:49:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:40,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:41,160 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,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:41,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198419666] [2022-03-01 16:49:41,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198419666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:41,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708226848] [2022-03-01 16:49:41,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:41,163 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,163 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,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:41,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:41,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:41,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:41,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:41,569 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:41,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:41,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708226848] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:41,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:41,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:41,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405839244] [2022-03-01 16:49:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:41,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:41,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:41,570 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:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:42,515 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-03-01 16:49:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:42,515 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:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:42,527 INFO L225 Difference]: With dead ends: 10977 [2022-03-01 16:49:42,528 INFO L226 Difference]: Without dead ends: 10977 [2022-03-01 16:49:42,528 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:42,529 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:42,529 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:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-03-01 16:49:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-03-01 16:49:42,590 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:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:42,594 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:42,594 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:42,594 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:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:42,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:42,596 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:42,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:42,797 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:42,797 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:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-03-01 16:49:42,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:42,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706337315] [2022-03-01 16:49:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:43,022 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,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:43,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706337315] [2022-03-01 16:49:43,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706337315] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:43,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695414835] [2022-03-01 16:49:43,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:43,023 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,024 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,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:43,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:43,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:43,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:43,433 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:43,475 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:43,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:43,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695414835] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:43,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:43,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:43,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230548432] [2022-03-01 16:49:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:43,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:43,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:43,477 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:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:44,571 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-03-01 16:49:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:44,572 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:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:44,588 INFO L225 Difference]: With dead ends: 12897 [2022-03-01 16:49:44,588 INFO L226 Difference]: Without dead ends: 12897 [2022-03-01 16:49:44,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:49:44,589 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:44,589 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:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-03-01 16:49:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-03-01 16:49:44,657 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:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-03-01 16:49:44,662 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-03-01 16:49:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:44,662 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-03-01 16:49:44,662 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:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-03-01 16:49:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:44,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:44,663 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:44,680 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:44,864 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:44,864 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:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-03-01 16:49:44,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:44,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731210087] [2022-03-01 16:49:44,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:45,075 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,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:45,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731210087] [2022-03-01 16:49:45,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731210087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:45,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665658617] [2022-03-01 16:49:45,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:45,088 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,089 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:45,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:45,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:45,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:45,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:45,447 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:45,486 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:45,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:45,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665658617] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:45,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:45,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-03-01 16:49:45,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687238634] [2022-03-01 16:49:45,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:45,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:45,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:45,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:49:45,487 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:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:46,397 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-03-01 16:49:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 16:49:46,397 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:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:46,418 INFO L225 Difference]: With dead ends: 16275 [2022-03-01 16:49:46,418 INFO L226 Difference]: Without dead ends: 16275 [2022-03-01 16:49:46,419 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:46,419 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:46,419 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:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-03-01 16:49:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-03-01 16:49:46,502 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:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-03-01 16:49:46,507 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-03-01 16:49:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:46,507 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-03-01 16:49:46,507 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:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-03-01 16:49:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:46,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:46,508 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:46,525 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:46,709 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:46,709 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:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-03-01 16:49:46,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:46,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123642107] [2022-03-01 16:49:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:46,922 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:46,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:46,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123642107] [2022-03-01 16:49:46,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123642107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:46,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344854962] [2022-03-01 16:49:46,922 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:46,923 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:46,924 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,078 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:47,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:47,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:47,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:47,309 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:47,344 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:47,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:47,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344854962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:47,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:47,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:47,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703895298] [2022-03-01 16:49:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:47,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:47,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:47,345 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:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:48,442 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-03-01 16:49:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:48,443 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:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:48,460 INFO L225 Difference]: With dead ends: 13575 [2022-03-01 16:49:48,460 INFO L226 Difference]: Without dead ends: 13575 [2022-03-01 16:49:48,461 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:48,461 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:48,461 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:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-03-01 16:49:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-03-01 16:49:48,534 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:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-01 16:49:48,539 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-01 16:49:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:48,539 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-01 16:49:48,539 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:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-01 16:49:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:48,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:48,541 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:48,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:48,741 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:48,741 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:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-03-01 16:49:48,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:48,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861808384] [2022-03-01 16:49:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:48,896 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:48,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:48,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861808384] [2022-03-01 16:49:48,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861808384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:48,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207392899] [2022-03-01 16:49:48,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:48,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:48,898 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:48,899 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,037 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:49,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:49,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:49,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:49,233 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:49,299 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:49,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:49,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207392899] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:49,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:49,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:49,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124507086] [2022-03-01 16:49:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:49,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:49,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:49,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:49,301 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:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:49,721 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-03-01 16:49:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:49,722 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,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:49,732 INFO L225 Difference]: With dead ends: 8414 [2022-03-01 16:49:49,732 INFO L226 Difference]: Without dead ends: 8414 [2022-03-01 16:49:49,732 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:49,732 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 642 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:49,733 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:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-03-01 16:49:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-03-01 16:49:49,800 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:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-03-01 16:49:49,804 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-03-01 16:49:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:49,805 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-03-01 16:49:49,805 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,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-03-01 16:49:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:49,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:49,806 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:49,823 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,010 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,011 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,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-03-01 16:49:50,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:50,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255718592] [2022-03-01 16:49:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:50,224 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:50,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:50,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255718592] [2022-03-01 16:49:50,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255718592] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:50,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365319677] [2022-03-01 16:49:50,226 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:50,227 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:50,227 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:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:50,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:50,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:50,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:49:50,626 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,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:50,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365319677] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:50,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:50,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:50,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628943353] [2022-03-01 16:49:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:50,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:50,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:50,628 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:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:51,265 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-03-01 16:49:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:49:51,265 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:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:51,279 INFO L225 Difference]: With dead ends: 10112 [2022-03-01 16:49:51,279 INFO L226 Difference]: Without dead ends: 10112 [2022-03-01 16:49:51,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-03-01 16:49:51,280 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 821 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:51,280 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:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-03-01 16:49:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-03-01 16:49:51,341 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:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-03-01 16:49:51,346 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-03-01 16:49:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:51,346 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-03-01 16:49:51,346 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:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-03-01 16:49:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:51,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:51,348 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:51,364 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:51,550 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:51,550 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:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-03-01 16:49:51,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:51,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086042344] [2022-03-01 16:49:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:51,765 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,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:51,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086042344] [2022-03-01 16:49:51,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086042344] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:51,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135559071] [2022-03-01 16:49:51,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:51,767 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:51,768 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:51,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:51,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:51,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:51,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:52,176 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:52,210 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:52,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:52,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135559071] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:52,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:52,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:52,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66588313] [2022-03-01 16:49:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:52,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:52,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:52,212 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:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:53,174 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-03-01 16:49:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:53,175 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:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:53,186 INFO L225 Difference]: With dead ends: 9615 [2022-03-01 16:49:53,186 INFO L226 Difference]: Without dead ends: 9615 [2022-03-01 16:49:53,186 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:53,187 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:53,187 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:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-03-01 16:49:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-03-01 16:49:53,241 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:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:53,246 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:53,246 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:53,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:53,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:53,248 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:53,264 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:53,454 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:53,454 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:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-03-01 16:49:53,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:53,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76178832] [2022-03-01 16:49:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:53,619 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:53,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:53,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76178832] [2022-03-01 16:49:53,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76178832] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:53,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216154510] [2022-03-01 16:49:53,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:53,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:53,620 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:53,622 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:53,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:53,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:53,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:53,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:53,920 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:54,021 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:54,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:54,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216154510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:54,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:54,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:54,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664640773] [2022-03-01 16:49:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:54,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:54,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:54,022 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:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:54,545 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-03-01 16:49:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:54,546 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,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:54,554 INFO L225 Difference]: With dead ends: 7878 [2022-03-01 16:49:54,555 INFO L226 Difference]: Without dead ends: 7878 [2022-03-01 16:49:54,555 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:54,555 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:54,555 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:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-03-01 16:49:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-03-01 16:49:54,601 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:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:49:54,605 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:49:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:54,606 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:49:54,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:49:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:54,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:54,607 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,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:54,807 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:54,808 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:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-03-01 16:49:54,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:54,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910180143] [2022-03-01 16:49:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:55,061 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:55,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:55,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910180143] [2022-03-01 16:49:55,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910180143] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:55,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615583825] [2022-03-01 16:49:55,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:55,076 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:55,078 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:55,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:55,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:55,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:55,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:55,419 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,485 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,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:55,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615583825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:55,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:55,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-01 16:49:55,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667146496] [2022-03-01 16:49:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:55,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:55,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:55,486 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:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:56,293 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-03-01 16:49:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:49:56,293 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:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:56,304 INFO L225 Difference]: With dead ends: 9039 [2022-03-01 16:49:56,304 INFO L226 Difference]: Without dead ends: 9039 [2022-03-01 16:49:56,305 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:56,305 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:56,305 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:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-03-01 16:49:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-03-01 16:49:56,355 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:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-03-01 16:49:56,360 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-03-01 16:49:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:56,360 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-03-01 16:49:56,360 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:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-03-01 16:49:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:56,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:56,362 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:49:56,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-01 16:49:56,562 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:56,562 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:56,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-03-01 16:49:56,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:56,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805715193] [2022-03-01 16:49:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:56,770 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,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:56,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805715193] [2022-03-01 16:49:56,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805715193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:56,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030323869] [2022-03-01 16:49:56,771 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:56,779 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:56,780 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:56,965 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:56,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:56,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:56,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:57,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:57,249 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:57,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:57,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030323869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:57,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:57,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:57,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472740075] [2022-03-01 16:49:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:57,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:57,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:57,251 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:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:58,394 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-03-01 16:49:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:58,394 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:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:58,407 INFO L225 Difference]: With dead ends: 9474 [2022-03-01 16:49:58,407 INFO L226 Difference]: Without dead ends: 9474 [2022-03-01 16:49:58,408 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:58,408 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:58,408 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:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-03-01 16:49:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-03-01 16:49:58,463 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:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:49:58,467 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:49:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:58,468 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:49:58,468 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:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:49:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:58,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:58,469 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:58,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-01 16:49:58,669 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:58,670 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:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-03-01 16:49:58,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:58,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083630193] [2022-03-01 16:49:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:58,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:58,831 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:58,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:58,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083630193] [2022-03-01 16:49:58,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083630193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:58,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547363970] [2022-03-01 16:49:58,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:58,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:58,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:58,844 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:49:58,849 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:49:59,041 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:59,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:59,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:59,260 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:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:59,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:59,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547363970] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:59,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:59,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:59,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401639080] [2022-03-01 16:49:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:59,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:59,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:59,343 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:49:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:59,810 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-03-01 16:49:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:59,811 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,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:59,820 INFO L225 Difference]: With dead ends: 8122 [2022-03-01 16:49:59,821 INFO L226 Difference]: Without dead ends: 8122 [2022-03-01 16:49:59,821 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:49:59,821 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:49:59,821 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:49:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-03-01 16:49:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-03-01 16:49:59,870 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:49:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-03-01 16:49:59,875 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-03-01 16:49:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:59,875 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-03-01 16:49:59,875 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,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-03-01 16:49:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:59,877 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:59,877 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,897 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:00,097 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:00,097 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:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-03-01 16:50:00,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:00,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353704319] [2022-03-01 16:50:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:00,201 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,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:00,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353704319] [2022-03-01 16:50:00,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353704319] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:00,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194776664] [2022-03-01 16:50:00,201 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:00,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:00,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:00,202 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:00,203 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:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:00,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:00,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:00,632 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,662 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,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:00,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194776664] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:00,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:00,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:00,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979633025] [2022-03-01 16:50:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:00,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:00,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:00,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:00,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:00,663 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:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:01,726 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-03-01 16:50:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:01,726 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,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:01,739 INFO L225 Difference]: With dead ends: 11081 [2022-03-01 16:50:01,740 INFO L226 Difference]: Without dead ends: 11081 [2022-03-01 16:50:01,740 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:01,740 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:01,741 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.6s Time] [2022-03-01 16:50:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-03-01 16:50:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-03-01 16:50:01,802 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:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:01,809 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:01,810 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:01,810 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,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:01,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:01,811 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,838 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:02,031 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:02,031 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:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-03-01 16:50:02,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:02,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385411068] [2022-03-01 16:50:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:02,128 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:02,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:02,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385411068] [2022-03-01 16:50:02,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385411068] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:02,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286827471] [2022-03-01 16:50:02,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:02,130 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:02,131 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:02,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:02,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:02,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:02,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:02,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:50:02,551 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:02,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:02,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286827471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:02,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:02,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:02,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361665283] [2022-03-01 16:50:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:02,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:02,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:02,552 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:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:03,649 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-03-01 16:50:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 16:50:03,650 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,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:03,670 INFO L225 Difference]: With dead ends: 13372 [2022-03-01 16:50:03,670 INFO L226 Difference]: Without dead ends: 13372 [2022-03-01 16:50:03,671 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:03,673 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:03,673 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:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-03-01 16:50:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-03-01 16:50:03,755 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:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-03-01 16:50:03,760 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-03-01 16:50:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:03,760 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-03-01 16:50:03,760 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,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-03-01 16:50:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:03,762 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:03,762 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,779 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:03,962 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:03,962 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:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-03-01 16:50:03,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:03,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410184658] [2022-03-01 16:50:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:04,166 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:04,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:04,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410184658] [2022-03-01 16:50:04,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410184658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:04,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572195986] [2022-03-01 16:50:04,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:04,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:04,168 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:04,168 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:04,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:04,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:04,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:04,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:04,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:50:04,595 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:04,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:04,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572195986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:04,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:04,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:04,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884911508] [2022-03-01 16:50:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:04,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:04,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:04,597 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:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:05,257 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-03-01 16:50:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:50:05,258 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,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:05,269 INFO L225 Difference]: With dead ends: 9134 [2022-03-01 16:50:05,270 INFO L226 Difference]: Without dead ends: 9134 [2022-03-01 16:50:05,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:50:05,270 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:05,270 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:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-03-01 16:50:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-03-01 16:50:05,317 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:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-03-01 16:50:05,321 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-03-01 16:50:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:05,321 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-03-01 16:50:05,322 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,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-03-01 16:50:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:05,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:05,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:50:05,340 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:05,523 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:05,524 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:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-03-01 16:50:05,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:05,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298662907] [2022-03-01 16:50:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:05,619 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,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:05,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298662907] [2022-03-01 16:50:05,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298662907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:05,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17281208] [2022-03-01 16:50:05,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:05,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:05,621 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:05,622 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:05,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:05,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:05,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:50:05,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:06,011 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,037 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,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:06,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17281208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:06,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:06,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-01 16:50:06,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092766524] [2022-03-01 16:50:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:06,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:50:06,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:06,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:50:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:50:06,039 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:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:07,103 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-03-01 16:50:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 16:50:07,104 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:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:07,125 INFO L225 Difference]: With dead ends: 12493 [2022-03-01 16:50:07,125 INFO L226 Difference]: Without dead ends: 12493 [2022-03-01 16:50:07,125 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:07,126 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:07,126 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:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-03-01 16:50:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-03-01 16:50:07,190 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:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:50:07,194 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:50:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:07,195 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:50:07,195 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:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:50:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:07,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:07,196 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:07,213 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:07,396 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:07,397 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:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1585962891, now seen corresponding path program 29 times [2022-03-01 16:50:07,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:07,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955006673] [2022-03-01 16:50:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,547 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,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955006673] [2022-03-01 16:50:07,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955006673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:07,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651577221] [2022-03-01 16:50:07,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:07,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:07,549 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:07,549 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:07,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:07,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:07,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:07,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:07,914 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,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:07,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:07,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651577221] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:07,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:07,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347547401] [2022-03-01 16:50:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:07,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:08,000 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:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,444 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-03-01 16:50:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:08,445 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:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,454 INFO L225 Difference]: With dead ends: 7570 [2022-03-01 16:50:08,454 INFO L226 Difference]: Without dead ends: 7570 [2022-03-01 16:50:08,454 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:08,455 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:08,455 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:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-03-01 16:50:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-03-01 16:50:08,500 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:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-01 16:50:08,504 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-01 16:50:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,504 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-01 16:50:08,505 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:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-01 16:50:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:08,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,506 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,523 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:08,706 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:08,707 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:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1792932773, now seen corresponding path program 30 times [2022-03-01 16:50:08,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759176565] [2022-03-01 16:50:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:08,801 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:08,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:08,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759176565] [2022-03-01 16:50:08,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759176565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:08,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341194348] [2022-03-01 16:50:08,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:08,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:08,803 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:08,804 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:08,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:08,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:08,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:08,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:09,224 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,253 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,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:09,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341194348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:09,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:09,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:09,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916562237] [2022-03-01 16:50:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:09,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:09,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:09,255 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:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:10,179 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-03-01 16:50:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:50:10,179 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,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:10,193 INFO L225 Difference]: With dead ends: 10529 [2022-03-01 16:50:10,194 INFO L226 Difference]: Without dead ends: 10529 [2022-03-01 16:50:10,194 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:10,194 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:10,194 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.5s Time] [2022-03-01 16:50:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-03-01 16:50:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-03-01 16:50:10,301 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:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-01 16:50:10,305 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-01 16:50:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:10,306 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-01 16:50:10,306 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,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-01 16:50:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:10,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:10,307 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,324 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:10,519 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:10,519 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:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 357163977, now seen corresponding path program 31 times [2022-03-01 16:50:10,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:10,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487294988] [2022-03-01 16:50:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,711 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,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:10,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487294988] [2022-03-01 16:50:10,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487294988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:10,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306750072] [2022-03-01 16:50:10,712 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:10,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:10,713 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:10,714 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:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:10,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:11,125 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,160 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,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:11,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306750072] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:11,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:11,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:11,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370845496] [2022-03-01 16:50:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:11,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:11,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:11,161 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:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:12,308 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-03-01 16:50:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:12,309 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:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:12,331 INFO L225 Difference]: With dead ends: 14591 [2022-03-01 16:50:12,331 INFO L226 Difference]: Without dead ends: 14591 [2022-03-01 16:50:12,332 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:12,332 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 1598 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:12,332 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.6s Time] [2022-03-01 16:50:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-03-01 16:50:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-03-01 16:50:12,432 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:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:12,436 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:12,436 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:12,436 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,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:12,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:12,437 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,456 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:12,647 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:12,647 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:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -189766965, now seen corresponding path program 32 times [2022-03-01 16:50:12,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:12,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367186026] [2022-03-01 16:50:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:12,834 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,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:12,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367186026] [2022-03-01 16:50:12,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367186026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:12,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487339607] [2022-03-01 16:50:12,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:12,835 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:12,836 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:13,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:13,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:13,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:13,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:13,239 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:13,290 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:13,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:13,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487339607] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:13,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:13,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:13,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398430602] [2022-03-01 16:50:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:13,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:13,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:13,291 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:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:13,923 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-03-01 16:50:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:50:13,924 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:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:13,935 INFO L225 Difference]: With dead ends: 10255 [2022-03-01 16:50:13,935 INFO L226 Difference]: Without dead ends: 10255 [2022-03-01 16:50:13,936 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:13,937 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:13,938 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:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-03-01 16:50:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-03-01 16:50:13,991 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:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-01 16:50:13,996 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-01 16:50:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:13,996 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-01 16:50:13,996 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:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-01 16:50:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:13,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:13,997 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,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-01 16:50:14,197 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:14,198 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:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash -676249591, now seen corresponding path program 33 times [2022-03-01 16:50:14,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:14,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953226201] [2022-03-01 16:50:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:14,298 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,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:14,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953226201] [2022-03-01 16:50:14,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953226201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:14,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216930563] [2022-03-01 16:50:14,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:14,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:14,299 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:14,301 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:14,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:14,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:14,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:14,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:14,691 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:14,723 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:14,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:14,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216930563] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:14,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:14,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:14,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318612009] [2022-03-01 16:50:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:14,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:14,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:14,724 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:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:15,771 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-03-01 16:50:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 16:50:15,772 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,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:15,784 INFO L225 Difference]: With dead ends: 11350 [2022-03-01 16:50:15,784 INFO L226 Difference]: Without dead ends: 11350 [2022-03-01 16:50:15,785 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:15,785 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1219 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:15,785 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.6s Time] [2022-03-01 16:50:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-03-01 16:50:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-03-01 16:50:15,847 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:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-03-01 16:50:15,851 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-03-01 16:50:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:15,851 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-03-01 16:50:15,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-03-01 16:50:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:15,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:15,853 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,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-01 16:50:16,053 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:16,053 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:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-03-01 16:50:16,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:16,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69958178] [2022-03-01 16:50:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:16,147 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,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:16,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69958178] [2022-03-01 16:50:16,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69958178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:16,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008418020] [2022-03-01 16:50:16,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:16,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:16,149 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:16,150 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:16,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:16,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:16,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:50:16,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:16,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:50:16,504 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,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:16,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008418020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:16,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:16,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-01 16:50:16,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707795342] [2022-03-01 16:50:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:16,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:50:16,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:50:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:50:16,505 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:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:17,448 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-03-01 16:50:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:50:17,448 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:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:17,465 INFO L225 Difference]: With dead ends: 15159 [2022-03-01 16:50:17,466 INFO L226 Difference]: Without dead ends: 15159 [2022-03-01 16:50:17,466 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:17,466 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.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:17,466 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.7s Time] [2022-03-01 16:50:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-03-01 16:50:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-03-01 16:50:17,537 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:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:17,541 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:17,542 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:17,542 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:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:17,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:17,543 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:17,560 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:17,743 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:17,743 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:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-03-01 16:50:17,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:17,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282034203] [2022-03-01 16:50:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:17,942 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:17,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:17,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282034203] [2022-03-01 16:50:17,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282034203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:17,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32690819] [2022-03-01 16:50:17,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:17,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:17,944 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:17,944 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:18,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:18,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:18,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:18,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:18,382 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,432 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,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:18,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32690819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:18,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:18,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:18,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283732702] [2022-03-01 16:50:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:18,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:18,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:18,433 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:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:19,087 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-03-01 16:50:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:50:19,087 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:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:19,102 INFO L225 Difference]: With dead ends: 12497 [2022-03-01 16:50:19,102 INFO L226 Difference]: Without dead ends: 12497 [2022-03-01 16:50:19,103 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:19,103 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:19,103 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:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-03-01 16:50:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-03-01 16:50:19,177 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:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-01 16:50:19,181 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-01 16:50:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:19,182 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-01 16:50:19,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-01 16:50:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:19,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:19,183 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,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-03-01 16:50:19,383 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:19,384 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:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-03-01 16:50:19,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:19,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702291195] [2022-03-01 16:50:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:19,577 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:19,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:19,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702291195] [2022-03-01 16:50:19,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702291195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:19,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935223208] [2022-03-01 16:50:19,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:19,579 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:19,601 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:19,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:19,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:19,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:19,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:19,999 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,033 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,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:20,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935223208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:20,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:20,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:20,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978211476] [2022-03-01 16:50:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:20,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:20,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:20,034 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:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:21,130 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-03-01 16:50:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:50:21,131 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,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:21,149 INFO L225 Difference]: With dead ends: 13459 [2022-03-01 16:50:21,149 INFO L226 Difference]: Without dead ends: 13459 [2022-03-01 16:50:21,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:50:21,150 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:21,150 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:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-03-01 16:50:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-03-01 16:50:21,230 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:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-01 16:50:21,234 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-01 16:50:21,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:21,234 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-01 16:50:21,234 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,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-01 16:50:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:21,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:21,236 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,253 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:21,443 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:21,443 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:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-03-01 16:50:21,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:21,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932076697] [2022-03-01 16:50:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:21,596 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,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:21,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932076697] [2022-03-01 16:50:21,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932076697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:21,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64118020] [2022-03-01 16:50:21,597 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:21,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:21,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:21,598 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:21,599 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:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:21,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:21,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:21,979 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,044 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,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:22,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64118020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:22,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:22,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:22,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662956337] [2022-03-01 16:50:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:22,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:22,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:22,045 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:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:22,455 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-03-01 16:50:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:22,455 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:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:22,465 INFO L225 Difference]: With dead ends: 8298 [2022-03-01 16:50:22,466 INFO L226 Difference]: Without dead ends: 8298 [2022-03-01 16:50:22,466 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:22,466 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 656 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:22,466 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:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-03-01 16:50:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-03-01 16:50:22,523 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:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-01 16:50:22,527 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-01 16:50:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:22,528 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-01 16:50:22,528 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:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-01 16:50:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:22,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:22,529 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:22,546 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:22,740 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:22,740 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:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-03-01 16:50:22,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:22,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619352912] [2022-03-01 16:50:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:22,924 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:22,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:22,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619352912] [2022-03-01 16:50:22,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619352912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:22,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003181986] [2022-03-01 16:50:22,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:22,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:22,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:22,936 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:22,951 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:23,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:23,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:23,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:23,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:23,355 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:23,428 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:23,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:23,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003181986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:23,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:23,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:23,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119826494] [2022-03-01 16:50:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:23,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:23,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:23,430 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:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:24,017 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-03-01 16:50:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:50:24,018 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,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:24,029 INFO L225 Difference]: With dead ends: 9996 [2022-03-01 16:50:24,029 INFO L226 Difference]: Without dead ends: 9996 [2022-03-01 16:50:24,029 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:24,030 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:24,030 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:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-03-01 16:50:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-03-01 16:50:24,085 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:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-03-01 16:50:24,089 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-03-01 16:50:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:24,090 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-03-01 16:50:24,090 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,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-03-01 16:50:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:24,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:24,091 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,108 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:24,291 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:24,292 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:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-03-01 16:50:24,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:24,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98610007] [2022-03-01 16:50:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:24,435 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:24,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:24,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98610007] [2022-03-01 16:50:24,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98610007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:24,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645341630] [2022-03-01 16:50:24,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:24,444 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:24,459 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:24,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:24,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:24,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:24,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:24,860 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,891 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,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:24,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645341630] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:24,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:24,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:24,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541070909] [2022-03-01 16:50:24,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:24,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:24,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:24,892 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:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:25,801 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-03-01 16:50:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:50:25,801 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:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:25,811 INFO L225 Difference]: With dead ends: 9499 [2022-03-01 16:50:25,811 INFO L226 Difference]: Without dead ends: 9499 [2022-03-01 16:50:25,811 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:25,811 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:25,811 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.5s Time] [2022-03-01 16:50:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-03-01 16:50:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-03-01 16:50:25,859 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:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-03-01 16:50:25,864 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-03-01 16:50:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:25,864 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-03-01 16:50:25,864 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:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-03-01 16:50:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-01 16:50:25,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:25,865 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:25,883 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:26,065 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:26,066 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:26,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-03-01 16:50:26,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:26,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684559342] [2022-03-01 16:50:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,102 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:26,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:26,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684559342] [2022-03-01 16:50:26,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684559342] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:26,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714955571] [2022-03-01 16:50:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:26,103 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:26,104 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:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:50:26,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:26,441 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:26,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:26,553 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:26,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714955571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:26,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:26,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:50:26,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514928666] [2022-03-01 16:50:26,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:26,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:26,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:50:26,554 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:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:26,617 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-03-01 16:50:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:50:26,618 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:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:26,626 INFO L225 Difference]: With dead ends: 7477 [2022-03-01 16:50:26,626 INFO L226 Difference]: Without dead ends: 7477 [2022-03-01 16:50:26,627 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:26,627 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:26,627 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:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-01 16:50:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-03-01 16:50:26,693 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:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-03-01 16:50:26,703 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-03-01 16:50:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:26,703 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-03-01 16:50:26,703 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:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-03-01 16:50:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 16:50:26,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:26,704 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:26,721 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:26,905 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:26,905 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:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-03-01 16:50:26,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:26,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318780316] [2022-03-01 16:50:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,960 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:26,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:26,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318780316] [2022-03-01 16:50:26,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318780316] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:26,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:26,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:26,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634055049] [2022-03-01 16:50:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:26,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:26,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:26,962 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:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:27,130 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-03-01 16:50:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:27,130 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:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:27,140 INFO L225 Difference]: With dead ends: 8193 [2022-03-01 16:50:27,140 INFO L226 Difference]: Without dead ends: 7610 [2022-03-01 16:50:27,140 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:27,141 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:27,141 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.1s Time] [2022-03-01 16:50:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-01 16:50:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-03-01 16:50:27,231 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:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-03-01 16:50:27,239 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-03-01 16:50:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:27,240 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-03-01 16:50:27,240 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:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-03-01 16:50:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:27,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:27,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:50:27,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-01 16:50:27,243 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:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash 901308923, now seen corresponding path program 1 times [2022-03-01 16:50:27,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:27,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836240917] [2022-03-01 16:50:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:27,470 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:27,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:27,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836240917] [2022-03-01 16:50:27,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836240917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:27,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319663680] [2022-03-01 16:50:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:27,471 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:27,473 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:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:27,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:50:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:28,085 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:28,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,123 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:28,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,165 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:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:28,219 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:28,571 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:50:28,572 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:28,609 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:28,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:51:18,493 WARN L228 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:51:20,824 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| (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|) (+ |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_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|) (= |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|) (+ |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))) (>= |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 ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#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))) (>= |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 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#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| 1))) (> 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:51:48,298 WARN L228 SmtUtils]: Spent 9.83s 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:52:13,052 WARN L228 SmtUtils]: Spent 13.94s 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:52:13,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:22,039 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:52:22,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319663680] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:22,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:22,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:52:22,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001712471] [2022-03-01 16:52:22,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:22,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:52:22,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:22,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:52:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1243, Unknown=36, NotChecked=74, Total=1560 [2022-03-01 16:52:22,041 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:52:25,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (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_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (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 (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|) (+ |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_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|) (= |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|) (+ |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))) (>= |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 ((.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|) (+ |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|) .cse5))) (>= |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 (let ((.cse6 (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 .cse6 |c_~#cache~0.base| (store (select .cse6 |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))) (> 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 .cse1 |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|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:52:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:30,947 INFO L93 Difference]: Finished difference Result 16800 states and 33701 transitions. [2022-03-01 16:52:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:52:30,948 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:52:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:30,979 INFO L225 Difference]: With dead ends: 16800 [2022-03-01 16:52:30,979 INFO L226 Difference]: Without dead ends: 16800 [2022-03-01 16:52:30,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 115.1s TimeCoverageRelationStatistics Valid=622, Invalid=3131, Unknown=37, NotChecked=242, Total=4032 [2022-03-01 16:52:30,980 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 2132 mSDsluCounter, 5623 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 6112 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2582 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:30,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2132 Valid, 6112 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2045 Invalid, 0 Unknown, 2582 Unchecked, 4.6s Time] [2022-03-01 16:52:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16800 states. [2022-03-01 16:52:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16800 to 6992. [2022-03-01 16:52:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6992 states, 6979 states have (on average 2.012036108324975) internal successors, (14042), 6991 states have internal predecessors, (14042), 0 states have call successors, (0), 0 states 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:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 14042 transitions. [2022-03-01 16:52:31,124 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 14042 transitions. Word has length 134 [2022-03-01 16:52:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:31,125 INFO L470 AbstractCegarLoop]: Abstraction has 6992 states and 14042 transitions. [2022-03-01 16:52:31,125 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:52:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 14042 transitions. [2022-03-01 16:52:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:31,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:31,128 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:31,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-03-01 16:52:31,328 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:52:31,328 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:52:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2095982239, now seen corresponding path program 2 times [2022-03-01 16:52:31,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:31,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29660990] [2022-03-01 16:52:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:32,142 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,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:32,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29660990] [2022-03-01 16:52:32,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29660990] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:32,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991582718] [2022-03-01 16:52:32,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:52:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:32,144 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:52:32,144 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:52:32,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:52:32,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:32,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:52:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:33,070 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:33,380 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:33,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,514 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:33,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,634 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:33,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:33,950 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:34,630 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:52:34,631 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:34,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:34,917 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:35,026 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:35,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:37,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:37,842 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:38,338 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:38,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991582718] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:38,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:52:38,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:52:38,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140083233] [2022-03-01 16:52:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:38,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:52:38,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:38,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:52:38,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:52:38,340 INFO L87 Difference]: Start difference. First operand 6992 states and 14042 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:52:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:40,684 INFO L93 Difference]: Finished difference Result 9280 states and 18627 transitions. [2022-03-01 16:52:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:52:40,685 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:52:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:40,698 INFO L225 Difference]: With dead ends: 9280 [2022-03-01 16:52:40,698 INFO L226 Difference]: Without dead ends: 9280 [2022-03-01 16:52:40,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=263, Invalid=1899, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:52:40,698 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 308 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1007 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:40,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 2153 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 1007 Unchecked, 0.6s Time] [2022-03-01 16:52:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9280 states. [2022-03-01 16:52:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9280 to 7018. [2022-03-01 16:52:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7018 states, 7005 states have (on average 2.0119914346895076) internal successors, (14094), 7017 states have internal predecessors, (14094), 0 states have call successors, (0), 0 states 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:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7018 states to 7018 states and 14094 transitions. [2022-03-01 16:52:40,821 INFO L78 Accepts]: Start accepts. Automaton has 7018 states and 14094 transitions. Word has length 134 [2022-03-01 16:52:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:40,821 INFO L470 AbstractCegarLoop]: Abstraction has 7018 states and 14094 transitions. [2022-03-01 16:52:40,821 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:52:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7018 states and 14094 transitions. [2022-03-01 16:52:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:40,824 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:40,824 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:40,841 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:52:41,041 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:52:41,041 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:52:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash -339667099, now seen corresponding path program 3 times [2022-03-01 16:52:41,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:41,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995202117] [2022-03-01 16:52:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:41,877 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:41,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:41,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995202117] [2022-03-01 16:52:41,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995202117] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:41,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338074238] [2022-03-01 16:52:41,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:52:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:41,879 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:52:41,879 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:52:42,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:52:42,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:52:42,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:42,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:52:43,081 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:43,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,186 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:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,321 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:43,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:43,863 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:44,220 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:52:44,221 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:44,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:44,479 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:44,580 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:52:44,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:46,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:46,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:47,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:47,403 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:47,906 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:47,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338074238] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:47,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:52:47,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:52:47,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886328908] [2022-03-01 16:52:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:47,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:52:47,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:52:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:52:47,907 INFO L87 Difference]: Start difference. First operand 7018 states and 14094 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:52:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:50,449 INFO L93 Difference]: Finished difference Result 9168 states and 18410 transitions. [2022-03-01 16:52:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:52:50,449 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:52:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:50,460 INFO L225 Difference]: With dead ends: 9168 [2022-03-01 16:52:50,461 INFO L226 Difference]: Without dead ends: 9168 [2022-03-01 16:52:50,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:52:50,461 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 323 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1159 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:50,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 2182 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 1159 Unchecked, 0.6s Time] [2022-03-01 16:52:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9168 states. [2022-03-01 16:52:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9168 to 7022. [2022-03-01 16:52:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 7009 states have (on average 2.0119845912398344) internal successors, (14102), 7021 states have internal predecessors, (14102), 0 states have call successors, (0), 0 states 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:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 14102 transitions. [2022-03-01 16:52:50,553 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 14102 transitions. Word has length 134 [2022-03-01 16:52:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:50,554 INFO L470 AbstractCegarLoop]: Abstraction has 7022 states and 14102 transitions. [2022-03-01 16:52:50,554 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:52:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 14102 transitions. [2022-03-01 16:52:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:50,557 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:50,557 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:50,574 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:52:50,758 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:52:50,758 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:52:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -423512185, now seen corresponding path program 4 times [2022-03-01 16:52:50,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:50,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322219190] [2022-03-01 16:52:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:51,643 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:51,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:51,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322219190] [2022-03-01 16:52:51,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322219190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:51,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462517079] [2022-03-01 16:52:51,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:52:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:51,644 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:52:51,645 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:52:52,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:52:52,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:52,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-01 16:52:52,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:52,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:52:52,731 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,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:52,830 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:52,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:52,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:52,967 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,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,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 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-01 16:52:53,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,776 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:52:54,045 INFO L353 Elim1Store]: treesize reduction 212, result has 14.2 percent of original size [2022-03-01 16:52:54,046 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:52:54,065 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:54,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:09,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:09,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:09,422 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:53:09,436 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:53:09,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:09,442 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:53:10,060 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:10,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462517079] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:10,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:10,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 38 [2022-03-01 16:53:10,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383302638] [2022-03-01 16:53:10,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:10,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 16:53:10,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 16:53:10,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1287, Unknown=5, NotChecked=0, Total=1482 [2022-03-01 16:53:10,061 INFO L87 Difference]: Start difference. First operand 7022 states and 14102 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:53:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:28,082 INFO L93 Difference]: Finished difference Result 12705 states and 25250 transitions. [2022-03-01 16:53:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-01 16:53:28,082 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:53:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:28,102 INFO L225 Difference]: With dead ends: 12705 [2022-03-01 16:53:28,103 INFO L226 Difference]: Without dead ends: 12705 [2022-03-01 16:53:28,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=1022, Invalid=5134, Unknown=6, NotChecked=0, Total=6162 [2022-03-01 16:53:28,104 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 2391 mSDsluCounter, 7651 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 8284 SdHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2537 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:28,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2391 Valid, 8284 Invalid, 5042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2388 Invalid, 0 Unknown, 2537 Unchecked, 5.3s Time] [2022-03-01 16:53:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2022-03-01 16:53:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 7054. [2022-03-01 16:53:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7041 states have (on average 2.012214174122994) internal successors, (14168), 7053 states have internal predecessors, (14168), 0 states have call successors, (0), 0 states 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:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 14168 transitions. [2022-03-01 16:53:28,217 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 14168 transitions. Word has length 134 [2022-03-01 16:53:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:28,217 INFO L470 AbstractCegarLoop]: Abstraction has 7054 states and 14168 transitions. [2022-03-01 16:53:28,217 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:53:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 14168 transitions. [2022-03-01 16:53:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:28,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:28,220 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:28,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:28,420 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:53:28,421 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:53:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash -893918699, now seen corresponding path program 5 times [2022-03-01 16:53:28,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:28,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452796389] [2022-03-01 16:53:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:29,241 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:29,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:29,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452796389] [2022-03-01 16:53:29,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452796389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:29,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112299905] [2022-03-01 16:53:29,241 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:53:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:29,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:29,243 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:53:29,245 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:53:29,604 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:53:29,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:29,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:53:29,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:31,384 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:31,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:31,497 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:31,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:31,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:31,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:31,877 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:32,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,035 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:32,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:32,712 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:53:32,836 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:32,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:35,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:35,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:36,255 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:36,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112299905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:36,255 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:36,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:53:36,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021032121] [2022-03-01 16:53:36,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:36,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:53:36,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:53:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:53:36,256 INFO L87 Difference]: Start difference. First operand 7054 states and 14168 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:53:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:41,147 INFO L93 Difference]: Finished difference Result 7973 states and 15925 transitions. [2022-03-01 16:53:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:53:41,148 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:53:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:41,158 INFO L225 Difference]: With dead ends: 7973 [2022-03-01 16:53:41,158 INFO L226 Difference]: Without dead ends: 7973 [2022-03-01 16:53:41,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=585, Invalid=2607, Unknown=0, NotChecked=0, Total=3192 [2022-03-01 16:53:41,159 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 1397 mSDsluCounter, 4493 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 4942 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:41,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 4942 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1570 Invalid, 0 Unknown, 623 Unchecked, 3.1s Time] [2022-03-01 16:53:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2022-03-01 16:53:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 7066. [2022-03-01 16:53:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7066 states, 7053 states have (on average 2.0121933928824616) internal successors, (14192), 7065 states have internal predecessors, (14192), 0 states have call successors, (0), 0 states 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:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 14192 transitions. [2022-03-01 16:53:41,238 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 14192 transitions. Word has length 134 [2022-03-01 16:53:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:41,238 INFO L470 AbstractCegarLoop]: Abstraction has 7066 states and 14192 transitions. [2022-03-01 16:53:41,238 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:53:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 14192 transitions. [2022-03-01 16:53:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:41,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:41,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:53:41,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-01 16:53:41,442 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:53:41,442 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:53:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1859931871, now seen corresponding path program 6 times [2022-03-01 16:53:41,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:41,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618179640] [2022-03-01 16:53:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:42,157 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:42,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:42,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618179640] [2022-03-01 16:53:42,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618179640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:42,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66617477] [2022-03-01 16:53:42,158 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:53:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:42,160 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:53:42,161 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:53:42,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:53:42,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:42,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:53:42,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:43,036 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:53:43,333 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:43,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:43,433 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:43,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:43,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:43,762 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:44,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,037 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:44,355 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:53:44,355 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:53:44,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,607 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:53:44,706 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:53:44,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:46,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:53:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:47,457 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:53:47,938 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:53:47,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66617477] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:47,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:53:47,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:53:47,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442612624] [2022-03-01 16:53:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:47,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:53:47,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:53:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:53:47,940 INFO L87 Difference]: Start difference. First operand 7066 states and 14192 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:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:49,322 INFO L93 Difference]: Finished difference Result 9064 states and 18186 transitions. [2022-03-01 16:53:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:53:49,322 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:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:49,331 INFO L225 Difference]: With dead ends: 9064 [2022-03-01 16:53:49,331 INFO L226 Difference]: Without dead ends: 9064 [2022-03-01 16:53:49,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:53:49,332 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 246 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:49,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 1852 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 385 Unchecked, 0.4s Time] [2022-03-01 16:53:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2022-03-01 16:53:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 7074. [2022-03-01 16:53:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 7061 states have (on average 2.0121795779634613) internal successors, (14208), 7073 states have internal predecessors, (14208), 0 states have call successors, (0), 0 states 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:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 14208 transitions. [2022-03-01 16:53:49,401 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 14208 transitions. Word has length 134 [2022-03-01 16:53:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:49,401 INFO L470 AbstractCegarLoop]: Abstraction has 7074 states and 14208 transitions. [2022-03-01 16:53:49,401 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:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 14208 transitions. [2022-03-01 16:53:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:49,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:49,404 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:49,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-01 16:53:49,604 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:49,604 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:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1776086785, now seen corresponding path program 7 times [2022-03-01 16:53:49,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:49,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311986228] [2022-03-01 16:53:49,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:50,478 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:50,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:50,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311986228] [2022-03-01 16:53:50,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311986228] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:50,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880936114] [2022-03-01 16:53:50,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:53:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:50,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:50,480 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:50,481 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:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:50,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:53:50,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:51,871 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:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:51,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 16:53:52,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,281 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:52,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:52,715 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:53,025 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:53:53,025 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:53,132 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:53,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:55,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (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_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_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)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))))) is different from false [2022-03-01 16:53:58,071 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:48,826 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:54:48,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880936114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:54:48,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:54:48,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:54:48,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651370636] [2022-03-01 16:54:48,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:54:48,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:54:48,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:54:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1216, Unknown=23, NotChecked=146, Total=1560 [2022-03-01 16:54:48,828 INFO L87 Difference]: Start difference. First operand 7074 states and 14208 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:53,764 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |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_~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 ((.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| 1)))) (forall ((v_ArrVal_5666 Int)) (= (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|) |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 ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5666 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |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|))) (< (+ (* |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 .cse1 |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|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:54:56,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (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_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_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)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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)) (= |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 (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_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_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (= |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:54:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:59,181 INFO L93 Difference]: Finished difference Result 21586 states and 43272 transitions. [2022-03-01 16:54:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:54:59,181 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:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:59,211 INFO L225 Difference]: With dead ends: 21586 [2022-03-01 16:54:59,211 INFO L226 Difference]: Without dead ends: 21586 [2022-03-01 16:54:59,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 60.3s TimeCoverageRelationStatistics Valid=410, Invalid=2661, Unknown=25, NotChecked=444, Total=3540 [2022-03-01 16:54:59,212 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 1727 mSDsluCounter, 6563 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 6968 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2030 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:59,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1727 Valid, 6968 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2473 Invalid, 0 Unknown, 2030 Unchecked, 4.9s Time] [2022-03-01 16:54:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21586 states. [2022-03-01 16:54:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21586 to 7136. [2022-03-01 16:54:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 7123 states have (on average 2.0123543450793204) internal successors, (14334), 7135 states have internal predecessors, (14334), 0 states have call successors, (0), 0 states 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:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 14334 transitions. [2022-03-01 16:54:59,346 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 14334 transitions. Word has length 134 [2022-03-01 16:54:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:59,346 INFO L470 AbstractCegarLoop]: Abstraction has 7136 states and 14334 transitions. [2022-03-01 16:54:59,346 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:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 14334 transitions. [2022-03-01 16:54:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:54:59,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:59,349 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:59,366 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:59,553 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:59,553 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:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 802601147, now seen corresponding path program 8 times [2022-03-01 16:54:59,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:59,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036092626] [2022-03-01 16:54:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:00,288 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:00,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:00,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036092626] [2022-03-01 16:55:00,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036092626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:00,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50920319] [2022-03-01 16:55:00,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:55:00,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:00,289 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:55:00,290 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:55:00,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:55:00,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:00,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:55:00,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:01,191 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:01,505 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:01,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:01,638 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:02,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,092 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:02,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,239 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:02,683 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:55:02,683 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:02,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:02,916 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:03,028 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:03,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:05,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:05,761 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:06,270 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:06,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50920319] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:06,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:55:06,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:55:06,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58715104] [2022-03-01 16:55:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:06,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:55:06,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:55:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:55:06,271 INFO L87 Difference]: Start difference. First operand 7136 states and 14334 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:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:08,377 INFO L93 Difference]: Finished difference Result 9187 states and 18424 transitions. [2022-03-01 16:55:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:08,377 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:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:08,388 INFO L225 Difference]: With dead ends: 9187 [2022-03-01 16:55:08,388 INFO L226 Difference]: Without dead ends: 9187 [2022-03-01 16:55:08,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:55:08,389 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 245 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1070 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:08,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 2236 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 1070 Unchecked, 0.4s Time] [2022-03-01 16:55:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9187 states. [2022-03-01 16:55:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9187 to 7140. [2022-03-01 16:55:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 7127 states have (on average 2.0123474112529816) internal successors, (14342), 7139 states have internal predecessors, (14342), 0 states have call successors, (0), 0 states 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:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 14342 transitions. [2022-03-01 16:55:08,480 INFO L78 Accepts]: Start accepts. Automaton has 7140 states and 14342 transitions. Word has length 134 [2022-03-01 16:55:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:08,480 INFO L470 AbstractCegarLoop]: Abstraction has 7140 states and 14342 transitions. [2022-03-01 16:55:08,480 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:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7140 states and 14342 transitions. [2022-03-01 16:55:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:08,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:08,482 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:08,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-01 16:55:08,683 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:55:08,683 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:55:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 718756061, now seen corresponding path program 9 times [2022-03-01 16:55:08,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:08,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116525563] [2022-03-01 16:55:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:09,495 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,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:09,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116525563] [2022-03-01 16:55:09,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116525563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:09,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007140650] [2022-03-01 16:55:09,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:55:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:09,496 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:55:09,497 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:55:09,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:55:09,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:09,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:55:09,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:10,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:55:10,701 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:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:10,807 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:11,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,350 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:11,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:11,664 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:11,835 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:55:11,836 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:12,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:12,101 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:12,213 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:12,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:14,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:15,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:15,106 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:15,600 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:15,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007140650] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:15,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:55:15,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:55:15,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123133239] [2022-03-01 16:55:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:15,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:55:15,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:55:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:55:15,602 INFO L87 Difference]: Start difference. First operand 7140 states and 14342 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:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:16,996 INFO L93 Difference]: Finished difference Result 9116 states and 18291 transitions. [2022-03-01 16:55:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:16,996 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:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:17,008 INFO L225 Difference]: With dead ends: 9116 [2022-03-01 16:55:17,008 INFO L226 Difference]: Without dead ends: 9116 [2022-03-01 16:55:17,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:55:17,009 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 228 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:17,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1840 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 445 Unchecked, 0.4s Time] [2022-03-01 16:55:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9116 states. [2022-03-01 16:55:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9116 to 7146. [2022-03-01 16:55:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7146 states, 7133 states have (on average 2.0123370250946304) internal successors, (14354), 7145 states have internal predecessors, (14354), 0 states have call successors, (0), 0 states 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:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 14354 transitions. [2022-03-01 16:55:17,084 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 14354 transitions. Word has length 134 [2022-03-01 16:55:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:17,084 INFO L470 AbstractCegarLoop]: Abstraction has 7146 states and 14354 transitions. [2022-03-01 16:55:17,085 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:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 14354 transitions. [2022-03-01 16:55:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:17,087 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:17,087 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:17,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-01 16:55:17,287 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:17,288 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:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1383691181, now seen corresponding path program 10 times [2022-03-01 16:55:17,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:17,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648820669] [2022-03-01 16:55:17,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:18,001 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:18,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:18,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648820669] [2022-03-01 16:55:18,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648820669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:18,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052081546] [2022-03-01 16:55:18,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:55:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:18,002 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:18,003 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:18,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:55:18,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:18,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:55:18,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:19,517 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:19,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:19,621 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:20,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,038 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:20,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,332 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:20,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:20,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:55:20,574 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:20,684 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:20,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:23,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:23,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:24,290 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:24,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052081546] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:55:24,290 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:55:24,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:55:24,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448230965] [2022-03-01 16:55:24,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:55:24,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:55:24,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:55:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:55:24,291 INFO L87 Difference]: Start difference. First operand 7146 states and 14354 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:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:30,282 INFO L93 Difference]: Finished difference Result 8220 states and 16426 transitions. [2022-03-01 16:55:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:55:30,282 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:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:30,293 INFO L225 Difference]: With dead ends: 8220 [2022-03-01 16:55:30,293 INFO L226 Difference]: Without dead ends: 8220 [2022-03-01 16:55:30,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=675, Invalid=2985, Unknown=0, NotChecked=0, Total=3660 [2022-03-01 16:55:30,294 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 1530 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1081 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:30,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1530 Valid, 4794 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1888 Invalid, 0 Unknown, 1081 Unchecked, 3.7s Time] [2022-03-01 16:55:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8220 states. [2022-03-01 16:55:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8220 to 7144. [2022-03-01 16:55:30,368 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:55:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 14350 transitions. [2022-03-01 16:55:30,378 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 14350 transitions. Word has length 134 [2022-03-01 16:55:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:30,379 INFO L470 AbstractCegarLoop]: Abstraction has 7144 states and 14350 transitions. [2022-03-01 16:55:30,379 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:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 14350 transitions. [2022-03-01 16:55:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:30,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:30,381 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:30,400 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:30,582 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:30,582 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:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1570150843, now seen corresponding path program 11 times [2022-03-01 16:55:30,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:30,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622377336] [2022-03-01 16:55:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:31,304 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:31,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:31,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622377336] [2022-03-01 16:55:31,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622377336] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:31,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035446860] [2022-03-01 16:55:31,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:55:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:31,305 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:31,306 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:31,687 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:55:31,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:31,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:55:31,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:33,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:55:33,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:33,550 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:34,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,136 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:34,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,279 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:34,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:34,569 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:34,686 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:34,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:37,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:37,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:38,343 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:38,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035446860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:55:38,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:55:38,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:55:38,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037794227] [2022-03-01 16:55:38,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:55:38,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:55:38,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:55:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:55:38,345 INFO L87 Difference]: Start difference. First operand 7144 states and 14350 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:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:44,654 INFO L93 Difference]: Finished difference Result 8631 states and 17285 transitions. [2022-03-01 16:55:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:55:44,655 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:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:44,664 INFO L225 Difference]: With dead ends: 8631 [2022-03-01 16:55:44,665 INFO L226 Difference]: Without dead ends: 8631 [2022-03-01 16:55:44,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=711, Invalid=3071, Unknown=0, NotChecked=0, Total=3782 [2022-03-01 16:55:44,665 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 1594 mSDsluCounter, 5013 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1301 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:44,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1594 Valid, 5472 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1914 Invalid, 0 Unknown, 1301 Unchecked, 3.8s Time] [2022-03-01 16:55:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2022-03-01 16:55:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 7216. [2022-03-01 16:55:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7216 states, 7203 states have (on average 2.0130501180063862) internal successors, (14500), 7215 states have internal predecessors, (14500), 0 states have call successors, (0), 0 states 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:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7216 states to 7216 states and 14500 transitions. [2022-03-01 16:55:44,742 INFO L78 Accepts]: Start accepts. Automaton has 7216 states and 14500 transitions. Word has length 134 [2022-03-01 16:55:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:44,742 INFO L470 AbstractCegarLoop]: Abstraction has 7216 states and 14500 transitions. [2022-03-01 16:55:44,742 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:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7216 states and 14500 transitions. [2022-03-01 16:55:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:44,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:44,744 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:44,762 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:44,945 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:44,946 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:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1287692449, now seen corresponding path program 12 times [2022-03-01 16:55:44,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:44,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735409573] [2022-03-01 16:55:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:45,741 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:45,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:45,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735409573] [2022-03-01 16:55:45,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735409573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:45,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984162461] [2022-03-01 16:55:45,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:55:45,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:45,742 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:45,743 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:46,018 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:55:46,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:46,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:55:46,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:46,611 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:46,897 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:47,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,009 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:47,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,294 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:47,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,772 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:47,943 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:55:47,943 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:48,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:48,178 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:48,276 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:55:48,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:50,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:51,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:51,033 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,503 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,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984162461] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:51,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:55:51,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:55:51,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559127467] [2022-03-01 16:55:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:51,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:55:51,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:55:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:55:51,505 INFO L87 Difference]: Start difference. First operand 7216 states and 14500 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,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:53,093 INFO L93 Difference]: Finished difference Result 9282 states and 18650 transitions. [2022-03-01 16:55:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:53,094 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,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:53,105 INFO L225 Difference]: With dead ends: 9282 [2022-03-01 16:55:53,105 INFO L226 Difference]: Without dead ends: 9282 [2022-03-01 16:55:53,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:55:53,105 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 263 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 781 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:53,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 1890 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 781 Unchecked, 0.5s Time] [2022-03-01 16:55:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9282 states. [2022-03-01 16:55:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9282 to 7218. [2022-03-01 16:55:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7218 states, 7205 states have (on average 2.0130464954892435) internal successors, (14504), 7217 states have internal predecessors, (14504), 0 states have call successors, (0), 0 states 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,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7218 states to 7218 states and 14504 transitions. [2022-03-01 16:55:53,185 INFO L78 Accepts]: Start accepts. Automaton has 7218 states and 14504 transitions. Word has length 134 [2022-03-01 16:55:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:53,186 INFO L470 AbstractCegarLoop]: Abstraction has 7218 states and 14504 transitions. [2022-03-01 16:55:53,186 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,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7218 states and 14504 transitions. [2022-03-01 16:55:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:53,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:53,188 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,205 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,388 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,389 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,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1952627569, now seen corresponding path program 13 times [2022-03-01 16:55:53,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:53,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842076933] [2022-03-01 16:55:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:54,085 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:54,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:54,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842076933] [2022-03-01 16:55:54,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842076933] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:54,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108432601] [2022-03-01 16:55:54,086 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:55:54,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:54,087 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:54,088 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:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:55:54,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:55,416 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:55,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:55,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 16:55:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:55,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:55,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:55,794 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:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:56,268 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:56,567 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:55:56,568 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:56,690 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:56,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:59,347 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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 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_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|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (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:59,747 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:56:59,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108432601] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:56:59,747 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:56:59,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:56:59,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300484442] [2022-03-01 16:56:59,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:56:59,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:56:59,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:56:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1278, Unknown=27, NotChecked=74, Total=1560 [2022-03-01 16:56:59,748 INFO L87 Difference]: Start difference. First operand 7218 states and 14504 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:57:05,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |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_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |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|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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 ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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 ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |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_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (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:57:07,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |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 .cse1 (+ |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_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 .cse1 |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|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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 ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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 ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |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_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (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:57:09,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 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 .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))) (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 ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_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 ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_6585 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |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_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 (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_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:57:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:57:14,305 INFO L93 Difference]: Finished difference Result 14379 states and 28805 transitions. [2022-03-01 16:57:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:57:14,305 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:57:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:57:14,323 INFO L225 Difference]: With dead ends: 14379 [2022-03-01 16:57:14,323 INFO L226 Difference]: Without dead ends: 14379 [2022-03-01 16:57:14,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=448, Invalid=2508, Unknown=30, NotChecked=436, Total=3422 [2022-03-01 16:57:14,323 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 1691 mSDsluCounter, 6160 mSDsCounter, 0 mSdLazyCounter, 2976 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 6615 SdHoareTripleChecker+Invalid, 4718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1641 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:57:14,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1691 Valid, 6615 Invalid, 4718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2976 Invalid, 0 Unknown, 1641 Unchecked, 6.8s Time] [2022-03-01 16:57:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14379 states. [2022-03-01 16:57:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14379 to 7214. [2022-03-01 16:57:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7214 states, 7201 states have (on average 2.013053742535759) internal successors, (14496), 7213 states have internal predecessors, (14496), 0 states have call successors, (0), 0 states 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:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 14496 transitions. [2022-03-01 16:57:14,424 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 14496 transitions. Word has length 134 [2022-03-01 16:57:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:57:14,424 INFO L470 AbstractCegarLoop]: Abstraction has 7214 states and 14496 transitions. [2022-03-01 16:57:14,425 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:57:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 14496 transitions. [2022-03-01 16:57:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:57:14,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:57:14,427 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:14,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-01 16:57:14,627 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:57:14,627 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:57:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:57:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1326684133, now seen corresponding path program 14 times [2022-03-01 16:57:14,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:57:14,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163707663] [2022-03-01 16:57:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:57:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:57:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:57:15,463 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:15,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:57:15,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163707663] [2022-03-01 16:57:15,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163707663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:15,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509165275] [2022-03-01 16:57:15,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:57:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:57:15,464 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:57:15,465 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:15,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:57:15,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:15,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:57:15,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57: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:57:16,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:16,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:16,913 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:17,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,194 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:17,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:17,593 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:17,995 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:57:17,996 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:18,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,270 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:18,389 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:57:18,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:20,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:20,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:21,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:21,499 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:22,015 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:22,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509165275] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:22,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:57:22,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:57:22,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715105209] [2022-03-01 16:57:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:57:22,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:57:22,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:57:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:57:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:57:22,017 INFO L87 Difference]: Start difference. First operand 7214 states and 14496 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:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:57:23,998 INFO L93 Difference]: Finished difference Result 9286 states and 18656 transitions. [2022-03-01 16:57:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:57:23,998 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:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:57:24,009 INFO L225 Difference]: With dead ends: 9286 [2022-03-01 16:57:24,009 INFO L226 Difference]: Without dead ends: 9286 [2022-03-01 16:57:24,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=215, Invalid=1677, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:57:24,009 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 296 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 798 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:57:24,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 1710 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 798 Unchecked, 0.6s Time] [2022-03-01 16:57:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9286 states. [2022-03-01 16:57:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9286 to 7206. [2022-03-01 16:57:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 7193 states have (on average 2.01306826080912) internal successors, (14480), 7205 states have internal predecessors, (14480), 0 states have call successors, (0), 0 states 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:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 14480 transitions. [2022-03-01 16:57:24,086 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 14480 transitions. Word has length 134 [2022-03-01 16:57:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:57:24,086 INFO L470 AbstractCegarLoop]: Abstraction has 7206 states and 14480 transitions. [2022-03-01 16:57:24,086 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:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 14480 transitions. [2022-03-01 16:57:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:57:24,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:57:24,089 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:24,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-01 16:57:24,289 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:24,289 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:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:57:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -468459355, now seen corresponding path program 15 times [2022-03-01 16:57:24,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:57:24,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797675023] [2022-03-01 16:57:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:57:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:57:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:57:25,096 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:25,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:57:25,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797675023] [2022-03-01 16:57:25,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797675023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:25,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56653375] [2022-03-01 16:57:25,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:57:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:57:25,098 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:25,099 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:25,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:57:25,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:25,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:57:25,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57:26,117 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:26,433 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:26,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:26,877 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:27,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,047 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:27,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,207 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:27,623 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:57:27,623 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:27,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:27,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 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:28,019 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:57:28,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:30,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:30,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:31,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:31,184 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:31,716 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:31,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56653375] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:31,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:57:31,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:57:31,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009014753] [2022-03-01 16:57:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:57:31,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:57:31,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:57:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:57:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:57:31,717 INFO L87 Difference]: Start difference. First operand 7206 states and 14480 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:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:57:34,697 INFO L93 Difference]: Finished difference Result 8783 states and 17652 transitions. [2022-03-01 16:57:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:57:34,698 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:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:57:34,708 INFO L225 Difference]: With dead ends: 8783 [2022-03-01 16:57:34,708 INFO L226 Difference]: Without dead ends: 8783 [2022-03-01 16:57:34,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:57:34,710 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 198 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:57:34,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1358 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 387 Unchecked, 0.3s Time] [2022-03-01 16:57:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8783 states. [2022-03-01 16:57:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8783 to 7224. [2022-03-01 16:57:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 7211 states have (on average 2.013035639994453) internal successors, (14516), 7223 states have internal predecessors, (14516), 0 states have call successors, (0), 0 states 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:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 14516 transitions. [2022-03-01 16:57:34,789 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 14516 transitions. Word has length 134 [2022-03-01 16:57:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:57:34,789 INFO L470 AbstractCegarLoop]: Abstraction has 7224 states and 14516 transitions. [2022-03-01 16:57:34,789 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:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 14516 transitions. [2022-03-01 16:57:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:57:34,791 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:57:34,791 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:34,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-01 16:57:34,992 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:34,992 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:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:57:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -552304441, now seen corresponding path program 16 times [2022-03-01 16:57:34,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:57:34,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617577789] [2022-03-01 16:57:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:57:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:57:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:57:35,851 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:35,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:57:35,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617577789] [2022-03-01 16:57:35,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617577789] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:35,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343409751] [2022-03-01 16:57:35,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:57:35,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:35,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:57:35,853 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:35,854 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:36,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:57:36,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:36,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-01 16:57:36,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57:36,804 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:37,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,008 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:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,045 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:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-01 16:57:37,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:37,474 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:57:37,474 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:37,492 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:37,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:40,183 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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))))) is different from false [2022-03-01 16:57:42,420 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:57:44,540 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)) (= |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_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|) .cse1)))) (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 (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_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)) (= |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 (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|) .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)))) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |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 .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|)))))) is different from false [2022-03-01 16:57:46,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |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| 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 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 (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|) |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|))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |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:58:08,069 WARN L228 SmtUtils]: Spent 13.46s 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:08,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:08,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:10,787 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:58:10,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343409751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:58:10,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:58:10,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2022-03-01 16:58:10,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913957385] [2022-03-01 16:58:10,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:58:10,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 16:58:10,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:58:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 16:58:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=520, Unknown=6, NotChecked=196, Total=812 [2022-03-01 16:58:10,788 INFO L87 Difference]: Start difference. First operand 7224 states and 14516 transitions. Second operand has 29 states, 28 states have (on average 5.642857142857143) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:14,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |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| 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 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 (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|) |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|))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |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| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_~i~0#1| 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|)) (= |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:16,629 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |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| 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 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 (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|) |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|))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |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| 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|)) (= |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:58:18,812 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |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)) (= |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_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|) .cse1)))) (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 (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_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)) (= |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 (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|) .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)))) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |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 .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|)))))) (= |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|))) is different from false [2022-03-01 16:58:20,879 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 28 |c_~#cache~0.offset|)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|) (and (forall ((v_ArrVal_7045 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |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| 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 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 (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|) |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|))) (forall ((v_ArrVal_7045 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_74| v_ArrVal_7045))) |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_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse7 (+ |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_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= .cse8 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|) (<= .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:58:22,969 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:25,013 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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_7045 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7045 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 (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_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| (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:58:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:58:28,818 INFO L93 Difference]: Finished difference Result 13920 states and 27973 transitions. [2022-03-01 16:58:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:58:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.642857142857143) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have 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:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:58:28,835 INFO L225 Difference]: With dead ends: 13920 [2022-03-01 16:58:28,835 INFO L226 Difference]: Without dead ends: 13920 [2022-03-01 16:58:28,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=192, Invalid=1096, Unknown=12, NotChecked=770, Total=2070 [2022-03-01 16:58:28,836 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 979 mSDsluCounter, 4579 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 5394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2930 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:58:28,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 5034 Invalid, 5394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2386 Invalid, 0 Unknown, 2930 Unchecked, 5.2s Time] [2022-03-01 16:58:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13920 states. [2022-03-01 16:58:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13920 to 7222. [2022-03-01 16:58:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7222 states, 7209 states have (on average 2.0130392564849493) internal successors, (14512), 7221 states have internal predecessors, (14512), 0 states have call successors, (0), 0 states 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:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 14512 transitions. [2022-03-01 16:58:28,937 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 14512 transitions. Word has length 134 [2022-03-01 16:58:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:58:28,937 INFO L470 AbstractCegarLoop]: Abstraction has 7222 states and 14512 transitions. [2022-03-01 16:58:28,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.642857142857143) internal successors, (158), 29 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 14512 transitions. [2022-03-01 16:58:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:58:28,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:58:28,939 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:28,957 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:29,147 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:29,147 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:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:58:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1227182707, now seen corresponding path program 17 times [2022-03-01 16:58:29,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:58:29,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166328541] [2022-03-01 16:58:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:58:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:58:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:58:29,959 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:29,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:58:29,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166328541] [2022-03-01 16:58:29,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166328541] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:58:29,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155353605] [2022-03-01 16:58:29,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:58:29,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:58:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:58:29,961 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:29,961 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:30,574 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:58:30,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:58:30,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:58:30,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:58:32,477 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:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:32,919 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:33,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,113 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:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,412 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:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:33,748 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:58:33,879 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:33,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:58:36,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:36,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:37,953 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:37,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155353605] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:58:37,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:58:37,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:58:37,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015064168] [2022-03-01 16:58:37,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:58:37,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:58:37,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:58:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:58:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:58:37,955 INFO L87 Difference]: Start difference. First operand 7222 states and 14512 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:58:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:58:41,940 INFO L93 Difference]: Finished difference Result 8051 states and 16083 transitions. [2022-03-01 16:58:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:58:41,940 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:58:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:58:41,949 INFO L225 Difference]: With dead ends: 8051 [2022-03-01 16:58:41,949 INFO L226 Difference]: Without dead ends: 8051 [2022-03-01 16:58:41,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=455, Invalid=2515, Unknown=0, NotChecked=0, Total=2970 [2022-03-01 16:58:41,950 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 1291 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 699 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:58:41,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1291 Valid, 3919 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 960 Invalid, 0 Unknown, 699 Unchecked, 2.1s Time] [2022-03-01 16:58:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8051 states. [2022-03-01 16:58:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8051 to 7224. [2022-03-01 16:58:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 7211 states have (on average 2.013035639994453) internal successors, (14516), 7223 states have internal predecessors, (14516), 0 states have call successors, (0), 0 states 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:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 14516 transitions. [2022-03-01 16:58:42,021 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 14516 transitions. Word has length 134 [2022-03-01 16:58:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:58:42,021 INFO L470 AbstractCegarLoop]: Abstraction has 7224 states and 14516 transitions. [2022-03-01 16:58:42,021 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:58:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 14516 transitions. [2022-03-01 16:58:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:58:42,023 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:58:42,023 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:42,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-01 16:58:42,223 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:58:42,224 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:58:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:58:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash -562247587, now seen corresponding path program 18 times [2022-03-01 16:58:42,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:58:42,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312068827] [2022-03-01 16:58:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:58:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:58:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:58:43,051 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:43,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:58:43,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312068827] [2022-03-01 16:58:43,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312068827] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:58:43,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627049654] [2022-03-01 16:58:43,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:58:43,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:58:43,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:58:43,053 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:58:43,054 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:58:43,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:58:43,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:58:43,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:58:43,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:58:44,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:58:44,383 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:44,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:44,812 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:44,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:44,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:44,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:44,984 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:45,318 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:58:45,319 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:58:45,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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:58:45,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:45,802 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:58:45,925 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:58:45,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:58:48,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:48,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:49,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:49,223 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:58:49,770 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:58:49,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627049654] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:58:49,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:58:49,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:58:49,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43809451] [2022-03-01 16:58:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:58:49,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:58:49,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:58:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:58:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:58:49,772 INFO L87 Difference]: Start difference. First operand 7224 states and 14516 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:58:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:58:53,162 INFO L93 Difference]: Finished difference Result 9150 states and 18390 transitions. [2022-03-01 16:58:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:58:53,162 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:58:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:58:53,172 INFO L225 Difference]: With dead ends: 9150 [2022-03-01 16:58:53,172 INFO L226 Difference]: Without dead ends: 9150 [2022-03-01 16:58:53,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:58:53,172 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 250 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:58:53,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 1882 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 1001 Unchecked, 0.6s Time] [2022-03-01 16:58:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9150 states. [2022-03-01 16:58:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9150 to 7230. [2022-03-01 16:58:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7230 states, 7217 states have (on average 2.013024802549536) internal successors, (14528), 7229 states have internal predecessors, (14528), 0 states have call successors, (0), 0 states 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:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 14528 transitions. [2022-03-01 16:58:53,246 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 14528 transitions. Word has length 134 [2022-03-01 16:58:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:58:53,246 INFO L470 AbstractCegarLoop]: Abstraction has 7230 states and 14528 transitions. [2022-03-01 16:58:53,246 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:58:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 14528 transitions. [2022-03-01 16:58:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:58:53,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:58:53,249 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:53,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-01 16:58:53,449 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:58:53,450 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:58:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:58:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -539129647, now seen corresponding path program 19 times [2022-03-01 16:58:53,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:58:53,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047840346] [2022-03-01 16:58:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:58:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:58:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:58:54,182 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:54,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:58:54,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047840346] [2022-03-01 16:58:54,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047840346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:58:54,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278215712] [2022-03-01 16:58:54,183 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:58:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:58:54,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:58:54,184 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:58:54,186 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:58:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:58:54,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:58:54,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:58:55,765 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,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:56,194 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:56,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:56,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:56,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:56,361 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:56,809 INFO L353 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2022-03-01 16:58:56,809 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 44 treesize of output 49 [2022-03-01 16:58:56,978 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:58:56,979 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:58:57,108 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:57,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:59:03,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7500 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| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7500 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| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-01 17:00:07,580 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 17:00:07,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278215712] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:00:07,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:00:07,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2022-03-01 17:00:07,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330162062] [2022-03-01 17:00:07,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:00:07,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 17:00:07,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:00:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 17:00:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1228, Unknown=30, NotChecked=72, Total=1482 [2022-03-01 17:00:07,581 INFO L87 Difference]: Start difference. First operand 7230 states and 14528 transitions. Second operand has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 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:00:12,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.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_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |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_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7500 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| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |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 .cse1 |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 17:00:14,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (and (forall ((v_ArrVal_7500 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| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7500 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |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_80| v_ArrVal_7500))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |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|)))) is different from false [2022-03-01 17:00:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:00:21,369 INFO L93 Difference]: Finished difference Result 17203 states and 34571 transitions. [2022-03-01 17:00:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 17:00:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 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:00:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:00:21,390 INFO L225 Difference]: With dead ends: 17203 [2022-03-01 17:00:21,391 INFO L226 Difference]: Without dead ends: 17203 [2022-03-01 17:00:21,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=825, Invalid=4267, Unknown=32, NotChecked=426, Total=5550 [2022-03-01 17:00:21,391 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 2193 mSDsluCounter, 5576 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1692 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-01 17:00:21,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2193 Valid, 6010 Invalid, 3900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1998 Invalid, 0 Unknown, 1692 Unchecked, 5.4s Time] [2022-03-01 17:00:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17203 states. [2022-03-01 17:00:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17203 to 7224. [2022-03-01 17:00:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7224 states, 7211 states have (on average 2.013035639994453) internal successors, (14516), 7223 states have internal predecessors, (14516), 0 states have call successors, (0), 0 states 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:00:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 14516 transitions. [2022-03-01 17:00:21,527 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 14516 transitions. Word has length 134 [2022-03-01 17:00:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:00:21,527 INFO L470 AbstractCegarLoop]: Abstraction has 7224 states and 14516 transitions. [2022-03-01 17:00:21,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 6.105263157894737) internal successors, (232), 39 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:00:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 14516 transitions. [2022-03-01 17:00:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:00:21,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:00:21,530 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:00:21,553 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:00:21,750 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:00:21,751 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:00:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:00:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 299090341, now seen corresponding path program 20 times [2022-03-01 17:00:21,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:00:21,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202725787] [2022-03-01 17:00:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:00:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:00:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:00:22,783 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:00:22,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:00:22,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202725787] [2022-03-01 17:00:22,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202725787] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:00:22,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925818313] [2022-03-01 17:00:22,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 17:00:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:00:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:00:22,785 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:00:22,785 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:00:23,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 17:00:23,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:00:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:00:23,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:00:24,000 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:00:24,377 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:00:24,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:24,924 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:00:25,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,302 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:00:25,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:25,503 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:00:25,725 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:00:25,726 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:00:26,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:26,085 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:00:26,218 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:00:26,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:00:29,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:29,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:29,879 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:00:30,480 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:00:30,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925818313] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:00:30,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:00:30,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:00:30,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938773121] [2022-03-01 17:00:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:00:30,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:00:30,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:00:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:00:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:00:30,481 INFO L87 Difference]: Start difference. First operand 7224 states and 14516 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:00:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:00:33,654 INFO L93 Difference]: Finished difference Result 9162 states and 18409 transitions. [2022-03-01 17:00:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 17:00:33,654 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:00:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:00:33,666 INFO L225 Difference]: With dead ends: 9162 [2022-03-01 17:00:33,666 INFO L226 Difference]: Without dead ends: 9162 [2022-03-01 17:00:33,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=200, Invalid=1692, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 17:00:33,667 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 229 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 17:00:33,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 1684 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 371 Unchecked, 0.7s Time] [2022-03-01 17:00:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9162 states. [2022-03-01 17:00:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9162 to 7228. [2022-03-01 17:00:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7228 states, 7215 states have (on average 2.013028413028413) internal successors, (14524), 7227 states have internal predecessors, (14524), 0 states have call successors, (0), 0 states 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:00:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7228 states to 7228 states and 14524 transitions. [2022-03-01 17:00:33,767 INFO L78 Accepts]: Start accepts. Automaton has 7228 states and 14524 transitions. Word has length 134 [2022-03-01 17:00:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:00:33,767 INFO L470 AbstractCegarLoop]: Abstraction has 7228 states and 14524 transitions. [2022-03-01 17:00:33,767 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:00:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7228 states and 14524 transitions. [2022-03-01 17:00:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:00:33,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:00:33,770 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:00:33,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-03-01 17:00:33,970 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:00:33,971 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:00:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:00:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 964025461, now seen corresponding path program 21 times [2022-03-01 17:00:33,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:00:33,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920915411] [2022-03-01 17:00:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:00:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:00:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:00:34,999 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:00:34,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:00:34,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920915411] [2022-03-01 17:00:34,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920915411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:00:34,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566347207] [2022-03-01 17:00:34,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 17:00:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:00:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:00:35,000 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:00:35,001 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:00:35,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 17:00:35,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:00:35,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:00:35,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:00:36,178 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:00:36,555 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:00:37,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 17:00:37,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,497 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:00:37,704 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:00:37,704 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:00:37,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:37,937 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:00:38,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:38,266 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:00:38,402 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:00:38,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:00:41,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:41,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:42,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:42,284 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:00:42,888 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:00:42,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566347207] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:00:42,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:00:42,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:00:42,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027433782] [2022-03-01 17:00:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:00:42,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:00:42,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:00:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:00:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:00:42,890 INFO L87 Difference]: Start difference. First operand 7228 states and 14524 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:00:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:00:45,024 INFO L93 Difference]: Finished difference Result 8713 states and 17490 transitions. [2022-03-01 17:00:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 17:00:45,025 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:00:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:00:45,036 INFO L225 Difference]: With dead ends: 8713 [2022-03-01 17:00:45,036 INFO L226 Difference]: Without dead ends: 8713 [2022-03-01 17:00:45,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 17:00:45,041 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 176 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 17:00:45,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 1712 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 384 Unchecked, 0.2s Time] [2022-03-01 17:00:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8713 states. [2022-03-01 17:00:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8713 to 7232. [2022-03-01 17:00:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 7219 states have (on average 2.013021194071201) internal successors, (14532), 7231 states have internal predecessors, (14532), 0 states have call successors, (0), 0 states 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:00:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 14532 transitions. [2022-03-01 17:00:45,128 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 14532 transitions. Word has length 134 [2022-03-01 17:00:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:00:45,129 INFO L470 AbstractCegarLoop]: Abstraction has 7232 states and 14532 transitions. [2022-03-01 17:00:45,129 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:00:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 14532 transitions. [2022-03-01 17:00:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:00:45,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:00:45,131 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:00:45,155 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:00:45,333 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:00:45,333 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:00:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:00:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 987118291, now seen corresponding path program 22 times [2022-03-01 17:00:45,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:00:45,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587605488] [2022-03-01 17:00:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:00:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:00:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:00:46,314 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:00:46,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:00:46,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587605488] [2022-03-01 17:00:46,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587605488] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:00:46,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312933295] [2022-03-01 17:00:46,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 17:00:46,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:00:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:00:46,316 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:00:46,317 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:00:46,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 17:00:46,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:00:46,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-01 17:00:46,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:00:47,319 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:00:47,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 17:00:48,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,029 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:00:48,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,333 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:00:48,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,487 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 17:00:48,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:48,720 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:00:48,970 INFO L353 Elim1Store]: treesize reduction 212, result has 14.2 percent of original size [2022-03-01 17:00:48,970 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 17:00:48,992 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:00:48,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:00:56,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:56,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:00:56,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:56,197 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 17:00:56,213 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 17:00:56,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:00:56,220 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 17:00:56,960 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:00:56,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312933295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:00:56,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:00:56,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 38 [2022-03-01 17:00:56,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308712541] [2022-03-01 17:00:56,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:00:56,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 17:00:56,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:00:56,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 17:00:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1314, Unknown=1, NotChecked=0, Total=1482 [2022-03-01 17:00:56,962 INFO L87 Difference]: Start difference. First operand 7232 states and 14532 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 17:01:17,009 WARN L228 SmtUtils]: Spent 18.68s on a formula simplification. DAG size of input: 112 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 17:01:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:28,823 INFO L93 Difference]: Finished difference Result 11322 states and 22613 transitions. [2022-03-01 17:01:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 17:01:28,824 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 17:01:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:28,838 INFO L225 Difference]: With dead ends: 11322 [2022-03-01 17:01:28,838 INFO L226 Difference]: Without dead ends: 11322 [2022-03-01 17:01:28,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=770, Invalid=4341, Unknown=1, NotChecked=0, Total=5112 [2022-03-01 17:01:28,839 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 1306 mSDsluCounter, 7660 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 8234 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2093 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:28,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1306 Valid, 8234 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2942 Invalid, 0 Unknown, 2093 Unchecked, 7.6s Time] [2022-03-01 17:01:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11322 states. [2022-03-01 17:01:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11322 to 7390. [2022-03-01 17:01:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 7377 states have (on average 2.0146400976006507) internal successors, (14862), 7389 states have internal predecessors, (14862), 0 states have call successors, (0), 0 states 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:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 14862 transitions. [2022-03-01 17:01:28,944 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 14862 transitions. Word has length 134 [2022-03-01 17:01:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:28,944 INFO L470 AbstractCegarLoop]: Abstraction has 7390 states and 14862 transitions. [2022-03-01 17:01:28,945 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 17:01:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 14862 transitions. [2022-03-01 17:01:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:01:28,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:28,947 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:28,970 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:01:29,147 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:01:29,148 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:01:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -760264705, now seen corresponding path program 23 times [2022-03-01 17:01:29,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:29,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168274261] [2022-03-01 17:01:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:30,168 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:01:30,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:30,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168274261] [2022-03-01 17:01:30,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168274261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:01:30,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299414077] [2022-03-01 17:01:30,168 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 17:01:30,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:01:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:01:30,169 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:01:30,170 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:01:30,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 17:01:30,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:01:30,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 17:01:30,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:01:33,047 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:01:33,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:33,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 17:01:34,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,070 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:01:34,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,295 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:01:34,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:34,610 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 17:01:34,782 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:01:34,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:01:38,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:38,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:39,554 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:39,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299414077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:01:39,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:01:39,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 17:01:39,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680354229] [2022-03-01 17:01:39,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:01:39,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 17:01:39,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 17:01:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 17:01:39,555 INFO L87 Difference]: Start difference. First operand 7390 states and 14862 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:01:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:49,548 INFO L93 Difference]: Finished difference Result 8349 states and 16693 transitions. [2022-03-01 17:01:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 17:01:49,549 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:01:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:49,559 INFO L225 Difference]: With dead ends: 8349 [2022-03-01 17:01:49,559 INFO L226 Difference]: Without dead ends: 8349 [2022-03-01 17:01:49,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=701, Invalid=3081, Unknown=0, NotChecked=0, Total=3782 [2022-03-01 17:01:49,560 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 1232 mSDsluCounter, 5667 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 6088 SdHoareTripleChecker+Invalid, 3450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1068 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:49,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 6088 Invalid, 3450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2274 Invalid, 0 Unknown, 1068 Unchecked, 5.6s Time] [2022-03-01 17:01:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8349 states. [2022-03-01 17:01:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8349 to 7390. [2022-03-01 17:01:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 7377 states have (on average 2.0146400976006507) internal successors, (14862), 7389 states have internal predecessors, (14862), 0 states have call successors, (0), 0 states 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:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 14862 transitions. [2022-03-01 17:01:49,645 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 14862 transitions. Word has length 134 [2022-03-01 17:01:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:49,645 INFO L470 AbstractCegarLoop]: Abstraction has 7390 states and 14862 transitions. [2022-03-01 17:01:49,646 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:01:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 14862 transitions. [2022-03-01 17:01:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:01:49,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:49,648 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:49,668 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:01:49,848 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:01:49,849 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:01:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1918444487, now seen corresponding path program 24 times [2022-03-01 17:01:49,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:49,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216850214] [2022-03-01 17:01:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:50,845 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:01:50,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:50,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216850214] [2022-03-01 17:01:50,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216850214] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:01:50,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659805873] [2022-03-01 17:01:50,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 17:01:50,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:01:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:01:50,847 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:01:50,847 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:01:51,211 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 17:01:51,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:01:51,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:01:51,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:01:52,018 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:01:52,367 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:01:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:52,998 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:01:53,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,154 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:01:53,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,338 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:01:53,574 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:01:53,574 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:01:53,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:53,929 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:01:54,058 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:01:54,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:01:56,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:56,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:01:57,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:57,769 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:01:58,390 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:01:58,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659805873] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:01:58,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:01:58,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:01:58,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153714455] [2022-03-01 17:01:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:58,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:01:58,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:01:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:01:58,391 INFO L87 Difference]: Start difference. First operand 7390 states and 14862 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:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:02,536 INFO L93 Difference]: Finished difference Result 9149 states and 18386 transitions. [2022-03-01 17:02:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 17:02:02,537 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:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:02,550 INFO L225 Difference]: With dead ends: 9149 [2022-03-01 17:02:02,551 INFO L226 Difference]: Without dead ends: 9149 [2022-03-01 17:02:02,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 17:02:02,551 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 207 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:02,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 1801 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 688 Unchecked, 0.7s Time] [2022-03-01 17:02:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2022-03-01 17:02:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 7396. [2022-03-01 17:02:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7396 states, 7383 states have (on average 2.0146281999187323) internal successors, (14874), 7395 states have internal predecessors, (14874), 0 states have call successors, (0), 0 states 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:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7396 states to 7396 states and 14874 transitions. [2022-03-01 17:02:02,642 INFO L78 Accepts]: Start accepts. Automaton has 7396 states and 14874 transitions. Word has length 134 [2022-03-01 17:02:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:02,642 INFO L470 AbstractCegarLoop]: Abstraction has 7396 states and 14874 transitions. [2022-03-01 17:02:02,642 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:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7396 states and 14874 transitions. [2022-03-01 17:02:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:02,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:02,644 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:02,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-03-01 17:02:02,845 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:02:02,845 INFO L402 AbstractCegarLoop]: === Iteration 77 === 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:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1711587689, now seen corresponding path program 25 times [2022-03-01 17:02:02,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:02,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871456201] [2022-03-01 17:02:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:03,856 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:03,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:03,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871456201] [2022-03-01 17:02:03,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871456201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:03,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522174087] [2022-03-01 17:02:03,857 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 17:02:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:03,858 INFO L229 MonitoredProcess]: Starting monitored process 73 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:03,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-01 17:02:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:04,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 17:02:04,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:05,757 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:06,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,395 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:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,542 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:06,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:06,758 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:07,129 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 17:02:07,129 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 17:02:07,260 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:07,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:10,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (and (forall ((v_ArrVal_8423 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8423 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_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_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_8423 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 (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_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_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8423 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-01 17:02:13,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (and (forall ((v_ArrVal_8423 Int)) (= |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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8423 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 (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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_8423 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 (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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8423 Int)) (= |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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))) is different from false [2022-03-01 17:02:16,661 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |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|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28)))) is different from false [2022-03-01 17:02:16,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:16,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:17,701 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:17,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522174087] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:02:17,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:02:17,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 17:02:17,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907647726] [2022-03-01 17:02:17,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:02:17,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 17:02:17,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:17,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 17:02:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1175, Unknown=3, NotChecked=216, Total=1560 [2022-03-01 17:02:17,703 INFO L87 Difference]: Start difference. First operand 7396 states and 14874 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:02:21,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* (- 1) |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (<= 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| .cse2) 28)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |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 (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 .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |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 (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|) .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|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| Int) (v_ArrVal_8423 Int)) (or (= |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|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| |c_~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28) 1) v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113|) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 1)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92_113| 28))) (= |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| .cse2) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 17:02:23,552 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 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| (* (- 1) |c_~#cache~0.offset|)) 28)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (and (forall ((v_ArrVal_8423 Int)) (= |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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8423 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 (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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_8423 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 (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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8423 Int)) (= |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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|))) (= |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 17:02:25,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (and (forall ((v_ArrVal_8423 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8423 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_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_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_8423 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 (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_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_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8423 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_8423))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (<= 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 (select |c_#race| |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 17:02:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:27,816 INFO L93 Difference]: Finished difference Result 11849 states and 23758 transitions. [2022-03-01 17:02:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 17:02:27,816 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:02:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:27,831 INFO L225 Difference]: With dead ends: 11849 [2022-03-01 17:02:27,831 INFO L226 Difference]: Without dead ends: 11849 [2022-03-01 17:02:27,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=242, Invalid=1668, Unknown=6, NotChecked=534, Total=2450 [2022-03-01 17:02:27,831 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 884 mSDsluCounter, 3426 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1808 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:27,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 3743 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1381 Invalid, 0 Unknown, 1808 Unchecked, 3.4s Time] [2022-03-01 17:02:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2022-03-01 17:02:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 7546. [2022-03-01 17:02:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7546 states, 7533 states have (on average 2.015398911456259) internal successors, (15182), 7545 states have internal predecessors, (15182), 0 states have call successors, (0), 0 states 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:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 15182 transitions. [2022-03-01 17:02:27,936 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 15182 transitions. Word has length 134 [2022-03-01 17:02:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:27,936 INFO L470 AbstractCegarLoop]: Abstraction has 7546 states and 15182 transitions. [2022-03-01 17:02:27,936 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:02:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 15182 transitions. [2022-03-01 17:02:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:27,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:27,939 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:27,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-03-01 17:02:28,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-01 17:02:28,139 INFO L402 AbstractCegarLoop]: === Iteration 78 === 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:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1865886265, now seen corresponding path program 26 times [2022-03-01 17:02:28,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:28,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113587398] [2022-03-01 17:02:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:28,945 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:28,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:28,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113587398] [2022-03-01 17:02:28,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113587398] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:28,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577240401] [2022-03-01 17:02:28,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 17:02:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:28,947 INFO L229 MonitoredProcess]: Starting monitored process 74 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:28,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-01 17:02:29,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 17:02:29,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:29,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:02:29,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:30,120 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:30,446 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:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,073 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,251 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:02:31,251 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:31,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-03-01 17:02:31,664 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-01 17:02:31,664 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 17:02:31,869 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 17:02:31,869 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 17:02:31,996 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:31,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:33,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:33,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:33,893 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:34,261 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:34,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577240401] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:34,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:02:34,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 36 [2022-03-01 17:02:34,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850434580] [2022-03-01 17:02:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:02:34,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:02:34,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:02:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 17:02:34,262 INFO L87 Difference]: Start difference. First operand 7546 states and 15182 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:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:36,782 INFO L93 Difference]: Finished difference Result 9449 states and 19007 transitions. [2022-03-01 17:02:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 17:02:36,782 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:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:36,794 INFO L225 Difference]: With dead ends: 9449 [2022-03-01 17:02:36,794 INFO L226 Difference]: Without dead ends: 9449 [2022-03-01 17:02:36,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 17:02:36,795 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 268 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:36,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1375 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 539 Unchecked, 0.7s Time] [2022-03-01 17:02:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9449 states. [2022-03-01 17:02:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9449 to 7554. [2022-03-01 17:02:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7541 states have (on average 2.015382575255271) internal successors, (15198), 7553 states have internal predecessors, (15198), 0 states have call successors, (0), 0 states 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:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 15198 transitions. [2022-03-01 17:02:36,888 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 15198 transitions. Word has length 134 [2022-03-01 17:02:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:36,888 INFO L470 AbstractCegarLoop]: Abstraction has 7554 states and 15198 transitions. [2022-03-01 17:02:36,889 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:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 15198 transitions. [2022-03-01 17:02:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:36,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:36,891 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:36,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-03-01 17:02:37,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:37,092 INFO L402 AbstractCegarLoop]: === Iteration 79 === 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:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash 379804765, now seen corresponding path program 27 times [2022-03-01 17:02:37,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:37,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016901438] [2022-03-01 17:02:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:38,055 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:38,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:38,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016901438] [2022-03-01 17:02:38,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016901438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:38,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059965804] [2022-03-01 17:02:38,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 17:02:38,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:38,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:38,056 INFO L229 MonitoredProcess]: Starting monitored process 75 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:38,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-01 17:02:38,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 17:02:38,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:38,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:02:38,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:39,230 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:39,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 17:02:40,248 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:02:40,248 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:40,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:40,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:40,765 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:41,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:41,093 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:41,229 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:41,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:44,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:44,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:45,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:45,287 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:45,882 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:45,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059965804] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:45,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:02:45,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:02:45,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723189582] [2022-03-01 17:02:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:02:45,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:02:45,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:02:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:02:45,883 INFO L87 Difference]: Start difference. First operand 7554 states and 15198 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:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:49,894 INFO L93 Difference]: Finished difference Result 9440 states and 18967 transitions. [2022-03-01 17:02:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 17:02:49,895 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:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:49,906 INFO L225 Difference]: With dead ends: 9440 [2022-03-01 17:02:49,906 INFO L226 Difference]: Without dead ends: 9440 [2022-03-01 17:02:49,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 17:02:49,907 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 205 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:49,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1638 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 540 Unchecked, 0.5s Time] [2022-03-01 17:02:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9440 states. [2022-03-01 17:02:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9440 to 7572. [2022-03-01 17:02:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7572 states, 7559 states have (on average 2.0153459452308504) internal successors, (15234), 7571 states have internal predecessors, (15234), 0 states have call successors, (0), 0 states 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:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 15234 transitions. [2022-03-01 17:02:49,999 INFO L78 Accepts]: Start accepts. Automaton has 7572 states and 15234 transitions. Word has length 134 [2022-03-01 17:02:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:49,999 INFO L470 AbstractCegarLoop]: Abstraction has 7572 states and 15234 transitions. [2022-03-01 17:02:49,999 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:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 15234 transitions. [2022-03-01 17:02:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:50,001 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:50,001 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:50,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-03-01 17:02:50,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:50,215 INFO L402 AbstractCegarLoop]: === Iteration 80 === 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:50,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash 402897595, now seen corresponding path program 28 times [2022-03-01 17:02:50,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:50,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612880082] [2022-03-01 17:02:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:51,215 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:51,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:51,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612880082] [2022-03-01 17:02:51,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612880082] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:51,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787554652] [2022-03-01 17:02:51,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 17:02:51,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:51,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:51,217 INFO L229 MonitoredProcess]: Starting monitored process 76 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:51,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-01 17:02:51,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 17:02:51,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:51,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-01 17:02:51,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:52,287 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:52,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,621 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:52,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,737 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:52,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:52,935 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:53,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:53,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 17:02:53,091 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:53,114 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:53,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:56,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| Int)) (or (and (forall ((v_ArrVal_8883 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_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_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_8883 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 (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|) .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_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-01 17:02:58,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98|) (and (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (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_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 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|) .cse5 |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|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_8883 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#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|) (+ |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 .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_8883))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false Received shutdown request... [2022-03-01 17:03:08,042 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:03:08,052 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:08,588 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-01 17:03:08,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-01 17:03:08,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-03-01 17:03:08,788 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-01 17:03:08,790 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-01 17:03:08,792 INFO L732 BasicCegarLoop]: Path program histogram: [39, 28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:03:08,795 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 17:03:08,795 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:03:08,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:03:08 BasicIcfg [2022-03-01 17:03:08,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:03:08,796 INFO L158 Benchmark]: Toolchain (without parser) took 839486.72ms. Allocated memory was 209.7MB in the beginning and 569.4MB in the end (delta: 359.7MB). Free memory was 158.2MB in the beginning and 405.3MB in the end (delta: -247.1MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 209.7MB. Free memory was 176.4MB in the beginning and 176.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.72ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 169.4MB in the end (delta: -11.4MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.85ms. Allocated memory is still 209.7MB. Free memory was 169.4MB in the beginning and 166.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: Boogie Preprocessor took 30.27ms. Allocated memory is still 209.7MB. Free memory was 166.8MB in the beginning and 164.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: RCFGBuilder took 377.24ms. Allocated memory is still 209.7MB. Free memory was 164.7MB in the beginning and 148.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,796 INFO L158 Benchmark]: TraceAbstraction took 838604.97ms. Allocated memory was 209.7MB in the beginning and 569.4MB in the end (delta: 359.7MB). Free memory was 147.9MB in the beginning and 405.3MB in the end (delta: -257.4MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. [2022-03-01 17:03:08,797 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.35ms. Allocated memory is still 209.7MB. Free memory was 176.4MB in the beginning and 176.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.72ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 169.4MB in the end (delta: -11.4MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.85ms. Allocated memory is still 209.7MB. Free memory was 169.4MB in the beginning and 166.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.27ms. Allocated memory is still 209.7MB. Free memory was 166.8MB in the beginning and 164.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 377.24ms. Allocated memory is still 209.7MB. Free memory was 164.7MB in the beginning and 148.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 838604.97ms. Allocated memory was 209.7MB in the beginning and 569.4MB in the end (delta: 359.7MB). Free memory was 147.9MB in the beginning and 405.3MB in the end (delta: -257.4MB). Peak memory consumption was 103.3MB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 161 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 838.5s, OverallIterations: 80, TraceHistogramMax: 10, PathProgramHistogramMax: 39, EmptinessCheckTime: 0.2s, AutomataDifference: 228.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70270 SdHoareTripleChecker+Valid, 89.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70270 mSDsluCounter, 181029 SdHoareTripleChecker+Invalid, 80.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31640 IncrementalHoareTripleChecker+Unchecked, 155966 mSDsCounter, 2309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74841 IncrementalHoareTripleChecker+Invalid, 108790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2309 mSolverCounterUnsat, 25341 mSDtfsCounter, 74841 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14399 GetRequests, 11442 SyntacticMatches, 17 SemanticMatches, 2940 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 32334 ImplicationChecksByTransitivity, 580.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7572occurred in iteration=79, InterpolantAutomatonStates: 1622, 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, 79 MinimizatonAttempts, 379779 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 551.3s InterpolantComputationTime, 16866 NumberOfCodeBlocks, 14682 NumberOfCodeBlocksAsserted, 263 NumberOfCheckSat, 20578 ConstructedInterpolants, 348 QuantifiedInterpolants, 176622 SizeOfPredicates, 885 NumberOfNonLiveVariables, 16341 ConjunctsInSsa, 2353 ConjunctsInUnsatCore, 184 InterpolantComputations, 62 PerfectInterpolantSequences, 38877/41617 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