/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/09-regions_16-arrayloop_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 18:25:04,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:25:04,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:25:04,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:25:04,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:25:04,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:25:04,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:25:04,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:25:04,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:25:04,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:25:04,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:25:04,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:25:04,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:25:04,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:25:04,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:25:04,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:25:04,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:25:04,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:25:04,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:25:04,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:25:04,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:25:04,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:25:04,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:25:04,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:25:04,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:25:04,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:25:04,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:25:04,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:25:04,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:25:04,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:25:04,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:25:04,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:25:04,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:25:04,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:25:04,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:25:04,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:25:04,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:25:04,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:25:04,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:25:04,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:25:04,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:25:04,638 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-03 18:25:04,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:25:04,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:25:04,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:25:04,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:25:04,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:25:04,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:25:04,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:25:04,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:25:04,670 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:25:04,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:25:04,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:25:04,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:25:04,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:25:04,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:25:04,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:25:04,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:25:04,673 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-03 18:25:04,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:25:04,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:25:04,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:25:04,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:25:04,914 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:25:04,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-03 18:25:04,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42642ec16/cf365bae52314b3287f77d10b96ac183/FLAGce1504bdb [2022-03-03 18:25:05,497 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:25:05,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-03 18:25:05,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42642ec16/cf365bae52314b3287f77d10b96ac183/FLAGce1504bdb [2022-03-03 18:25:05,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42642ec16/cf365bae52314b3287f77d10b96ac183 [2022-03-03 18:25:05,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:25:05,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:25:05,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:25:05,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:25:05,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:25:05,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:05" (1/1) ... [2022-03-03 18:25:05,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d03b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:05, skipping insertion in model container [2022-03-03 18:25:05,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:05" (1/1) ... [2022-03-03 18:25:05,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:25:05,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:25:06,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:25:06,272 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:25:06,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:25:06,408 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:25:06,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06 WrapperNode [2022-03-03 18:25:06,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:25:06,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:25:06,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:25:06,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:25:06,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,499 INFO L137 Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2022-03-03 18:25:06,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:25:06,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:25:06,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:25:06,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:25:06,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:25:06,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:25:06,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:25:06,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:25:06,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (1/1) ... [2022-03-03 18:25:06,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:25:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:06,598 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-03 18:25:06,599 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-03 18:25:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 18:25:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:25:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-03 18:25:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:25:06,626 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:25:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 18:25:06,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:25:06,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:25:06,627 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:25:06,799 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:25:06,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:25:07,309 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:25:07,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:25:07,320 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 18:25:07,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:25:07 BoogieIcfgContainer [2022-03-03 18:25:07,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:25:07,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:25:07,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:25:07,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:25:07,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:25:05" (1/3) ... [2022-03-03 18:25:07,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2838d79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:07, skipping insertion in model container [2022-03-03 18:25:07,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:06" (2/3) ... [2022-03-03 18:25:07,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2838d79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:07, skipping insertion in model container [2022-03-03 18:25:07,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:25:07" (3/3) ... [2022-03-03 18:25:07,333 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2022-03-03 18:25:07,337 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:25:07,338 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:25:07,338 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-03 18:25:07,338 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:25:07,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,452 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,453 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,454 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,455 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,456 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,459 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,466 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,467 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,468 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:07,471 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:25:07,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:25:07,512 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-03 18:25:07,512 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-03 18:25:07,522 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow [2022-03-03 18:25:07,743 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:25:07,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:07,783 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-03 18:25:07,784 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times [2022-03-03 18:25:07,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:07,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775589810] [2022-03-03 18:25:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:08,208 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-03 18:25:08,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:08,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775589810] [2022-03-03 18:25:08,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775589810] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:08,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:08,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:08,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524701259] [2022-03-03 18:25:08,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:08,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:08,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:08,273 INFO L87 Difference]: Start difference. First operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 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 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-03 18:25:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:09,043 INFO L93 Difference]: Finished difference Result 10027 states and 19985 transitions. [2022-03-03 18:25:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:09,045 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 40 [2022-03-03 18:25:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:09,095 INFO L225 Difference]: With dead ends: 10027 [2022-03-03 18:25:09,095 INFO L226 Difference]: Without dead ends: 10027 [2022-03-03 18:25:09,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:09,099 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 246 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:09,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 890 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:25:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-03-03 18:25:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946. [2022-03-03 18:25:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9946 states, 9875 states have (on average 2.007392405063291) internal successors, (19823), 9945 states have internal predecessors, (19823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions. [2022-03-03 18:25:09,436 INFO L78 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40 [2022-03-03 18:25:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:09,437 INFO L470 AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions. [2022-03-03 18:25:09,437 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-03 18:25:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions. [2022-03-03 18:25:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-03 18:25:09,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:09,445 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:09,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:25:09,447 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times [2022-03-03 18:25:09,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:09,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372319440] [2022-03-03 18:25:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:09,645 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-03 18:25:09,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:09,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372319440] [2022-03-03 18:25:09,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372319440] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:09,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:09,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:09,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963748085] [2022-03-03 18:25:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:09,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:09,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:09,648 INFO L87 Difference]: Start difference. First operand 9946 states and 19823 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-03 18:25:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:10,265 INFO L93 Difference]: Finished difference Result 10347 states and 20626 transitions. [2022-03-03 18:25:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:10,266 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 48 [2022-03-03 18:25:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:10,312 INFO L225 Difference]: With dead ends: 10347 [2022-03-03 18:25:10,312 INFO L226 Difference]: Without dead ends: 10347 [2022-03-03 18:25:10,313 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-03 18:25:10,314 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:10,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 937 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:25:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-03 18:25:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266. [2022-03-03 18:25:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10266 states, 10196 states have (on average 2.0070615927814828) internal successors, (20464), 10265 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions. [2022-03-03 18:25:10,596 INFO L78 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48 [2022-03-03 18:25:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:10,597 INFO L470 AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions. [2022-03-03 18:25:10,597 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-03 18:25:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions. [2022-03-03 18:25:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-03 18:25:10,599 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:10,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:10,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:25:10,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times [2022-03-03 18:25:10,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:10,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312285073] [2022-03-03 18:25:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:10,674 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-03 18:25:10,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:10,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312285073] [2022-03-03 18:25:10,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312285073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:10,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:10,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:25:10,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271182374] [2022-03-03 18:25:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:10,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:25:10,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:25:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:25:10,676 INFO L87 Difference]: Start difference. First operand 10266 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:10,811 INFO L93 Difference]: Finished difference Result 19601 states and 39093 transitions. [2022-03-03 18:25:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:25:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-03 18:25:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:10,933 INFO L225 Difference]: With dead ends: 19601 [2022-03-03 18:25:10,933 INFO L226 Difference]: Without dead ends: 19601 [2022-03-03 18:25:10,934 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-03 18:25:10,936 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:10,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 550 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2022-03-03 18:25:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348. [2022-03-03 18:25:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10278 states have (on average 2.0070052539404553) internal successors, (20628), 10347 states have internal predecessors, (20628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions. [2022-03-03 18:25:11,244 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49 [2022-03-03 18:25:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:11,244 INFO L470 AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions. [2022-03-03 18:25:11,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions. [2022-03-03 18:25:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-03 18:25:11,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:11,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:11,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 18:25:11,245 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times [2022-03-03 18:25:11,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:11,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663530469] [2022-03-03 18:25:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:11,380 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-03 18:25:11,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:11,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663530469] [2022-03-03 18:25:11,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663530469] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:11,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:11,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:11,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444911454] [2022-03-03 18:25:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:11,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:11,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:11,386 INFO L87 Difference]: Start difference. First operand 10348 states and 20628 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:11,544 INFO L93 Difference]: Finished difference Result 10347 states and 20627 transitions. [2022-03-03 18:25:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-03-03 18:25:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:11,570 INFO L225 Difference]: With dead ends: 10347 [2022-03-03 18:25:11,571 INFO L226 Difference]: Without dead ends: 10347 [2022-03-03 18:25:11,572 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-03 18:25:11,574 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:11,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 397 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-03 18:25:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347. [2022-03-03 18:25:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10347 states, 10278 states have (on average 2.006907958746838) internal successors, (20627), 10346 states have internal predecessors, (20627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions. [2022-03-03 18:25:11,853 INFO L78 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59 [2022-03-03 18:25:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:11,853 INFO L470 AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions. [2022-03-03 18:25:11,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions. [2022-03-03 18:25:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-03 18:25:11,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:11,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:25:11,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 18:25:11,855 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times [2022-03-03 18:25:11,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:11,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881375953] [2022-03-03 18:25:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:11,955 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-03 18:25:11,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:11,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881375953] [2022-03-03 18:25:11,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881375953] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:11,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593316360] [2022-03-03 18:25:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:11,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:11,959 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-03 18:25:11,987 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-03 18:25:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:12,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:25:12,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:12,335 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-03 18:25:12,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:12,575 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-03 18:25:12,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593316360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:12,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:12,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:25:12,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318369428] [2022-03-03 18:25:12,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:12,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:25:12,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:25:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:25:12,578 INFO L87 Difference]: Start difference. First operand 10347 states and 20627 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:12,798 INFO L93 Difference]: Finished difference Result 19642 states and 39134 transitions. [2022-03-03 18:25:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:25:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-03-03 18:25:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:12,900 INFO L225 Difference]: With dead ends: 19642 [2022-03-03 18:25:12,900 INFO L226 Difference]: Without dead ends: 19642 [2022-03-03 18:25:12,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-03 18:25:12,901 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 489 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:12,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1608 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2022-03-03 18:25:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429. [2022-03-03 18:25:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10429 states, 10360 states have (on average 1.9989382239382238) internal successors, (20709), 10428 states have internal predecessors, (20709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions. [2022-03-03 18:25:13,170 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90 [2022-03-03 18:25:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:13,171 INFO L470 AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions. [2022-03-03 18:25:13,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions. [2022-03-03 18:25:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-03 18:25:13,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:13,177 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:13,210 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-03 18:25:13,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:13,388 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times [2022-03-03 18:25:13,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:13,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006431857] [2022-03-03 18:25:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:13,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:13,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006431857] [2022-03-03 18:25:13,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006431857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:13,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092153574] [2022-03-03 18:25:13,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:25:13,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:13,614 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-03 18:25:13,627 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-03 18:25:13,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:25:13,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:13,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-03 18:25:13,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:14,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-03 18:25:14,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,049 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-03 18:25:14,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,081 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:25:14,081 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-03 18:25:14,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:14,116 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:25:14,117 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-03 18:25:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-03-03 18:25:14,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:25:14,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092153574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:14,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:25:14,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-03 18:25:14,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871611111] [2022-03-03 18:25:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:14,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 18:25:14,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 18:25:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:25:14,144 INFO L87 Difference]: Start difference. First operand 10429 states and 20709 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:15,053 INFO L93 Difference]: Finished difference Result 12090 states and 24032 transitions. [2022-03-03 18:25:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:25:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-03-03 18:25:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:15,080 INFO L225 Difference]: With dead ends: 12090 [2022-03-03 18:25:15,080 INFO L226 Difference]: Without dead ends: 12090 [2022-03-03 18:25:15,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:25:15,081 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:15,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2448 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:25:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2022-03-03 18:25:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867. [2022-03-03 18:25:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10867 states, 10798 states have (on average 1.9989812928320059) internal successors, (21585), 10866 states have internal predecessors, (21585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions. [2022-03-03 18:25:15,327 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172 [2022-03-03 18:25:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:15,329 INFO L470 AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions. [2022-03-03 18:25:15,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions. [2022-03-03 18:25:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-03 18:25:15,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:15,332 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:15,355 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-03 18:25:15,547 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,SelfDestructingSolverStorable5 [2022-03-03 18:25:15,547 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times [2022-03-03 18:25:15,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:15,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848150671] [2022-03-03 18:25:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:15,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:15,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848150671] [2022-03-03 18:25:15,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848150671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:15,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460586240] [2022-03-03 18:25:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:15,784 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-03 18:25:15,792 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-03 18:25:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:16,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 18:25:16,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:16,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:16,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460586240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:16,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:16,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 18:25:16,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556063740] [2022-03-03 18:25:16,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:16,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 18:25:16,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 18:25:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:25:16,764 INFO L87 Difference]: Start difference. First operand 10867 states and 21585 transitions. Second operand has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:17,155 INFO L93 Difference]: Finished difference Result 20585 states and 40856 transitions. [2022-03-03 18:25:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:25:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2022-03-03 18:25:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:17,197 INFO L225 Difference]: With dead ends: 20585 [2022-03-03 18:25:17,198 INFO L226 Difference]: Without dead ends: 20585 [2022-03-03 18:25:17,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-03 18:25:17,199 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 805 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:17,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2497 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:25:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2022-03-03 18:25:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031. [2022-03-03 18:25:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11031 states, 10962 states have (on average 1.9840357598978289) internal successors, (21749), 11030 states have internal predecessors, (21749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions. [2022-03-03 18:25:17,483 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180 [2022-03-03 18:25:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:17,483 INFO L470 AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions. [2022-03-03 18:25:17,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions. [2022-03-03 18:25:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-03-03 18:25:17,489 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:17,489 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:17,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-03 18:25:17,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:17,713 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times [2022-03-03 18:25:17,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:17,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151471346] [2022-03-03 18:25:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:18,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:18,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151471346] [2022-03-03 18:25:18,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151471346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:18,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061624594] [2022-03-03 18:25:18,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:25:18,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:18,097 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-03 18:25:18,129 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-03 18:25:18,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:25:18,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:18,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 18:25:18,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:18,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:25:18,875 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 18:25:18,876 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 23 treesize of output 22 [2022-03-03 18:25:18,918 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-03 18:25:18,918 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 32 treesize of output 34 [2022-03-03 18:25:18,975 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-03 18:25:18,975 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 41 treesize of output 46 [2022-03-03 18:25:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-03-03 18:25:19,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:25:19,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061624594] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:19,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:25:19,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-03 18:25:19,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881545953] [2022-03-03 18:25:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:19,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:19,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:19,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:19,007 INFO L87 Difference]: Start difference. First operand 11031 states and 21749 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:19,670 INFO L93 Difference]: Finished difference Result 11586 states and 22859 transitions. [2022-03-03 18:25:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:19,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-03-03 18:25:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:19,692 INFO L225 Difference]: With dead ends: 11586 [2022-03-03 18:25:19,692 INFO L226 Difference]: Without dead ends: 11586 [2022-03-03 18:25:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:19,693 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:19,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1050 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:25:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-03-03 18:25:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469. [2022-03-03 18:25:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11469 states, 11400 states have (on average 1.9846491228070176) internal successors, (22625), 11468 states have internal predecessors, (22625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions. [2022-03-03 18:25:19,977 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344 [2022-03-03 18:25:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:19,978 INFO L470 AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions. [2022-03-03 18:25:19,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions. [2022-03-03 18:25:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-03-03 18:25:19,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:19,983 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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-03 18:25:20,009 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-03 18:25:20,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:20,207 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times [2022-03-03 18:25:20,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:20,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175494116] [2022-03-03 18:25:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:20,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:20,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175494116] [2022-03-03 18:25:20,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175494116] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:20,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088300004] [2022-03-03 18:25:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:20,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:20,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:20,584 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-03 18:25:20,585 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-03 18:25:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:20,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 18:25:20,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:21,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:22,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088300004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:22,432 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:22,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-03 18:25:22,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996107251] [2022-03-03 18:25:22,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:22,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-03 18:25:22,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-03 18:25:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:25:22,434 INFO L87 Difference]: Start difference. First operand 11469 states and 22625 transitions. Second operand has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:23,043 INFO L93 Difference]: Finished difference Result 21487 states and 42537 transitions. [2022-03-03 18:25:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:25:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2022-03-03 18:25:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:23,079 INFO L225 Difference]: With dead ends: 21487 [2022-03-03 18:25:23,079 INFO L226 Difference]: Without dead ends: 21487 [2022-03-03 18:25:23,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:25:23,082 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1141 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:23,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 3468 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:25:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2022-03-03 18:25:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592. [2022-03-03 18:25:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11592 states, 11523 states have (on average 1.9741386791634123) internal successors, (22748), 11591 states have internal predecessors, (22748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions. [2022-03-03 18:25:23,324 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353 [2022-03-03 18:25:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:23,324 INFO L470 AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions. [2022-03-03 18:25:23,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions. [2022-03-03 18:25:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:23,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:23,333 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:23,362 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-03 18:25:23,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:23,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times [2022-03-03 18:25:23,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:23,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927890410] [2022-03-03 18:25:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:23,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:23,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927890410] [2022-03-03 18:25:23,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927890410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:23,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:23,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:23,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463341229] [2022-03-03 18:25:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:23,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:23,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:23,977 INFO L87 Difference]: Start difference. First operand 11592 states and 22748 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:25,294 INFO L93 Difference]: Finished difference Result 11725 states and 23014 transitions. [2022-03-03 18:25:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:25:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:25,316 INFO L225 Difference]: With dead ends: 11725 [2022-03-03 18:25:25,316 INFO L226 Difference]: Without dead ends: 11725 [2022-03-03 18:25:25,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:25:25,317 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:25,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:25:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2022-03-03 18:25:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609. [2022-03-03 18:25:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11540 states have (on average 1.9741767764298093) internal successors, (22782), 11608 states have internal predecessors, (22782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions. [2022-03-03 18:25:25,589 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476 [2022-03-03 18:25:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:25,590 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions. [2022-03-03 18:25:25,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions. [2022-03-03 18:25:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:25,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:25,601 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:25,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 18:25:25,601 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times [2022-03-03 18:25:25,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:25,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752868810] [2022-03-03 18:25:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:26,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:26,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752868810] [2022-03-03 18:25:26,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752868810] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:26,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:26,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:26,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055757484] [2022-03-03 18:25:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:26,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:26,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:26,052 INFO L87 Difference]: Start difference. First operand 11609 states and 22782 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:27,381 INFO L93 Difference]: Finished difference Result 11752 states and 23068 transitions. [2022-03-03 18:25:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:25:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:27,397 INFO L225 Difference]: With dead ends: 11752 [2022-03-03 18:25:27,398 INFO L226 Difference]: Without dead ends: 11752 [2022-03-03 18:25:27,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:25:27,399 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:27,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 2927 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:25:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2022-03-03 18:25:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610. [2022-03-03 18:25:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11610 states, 11541 states have (on average 1.9741790139502642) internal successors, (22784), 11609 states have internal predecessors, (22784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions. [2022-03-03 18:25:27,622 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476 [2022-03-03 18:25:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:27,622 INFO L470 AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions. [2022-03-03 18:25:27,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions. [2022-03-03 18:25:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:27,628 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:27,628 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:27,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 18:25:27,629 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times [2022-03-03 18:25:27,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:27,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472802127] [2022-03-03 18:25:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:28,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:28,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472802127] [2022-03-03 18:25:28,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472802127] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:28,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:28,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:28,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787757840] [2022-03-03 18:25:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:28,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:28,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:28,066 INFO L87 Difference]: Start difference. First operand 11610 states and 22784 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:29,580 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-03 18:25:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:25:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:29,603 INFO L225 Difference]: With dead ends: 11790 [2022-03-03 18:25:29,603 INFO L226 Difference]: Without dead ends: 11790 [2022-03-03 18:25:29,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:25:29,605 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 590 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:29,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 3473 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:25:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-03 18:25:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633. [2022-03-03 18:25:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 11564 states have (on average 1.9743168453822206) internal successors, (22831), 11632 states have internal predecessors, (22831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions. [2022-03-03 18:25:29,791 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476 [2022-03-03 18:25:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:29,792 INFO L470 AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions. [2022-03-03 18:25:29,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions. [2022-03-03 18:25:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:29,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:29,796 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:29,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 18:25:29,797 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times [2022-03-03 18:25:29,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:29,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512029757] [2022-03-03 18:25:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:30,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:30,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512029757] [2022-03-03 18:25:30,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512029757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:30,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:30,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:30,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228645624] [2022-03-03 18:25:30,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:30,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:30,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:30,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:30,261 INFO L87 Difference]: Start difference. First operand 11633 states and 22831 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:31,315 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-03 18:25:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:25:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:31,344 INFO L225 Difference]: With dead ends: 11790 [2022-03-03 18:25:31,345 INFO L226 Difference]: Without dead ends: 11790 [2022-03-03 18:25:31,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:25:31,345 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:31,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2610 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:25:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-03 18:25:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635. [2022-03-03 18:25:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 11566 states have (on average 1.974321286529483) internal successors, (22835), 11634 states have internal predecessors, (22835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions. [2022-03-03 18:25:31,507 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476 [2022-03-03 18:25:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:31,507 INFO L470 AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions. [2022-03-03 18:25:31,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions. [2022-03-03 18:25:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:31,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:31,511 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:31,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 18:25:31,511 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times [2022-03-03 18:25:31,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:31,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989391249] [2022-03-03 18:25:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:31,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:31,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989391249] [2022-03-03 18:25:31,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989391249] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:31,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:31,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:31,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316470162] [2022-03-03 18:25:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:31,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:31,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:31,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:31,857 INFO L87 Difference]: Start difference. First operand 11635 states and 22835 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:33,144 INFO L93 Difference]: Finished difference Result 11854 states and 23272 transitions. [2022-03-03 18:25:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:25:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:33,161 INFO L225 Difference]: With dead ends: 11854 [2022-03-03 18:25:33,161 INFO L226 Difference]: Without dead ends: 11854 [2022-03-03 18:25:33,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:25:33,162 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 523 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:33,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 3135 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:25:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2022-03-03 18:25:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634. [2022-03-03 18:25:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11565 states have (on average 1.97431906614786) internal successors, (22833), 11633 states have internal predecessors, (22833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions. [2022-03-03 18:25:33,321 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476 [2022-03-03 18:25:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:33,321 INFO L470 AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions. [2022-03-03 18:25:33,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions. [2022-03-03 18:25:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:33,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:33,326 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:33,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 18:25:33,326 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times [2022-03-03 18:25:33,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:33,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782782581] [2022-03-03 18:25:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:33,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:33,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782782581] [2022-03-03 18:25:33,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782782581] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:33,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:33,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:33,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262824169] [2022-03-03 18:25:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:33,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:33,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:33,665 INFO L87 Difference]: Start difference. First operand 11634 states and 22833 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:34,744 INFO L93 Difference]: Finished difference Result 11855 states and 23274 transitions. [2022-03-03 18:25:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:25:34,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:34,760 INFO L225 Difference]: With dead ends: 11855 [2022-03-03 18:25:34,760 INFO L226 Difference]: Without dead ends: 11855 [2022-03-03 18:25:34,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:34,761 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 548 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:34,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2649 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:25:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2022-03-03 18:25:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657. [2022-03-03 18:25:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11657 states, 11588 states have (on average 1.9744563341387642) internal successors, (22880), 11656 states have internal predecessors, (22880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions. [2022-03-03 18:25:34,963 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476 [2022-03-03 18:25:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:34,963 INFO L470 AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions. [2022-03-03 18:25:34,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions. [2022-03-03 18:25:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:34,967 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:34,968 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:34,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 18:25:34,968 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times [2022-03-03 18:25:34,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:34,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032766780] [2022-03-03 18:25:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:35,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:35,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032766780] [2022-03-03 18:25:35,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032766780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:35,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:35,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:25:35,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373538678] [2022-03-03 18:25:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:35,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:25:35,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:25:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:25:35,343 INFO L87 Difference]: Start difference. First operand 11657 states and 22880 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:36,497 INFO L93 Difference]: Finished difference Result 11923 states and 23410 transitions. [2022-03-03 18:25:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:25:36,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:36,512 INFO L225 Difference]: With dead ends: 11923 [2022-03-03 18:25:36,513 INFO L226 Difference]: Without dead ends: 11923 [2022-03-03 18:25:36,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-03-03 18:25:36,514 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 950 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:36,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 2658 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:25:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-03-03 18:25:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681. [2022-03-03 18:25:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11681 states, 11612 states have (on average 1.9745952462969343) internal successors, (22929), 11680 states have internal predecessors, (22929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions. [2022-03-03 18:25:36,660 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476 [2022-03-03 18:25:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:36,661 INFO L470 AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions. [2022-03-03 18:25:36,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions. [2022-03-03 18:25:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:36,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:36,665 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:36,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-03 18:25:36,665 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times [2022-03-03 18:25:36,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:36,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685190575] [2022-03-03 18:25:36,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:37,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:37,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685190575] [2022-03-03 18:25:37,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685190575] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:37,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:37,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:25:37,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814304703] [2022-03-03 18:25:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:37,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:25:37,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:25:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:25:37,077 INFO L87 Difference]: Start difference. First operand 11681 states and 22929 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:38,341 INFO L93 Difference]: Finished difference Result 12163 states and 23890 transitions. [2022-03-03 18:25:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:25:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:38,362 INFO L225 Difference]: With dead ends: 12163 [2022-03-03 18:25:38,362 INFO L226 Difference]: Without dead ends: 12163 [2022-03-03 18:25:38,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:25:38,363 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1055 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:38,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3332 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:25:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2022-03-03 18:25:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685. [2022-03-03 18:25:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11685 states, 11616 states have (on average 1.9746039944903582) internal successors, (22937), 11684 states have internal predecessors, (22937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions. [2022-03-03 18:25:38,509 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476 [2022-03-03 18:25:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:38,509 INFO L470 AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions. [2022-03-03 18:25:38,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions. [2022-03-03 18:25:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:38,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:38,513 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:38,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-03 18:25:38,514 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times [2022-03-03 18:25:38,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:38,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471151225] [2022-03-03 18:25:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:38,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:38,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471151225] [2022-03-03 18:25:38,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471151225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:38,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:38,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:25:38,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335339314] [2022-03-03 18:25:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:38,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:25:38,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:25:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:25:38,923 INFO L87 Difference]: Start difference. First operand 11685 states and 22937 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:40,378 INFO L93 Difference]: Finished difference Result 21888 states and 43344 transitions. [2022-03-03 18:25:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:25:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:40,410 INFO L225 Difference]: With dead ends: 21888 [2022-03-03 18:25:40,410 INFO L226 Difference]: Without dead ends: 21888 [2022-03-03 18:25:40,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:25:40,411 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1716 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:40,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1716 Valid, 4143 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:25:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-03-03 18:25:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752. [2022-03-03 18:25:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11683 states have (on average 1.974835230677052) internal successors, (23072), 11751 states have internal predecessors, (23072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions. [2022-03-03 18:25:40,613 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476 [2022-03-03 18:25:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:40,614 INFO L470 AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions. [2022-03-03 18:25:40,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions. [2022-03-03 18:25:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:40,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:40,617 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:40,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-03 18:25:40,617 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times [2022-03-03 18:25:40,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:40,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028999092] [2022-03-03 18:25:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:40,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:40,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028999092] [2022-03-03 18:25:40,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028999092] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:40,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:40,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:40,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798663340] [2022-03-03 18:25:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:40,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:40,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:40,911 INFO L87 Difference]: Start difference. First operand 11752 states and 23072 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:42,709 INFO L93 Difference]: Finished difference Result 21740 states and 43045 transitions. [2022-03-03 18:25:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 18:25:42,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:42,742 INFO L225 Difference]: With dead ends: 21740 [2022-03-03 18:25:42,743 INFO L226 Difference]: Without dead ends: 21740 [2022-03-03 18:25:42,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:25:42,744 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:42,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 4516 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:25:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2022-03-03 18:25:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831. [2022-03-03 18:25:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11831 states, 11762 states have (on average 1.9750042509777248) internal successors, (23230), 11830 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions. [2022-03-03 18:25:42,938 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476 [2022-03-03 18:25:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:42,938 INFO L470 AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions. [2022-03-03 18:25:42,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions. [2022-03-03 18:25:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:42,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:42,942 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:42,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-03 18:25:42,943 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times [2022-03-03 18:25:42,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:42,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865744573] [2022-03-03 18:25:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:43,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:43,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865744573] [2022-03-03 18:25:43,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865744573] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:43,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:43,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:43,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158930336] [2022-03-03 18:25:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:43,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:43,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:43,331 INFO L87 Difference]: Start difference. First operand 11831 states and 23230 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:44,015 INFO L93 Difference]: Finished difference Result 12198 states and 23964 transitions. [2022-03-03 18:25:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:25:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:44,032 INFO L225 Difference]: With dead ends: 12198 [2022-03-03 18:25:44,032 INFO L226 Difference]: Without dead ends: 12198 [2022-03-03 18:25:44,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:44,032 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:44,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2224 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:25:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-03-03 18:25:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856. [2022-03-03 18:25:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11787 states have (on average 1.9750572664800203) internal successors, (23280), 11855 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions. [2022-03-03 18:25:44,177 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476 [2022-03-03 18:25:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:44,178 INFO L470 AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions. [2022-03-03 18:25:44,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions. [2022-03-03 18:25:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:44,181 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:44,181 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:44,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-03 18:25:44,182 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times [2022-03-03 18:25:44,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:44,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637071009] [2022-03-03 18:25:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:44,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:44,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637071009] [2022-03-03 18:25:44,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637071009] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:44,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:44,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:44,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982514659] [2022-03-03 18:25:44,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:44,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:44,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:44,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:44,521 INFO L87 Difference]: Start difference. First operand 11856 states and 23280 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:45,353 INFO L93 Difference]: Finished difference Result 12278 states and 24124 transitions. [2022-03-03 18:25:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:25:45,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:45,369 INFO L225 Difference]: With dead ends: 12278 [2022-03-03 18:25:45,369 INFO L226 Difference]: Without dead ends: 12278 [2022-03-03 18:25:45,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:45,370 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 358 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:45,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 2542 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:25:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2022-03-03 18:25:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864. [2022-03-03 18:25:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11864 states, 11795 states have (on average 1.975074183976261) internal successors, (23296), 11863 states have internal predecessors, (23296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions. [2022-03-03 18:25:45,513 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476 [2022-03-03 18:25:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:45,514 INFO L470 AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions. [2022-03-03 18:25:45,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions. [2022-03-03 18:25:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:45,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:45,518 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:45,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-03 18:25:45,518 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times [2022-03-03 18:25:45,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:45,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116318690] [2022-03-03 18:25:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:45,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:45,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116318690] [2022-03-03 18:25:45,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116318690] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:45,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:45,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:45,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794689000] [2022-03-03 18:25:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:45,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:45,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:45,842 INFO L87 Difference]: Start difference. First operand 11864 states and 23296 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:46,713 INFO L93 Difference]: Finished difference Result 12342 states and 24252 transitions. [2022-03-03 18:25:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:25:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:46,735 INFO L225 Difference]: With dead ends: 12342 [2022-03-03 18:25:46,735 INFO L226 Difference]: Without dead ends: 12342 [2022-03-03 18:25:46,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:46,737 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 372 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:46,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 2554 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:25:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-03-03 18:25:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872. [2022-03-03 18:25:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11872 states, 11803 states have (on average 1.9750910785393545) internal successors, (23312), 11871 states have internal predecessors, (23312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions. [2022-03-03 18:25:46,985 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476 [2022-03-03 18:25:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:46,985 INFO L470 AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions. [2022-03-03 18:25:46,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions. [2022-03-03 18:25:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:46,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:46,988 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:46,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-03 18:25:46,989 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times [2022-03-03 18:25:46,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:46,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675967791] [2022-03-03 18:25:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:47,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:47,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675967791] [2022-03-03 18:25:47,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675967791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:47,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:47,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:47,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750112415] [2022-03-03 18:25:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:47,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:47,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:47,318 INFO L87 Difference]: Start difference. First operand 11872 states and 23312 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:48,716 INFO L93 Difference]: Finished difference Result 22094 states and 43756 transitions. [2022-03-03 18:25:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:25:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:48,751 INFO L225 Difference]: With dead ends: 22094 [2022-03-03 18:25:48,752 INFO L226 Difference]: Without dead ends: 22094 [2022-03-03 18:25:48,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:25:48,752 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:48,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 3873 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:25:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-03-03 18:25:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904. [2022-03-03 18:25:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11904 states, 11835 states have (on average 1.9751584283903676) internal successors, (23376), 11903 states have internal predecessors, (23376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions. [2022-03-03 18:25:48,953 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476 [2022-03-03 18:25:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:48,954 INFO L470 AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions. [2022-03-03 18:25:48,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions. [2022-03-03 18:25:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:48,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:48,957 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:48,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-03 18:25:48,957 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times [2022-03-03 18:25:48,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:48,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891924459] [2022-03-03 18:25:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:49,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:49,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891924459] [2022-03-03 18:25:49,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891924459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:49,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:49,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:25:49,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371034876] [2022-03-03 18:25:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:49,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:25:49,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:25:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:25:49,289 INFO L87 Difference]: Start difference. First operand 11904 states and 23376 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:50,738 INFO L93 Difference]: Finished difference Result 21883 states and 43334 transitions. [2022-03-03 18:25:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:25:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:50,770 INFO L225 Difference]: With dead ends: 21883 [2022-03-03 18:25:50,771 INFO L226 Difference]: Without dead ends: 21883 [2022-03-03 18:25:50,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:25:50,771 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 1085 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:50,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 4816 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:25:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2022-03-03 18:25:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847. [2022-03-03 18:25:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-03 18:25:50,984 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-03 18:25:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:50,984 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-03 18:25:50,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-03 18:25:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:51,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:51,039 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:51,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-03 18:25:51,039 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times [2022-03-03 18:25:51,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:51,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478508264] [2022-03-03 18:25:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:51,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:51,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478508264] [2022-03-03 18:25:51,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478508264] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:51,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:51,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:51,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807518605] [2022-03-03 18:25:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:51,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:51,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:51,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:51,358 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:52,845 INFO L93 Difference]: Finished difference Result 22050 states and 43668 transitions. [2022-03-03 18:25:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:25:52,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:52,878 INFO L225 Difference]: With dead ends: 22050 [2022-03-03 18:25:52,878 INFO L226 Difference]: Without dead ends: 22050 [2022-03-03 18:25:52,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:52,879 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 913 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:52,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4836 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:25:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22050 states. [2022-03-03 18:25:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919. [2022-03-03 18:25:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-03 18:25:53,091 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-03 18:25:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:53,091 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-03 18:25:53,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-03 18:25:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:53,095 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:53,095 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:53,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-03 18:25:53,095 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times [2022-03-03 18:25:53,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:53,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187987567] [2022-03-03 18:25:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:53,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:53,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187987567] [2022-03-03 18:25:53,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187987567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:53,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:53,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:25:53,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768770162] [2022-03-03 18:25:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:53,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:25:53,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:25:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:25:53,423 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:55,086 INFO L93 Difference]: Finished difference Result 21957 states and 43482 transitions. [2022-03-03 18:25:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:25:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:55,118 INFO L225 Difference]: With dead ends: 21957 [2022-03-03 18:25:55,119 INFO L226 Difference]: Without dead ends: 21957 [2022-03-03 18:25:55,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:25:55,120 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:55,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 5469 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:25:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-03-03 18:25:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847. [2022-03-03 18:25:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-03 18:25:55,323 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-03 18:25:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:55,323 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-03 18:25:55,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-03 18:25:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:55,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:55,326 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:55,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-03 18:25:55,326 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times [2022-03-03 18:25:55,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:55,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002977087] [2022-03-03 18:25:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:55,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:55,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002977087] [2022-03-03 18:25:55,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002977087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:55,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:55,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:55,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674373836] [2022-03-03 18:25:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:55,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:55,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:55,672 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:56,693 INFO L93 Difference]: Finished difference Result 13605 states and 26712 transitions. [2022-03-03 18:25:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:25:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:56,711 INFO L225 Difference]: With dead ends: 13605 [2022-03-03 18:25:56,711 INFO L226 Difference]: Without dead ends: 13605 [2022-03-03 18:25:56,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:25:56,712 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 603 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:56,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 2837 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:25:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2022-03-03 18:25:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867. [2022-03-03 18:25:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11798 states have (on average 1.9750805221223937) internal successors, (23302), 11866 states have internal predecessors, (23302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions. [2022-03-03 18:25:56,865 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476 [2022-03-03 18:25:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:56,866 INFO L470 AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions. [2022-03-03 18:25:56,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions. [2022-03-03 18:25:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:56,870 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:56,870 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:56,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-03 18:25:56,870 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times [2022-03-03 18:25:56,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:56,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277798401] [2022-03-03 18:25:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:57,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:57,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277798401] [2022-03-03 18:25:57,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277798401] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:57,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:57,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:57,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315425504] [2022-03-03 18:25:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:57,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:57,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:57,181 INFO L87 Difference]: Start difference. First operand 11867 states and 23302 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:58,364 INFO L93 Difference]: Finished difference Result 13688 states and 26878 transitions. [2022-03-03 18:25:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:25:58,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:25:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:58,385 INFO L225 Difference]: With dead ends: 13688 [2022-03-03 18:25:58,385 INFO L226 Difference]: Without dead ends: 13688 [2022-03-03 18:25:58,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:25:58,386 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 612 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:58,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 3246 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:25:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2022-03-03 18:25:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875. [2022-03-03 18:25:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11806 states have (on average 1.9750974080975776) internal successors, (23318), 11874 states have internal predecessors, (23318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions. [2022-03-03 18:25:58,543 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476 [2022-03-03 18:25:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:58,544 INFO L470 AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions. [2022-03-03 18:25:58,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions. [2022-03-03 18:25:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:25:58,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:58,547 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:58,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-03 18:25:58,547 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times [2022-03-03 18:25:58,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:58,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316081236] [2022-03-03 18:25:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:25:58,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:58,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316081236] [2022-03-03 18:25:58,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316081236] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:58,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:58,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:25:58,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893104397] [2022-03-03 18:25:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:58,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:25:58,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:25:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:25:58,848 INFO L87 Difference]: Start difference. First operand 11875 states and 23318 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:00,098 INFO L93 Difference]: Finished difference Result 13858 states and 27218 transitions. [2022-03-03 18:26:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:00,118 INFO L225 Difference]: With dead ends: 13858 [2022-03-03 18:26:00,118 INFO L226 Difference]: Without dead ends: 13858 [2022-03-03 18:26:00,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:00,119 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 640 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:00,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 3277 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:26:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2022-03-03 18:26:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883. [2022-03-03 18:26:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:00,286 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:00,286 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:00,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:00,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:00,290 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:00,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-03 18:26:00,290 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times [2022-03-03 18:26:00,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:00,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374947057] [2022-03-03 18:26:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:00,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:00,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374947057] [2022-03-03 18:26:00,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374947057] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:00,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:00,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:00,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660983019] [2022-03-03 18:26:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:00,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:00,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:00,610 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:01,892 INFO L93 Difference]: Finished difference Result 13640 states and 26782 transitions. [2022-03-03 18:26:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:01,911 INFO L225 Difference]: With dead ends: 13640 [2022-03-03 18:26:01,912 INFO L226 Difference]: Without dead ends: 13640 [2022-03-03 18:26:01,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:26:01,912 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 693 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:01,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3423 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:26:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2022-03-03 18:26:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884. [2022-03-03 18:26:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11815 states have (on average 1.9751163774862464) internal successors, (23336), 11883 states have internal predecessors, (23336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions. [2022-03-03 18:26:02,070 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476 [2022-03-03 18:26:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:02,071 INFO L470 AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions. [2022-03-03 18:26:02,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions. [2022-03-03 18:26:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:02,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:02,074 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:02,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-03 18:26:02,074 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times [2022-03-03 18:26:02,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:02,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471375500] [2022-03-03 18:26:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:02,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:02,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471375500] [2022-03-03 18:26:02,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471375500] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:02,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:02,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:02,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792030752] [2022-03-03 18:26:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:02,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:02,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:02,380 INFO L87 Difference]: Start difference. First operand 11884 states and 23336 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:03,838 INFO L93 Difference]: Finished difference Result 13799 states and 27100 transitions. [2022-03-03 18:26:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:03,859 INFO L225 Difference]: With dead ends: 13799 [2022-03-03 18:26:03,859 INFO L226 Difference]: Without dead ends: 13799 [2022-03-03 18:26:03,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:03,860 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:03,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 3545 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-03-03 18:26:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883. [2022-03-03 18:26:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:04,056 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:04,057 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:04,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:04,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:04,061 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:04,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-03 18:26:04,061 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times [2022-03-03 18:26:04,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:04,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210363439] [2022-03-03 18:26:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:04,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:04,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210363439] [2022-03-03 18:26:04,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210363439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:04,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:04,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:04,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927788827] [2022-03-03 18:26:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:04,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:04,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:04,356 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:05,846 INFO L93 Difference]: Finished difference Result 13633 states and 26767 transitions. [2022-03-03 18:26:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:05,866 INFO L225 Difference]: With dead ends: 13633 [2022-03-03 18:26:05,866 INFO L226 Difference]: Without dead ends: 13633 [2022-03-03 18:26:05,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:26:05,867 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 749 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:05,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3816 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2022-03-03 18:26:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883. [2022-03-03 18:26:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:06,025 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:06,026 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:06,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:06,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:06,029 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:06,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-03 18:26:06,030 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times [2022-03-03 18:26:06,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:06,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513271311] [2022-03-03 18:26:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:06,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:06,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513271311] [2022-03-03 18:26:06,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513271311] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:06,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:06,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:06,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503366617] [2022-03-03 18:26:06,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:06,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:06,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:06,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:06,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:06,323 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:07,236 INFO L93 Difference]: Finished difference Result 13686 states and 26874 transitions. [2022-03-03 18:26:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:07,256 INFO L225 Difference]: With dead ends: 13686 [2022-03-03 18:26:07,256 INFO L226 Difference]: Without dead ends: 13686 [2022-03-03 18:26:07,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:07,257 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 616 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:07,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 3077 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-03-03 18:26:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889. [2022-03-03 18:26:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11820 states have (on average 1.9751269035532995) internal successors, (23346), 11888 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions. [2022-03-03 18:26:07,405 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476 [2022-03-03 18:26:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:07,406 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions. [2022-03-03 18:26:07,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions. [2022-03-03 18:26:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:07,409 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:07,409 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:07,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-03 18:26:07,409 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times [2022-03-03 18:26:07,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:07,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468278313] [2022-03-03 18:26:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:07,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:07,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468278313] [2022-03-03 18:26:07,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468278313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:07,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:07,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:07,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530739951] [2022-03-03 18:26:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:07,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:07,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:07,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:07,768 INFO L87 Difference]: Start difference. First operand 11889 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:08,601 INFO L93 Difference]: Finished difference Result 13769 states and 27040 transitions. [2022-03-03 18:26:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:08,621 INFO L225 Difference]: With dead ends: 13769 [2022-03-03 18:26:08,621 INFO L226 Difference]: Without dead ends: 13769 [2022-03-03 18:26:08,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:26:08,622 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 617 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:08,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2803 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2022-03-03 18:26:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888. [2022-03-03 18:26:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11819 states have (on average 1.9751247990523733) internal successors, (23344), 11887 states have internal predecessors, (23344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions. [2022-03-03 18:26:08,775 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476 [2022-03-03 18:26:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:08,775 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions. [2022-03-03 18:26:08,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions. [2022-03-03 18:26:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:08,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:08,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:08,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-03 18:26:08,779 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times [2022-03-03 18:26:08,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:08,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742372945] [2022-03-03 18:26:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:09,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:09,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742372945] [2022-03-03 18:26:09,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742372945] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:09,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:09,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:09,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190347234] [2022-03-03 18:26:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:09,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:09,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:09,060 INFO L87 Difference]: Start difference. First operand 11888 states and 23344 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:10,045 INFO L93 Difference]: Finished difference Result 13833 states and 27168 transitions. [2022-03-03 18:26:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:26:10,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:10,064 INFO L225 Difference]: With dead ends: 13833 [2022-03-03 18:26:10,064 INFO L226 Difference]: Without dead ends: 13833 [2022-03-03 18:26:10,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:26:10,064 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 630 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:10,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 3160 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-03 18:26:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887. [2022-03-03 18:26:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9751226941952953) internal successors, (23342), 11886 states have internal predecessors, (23342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions. [2022-03-03 18:26:10,218 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476 [2022-03-03 18:26:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:10,218 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions. [2022-03-03 18:26:10,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions. [2022-03-03 18:26:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:10,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:10,222 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:10,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-03 18:26:10,222 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times [2022-03-03 18:26:10,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:10,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143483671] [2022-03-03 18:26:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:10,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:10,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:10,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143483671] [2022-03-03 18:26:10,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143483671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:10,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:10,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:10,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326346062] [2022-03-03 18:26:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:10,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:10,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:10,525 INFO L87 Difference]: Start difference. First operand 11887 states and 23342 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:12,051 INFO L93 Difference]: Finished difference Result 23633 states and 46768 transitions. [2022-03-03 18:26:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:26:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:12,081 INFO L225 Difference]: With dead ends: 23633 [2022-03-03 18:26:12,081 INFO L226 Difference]: Without dead ends: 23633 [2022-03-03 18:26:12,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-03 18:26:12,082 INFO L933 BasicCegarLoop]: 917 mSDtfsCounter, 1277 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 4730 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:12,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 4730 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2022-03-03 18:26:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919. [2022-03-03 18:26:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-03 18:26:12,277 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-03 18:26:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:12,278 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-03 18:26:12,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-03 18:26:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:12,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:12,281 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:12,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-03 18:26:12,281 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times [2022-03-03 18:26:12,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:12,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480483837] [2022-03-03 18:26:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:12,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:12,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480483837] [2022-03-03 18:26:12,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480483837] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:12,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:12,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:12,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082165582] [2022-03-03 18:26:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:12,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:12,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:12,575 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:14,753 INFO L93 Difference]: Finished difference Result 23388 states and 46278 transitions. [2022-03-03 18:26:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-03 18:26:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:14,787 INFO L225 Difference]: With dead ends: 23388 [2022-03-03 18:26:14,787 INFO L226 Difference]: Without dead ends: 23388 [2022-03-03 18:26:14,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 18:26:14,788 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 1521 mSDsluCounter, 5294 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:14,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 6340 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 18:26:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2022-03-03 18:26:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863. [2022-03-03 18:26:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11863 states, 11794 states have (on average 1.9754112260471426) internal successors, (23298), 11862 states have internal predecessors, (23298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions. [2022-03-03 18:26:14,991 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476 [2022-03-03 18:26:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:14,992 INFO L470 AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions. [2022-03-03 18:26:14,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions. [2022-03-03 18:26:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:14,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:14,995 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:14,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-03 18:26:14,995 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times [2022-03-03 18:26:14,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:14,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145155029] [2022-03-03 18:26:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:15,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:15,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145155029] [2022-03-03 18:26:15,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145155029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:15,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:15,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:15,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516914894] [2022-03-03 18:26:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:15,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:15,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:15,255 INFO L87 Difference]: Start difference. First operand 11863 states and 23298 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:16,244 INFO L93 Difference]: Finished difference Result 12207 states and 23984 transitions. [2022-03-03 18:26:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:16,262 INFO L225 Difference]: With dead ends: 12207 [2022-03-03 18:26:16,262 INFO L226 Difference]: Without dead ends: 12207 [2022-03-03 18:26:16,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:26:16,263 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:16,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 3240 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2022-03-03 18:26:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879. [2022-03-03 18:26:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11810 states have (on average 1.9754445385266723) internal successors, (23330), 11878 states have internal predecessors, (23330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions. [2022-03-03 18:26:16,405 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476 [2022-03-03 18:26:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:16,405 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions. [2022-03-03 18:26:16,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions. [2022-03-03 18:26:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:16,408 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:16,408 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:16,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-03 18:26:16,408 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times [2022-03-03 18:26:16,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:16,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373963013] [2022-03-03 18:26:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:16,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:16,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373963013] [2022-03-03 18:26:16,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373963013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:16,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:16,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:16,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058228535] [2022-03-03 18:26:16,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:16,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:16,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:16,684 INFO L87 Difference]: Start difference. First operand 11879 states and 23330 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:17,526 INFO L93 Difference]: Finished difference Result 12290 states and 24150 transitions. [2022-03-03 18:26:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:17,543 INFO L225 Difference]: With dead ends: 12290 [2022-03-03 18:26:17,543 INFO L226 Difference]: Without dead ends: 12290 [2022-03-03 18:26:17,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:26:17,544 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 313 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:17,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 2725 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2022-03-03 18:26:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887. [2022-03-03 18:26:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9754611609409376) internal successors, (23346), 11886 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions. [2022-03-03 18:26:17,689 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476 [2022-03-03 18:26:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:17,690 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions. [2022-03-03 18:26:17,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions. [2022-03-03 18:26:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:17,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:17,693 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:17,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-03 18:26:17,693 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times [2022-03-03 18:26:17,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:17,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385400063] [2022-03-03 18:26:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:17,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:17,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385400063] [2022-03-03 18:26:17,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385400063] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:17,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:17,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:17,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145589017] [2022-03-03 18:26:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:17,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:17,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:17,963 INFO L87 Difference]: Start difference. First operand 11887 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:18,660 INFO L93 Difference]: Finished difference Result 12354 states and 24278 transitions. [2022-03-03 18:26:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:18,677 INFO L225 Difference]: With dead ends: 12354 [2022-03-03 18:26:18,677 INFO L226 Difference]: Without dead ends: 12354 [2022-03-03 18:26:18,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:26:18,678 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 330 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:18,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 2482 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:26:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2022-03-03 18:26:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895. [2022-03-03 18:26:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11895 states, 11826 states have (on average 1.9754777608658887) internal successors, (23362), 11894 states have internal predecessors, (23362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions. [2022-03-03 18:26:18,823 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476 [2022-03-03 18:26:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:18,823 INFO L470 AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions. [2022-03-03 18:26:18,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions. [2022-03-03 18:26:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:18,826 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:18,826 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:18,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-03 18:26:18,826 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times [2022-03-03 18:26:18,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:18,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961591470] [2022-03-03 18:26:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:19,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:19,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961591470] [2022-03-03 18:26:19,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961591470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:19,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:19,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:19,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560690084] [2022-03-03 18:26:19,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:19,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:19,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:19,133 INFO L87 Difference]: Start difference. First operand 11895 states and 23362 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:20,758 INFO L93 Difference]: Finished difference Result 22106 states and 43782 transitions. [2022-03-03 18:26:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:26:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:20,790 INFO L225 Difference]: With dead ends: 22106 [2022-03-03 18:26:20,790 INFO L226 Difference]: Without dead ends: 22106 [2022-03-03 18:26:20,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:20,791 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 972 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:20,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 5180 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 18:26:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22106 states. [2022-03-03 18:26:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927. [2022-03-03 18:26:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11858 states have (on average 1.9755439365828977) internal successors, (23426), 11926 states have internal predecessors, (23426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions. [2022-03-03 18:26:20,999 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476 [2022-03-03 18:26:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:20,999 INFO L470 AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions. [2022-03-03 18:26:20,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions. [2022-03-03 18:26:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:21,002 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:21,002 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:21,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-03 18:26:21,002 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times [2022-03-03 18:26:21,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:21,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465393919] [2022-03-03 18:26:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:21,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:21,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465393919] [2022-03-03 18:26:21,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465393919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:21,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:21,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:21,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980162721] [2022-03-03 18:26:21,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:21,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:21,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:21,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:21,312 INFO L87 Difference]: Start difference. First operand 11927 states and 23426 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:22,772 INFO L93 Difference]: Finished difference Result 21911 states and 43392 transitions. [2022-03-03 18:26:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:26:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:22,803 INFO L225 Difference]: With dead ends: 21911 [2022-03-03 18:26:22,803 INFO L226 Difference]: Without dead ends: 21911 [2022-03-03 18:26:22,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:26:22,804 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 1149 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:22,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 4839 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:26:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2022-03-03 18:26:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848. [2022-03-03 18:26:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11779 states have (on average 1.9753799134052126) internal successors, (23268), 11847 states have internal predecessors, (23268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions. [2022-03-03 18:26:23,001 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476 [2022-03-03 18:26:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:23,002 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions. [2022-03-03 18:26:23,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions. [2022-03-03 18:26:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:23,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:23,005 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:23,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-03 18:26:23,005 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times [2022-03-03 18:26:23,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:23,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501010003] [2022-03-03 18:26:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:23,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:23,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501010003] [2022-03-03 18:26:23,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501010003] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:23,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:23,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:23,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126172623] [2022-03-03 18:26:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:23,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:23,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:23,299 INFO L87 Difference]: Start difference. First operand 11848 states and 23268 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:24,688 INFO L93 Difference]: Finished difference Result 21819 states and 43200 transitions. [2022-03-03 18:26:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:24,719 INFO L225 Difference]: With dead ends: 21819 [2022-03-03 18:26:24,719 INFO L226 Difference]: Without dead ends: 21819 [2022-03-03 18:26:24,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:26:24,720 INFO L933 BasicCegarLoop]: 842 mSDtfsCounter, 933 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:24,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 4801 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2022-03-03 18:26:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741. [2022-03-03 18:26:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 11673 states have (on average 1.9742996658956566) internal successors, (23046), 11740 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions. [2022-03-03 18:26:24,914 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476 [2022-03-03 18:26:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:24,915 INFO L470 AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions. [2022-03-03 18:26:24,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions. [2022-03-03 18:26:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:24,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:24,918 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:24,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-03 18:26:24,918 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times [2022-03-03 18:26:24,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:24,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529722184] [2022-03-03 18:26:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:25,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:25,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529722184] [2022-03-03 18:26:25,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529722184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:25,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:25,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:25,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109606454] [2022-03-03 18:26:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:25,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:25,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:25,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:25,167 INFO L87 Difference]: Start difference. First operand 11741 states and 23046 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:27,089 INFO L93 Difference]: Finished difference Result 21742 states and 43046 transitions. [2022-03-03 18:26:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 18:26:27,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-03 18:26:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:27,120 INFO L225 Difference]: With dead ends: 21742 [2022-03-03 18:26:27,120 INFO L226 Difference]: Without dead ends: 21742 [2022-03-03 18:26:27,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:26:27,121 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 1095 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:27,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 5795 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 18:26:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2022-03-03 18:26:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608. [2022-03-03 18:26:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11540 states have (on average 1.974003466204506) internal successors, (22780), 11607 states have internal predecessors, (22780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions. [2022-03-03 18:26:27,312 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476 [2022-03-03 18:26:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:27,313 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions. [2022-03-03 18:26:27,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions. [2022-03-03 18:26:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-03 18:26:27,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:27,316 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:27,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-03 18:26:27,316 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times [2022-03-03 18:26:27,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:27,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29674331] [2022-03-03 18:26:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:27,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:27,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29674331] [2022-03-03 18:26:27,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29674331] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:27,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:27,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:26:27,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041863645] [2022-03-03 18:26:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:27,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:26:27,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:26:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:26:27,570 INFO L87 Difference]: Start difference. First operand 11608 states and 22780 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:28,008 INFO L93 Difference]: Finished difference Result 15459 states and 30482 transitions. [2022-03-03 18:26:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:26:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2022-03-03 18:26:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:28,029 INFO L225 Difference]: With dead ends: 15459 [2022-03-03 18:26:28,029 INFO L226 Difference]: Without dead ends: 15459 [2022-03-03 18:26:28,029 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-03 18:26:28,029 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:28,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 888 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:26:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2022-03-03 18:26:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246. [2022-03-03 18:26:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12246 states, 12178 states have (on average 1.975365413039908) internal successors, (24056), 12245 states have internal predecessors, (24056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions. [2022-03-03 18:26:28,190 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477 [2022-03-03 18:26:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:28,190 INFO L470 AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions. [2022-03-03 18:26:28,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions. [2022-03-03 18:26:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-03 18:26:28,193 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:28,193 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:28,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-03 18:26:28,193 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times [2022-03-03 18:26:28,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:28,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99656720] [2022-03-03 18:26:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:28,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:28,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99656720] [2022-03-03 18:26:28,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99656720] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:28,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:28,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:26:28,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137625481] [2022-03-03 18:26:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:28,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:26:28,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:26:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:26:28,401 INFO L87 Difference]: Start difference. First operand 12246 states and 24056 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:29,081 INFO L93 Difference]: Finished difference Result 14561 states and 28686 transitions. [2022-03-03 18:26:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:26:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2022-03-03 18:26:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:29,101 INFO L225 Difference]: With dead ends: 14561 [2022-03-03 18:26:29,101 INFO L226 Difference]: Without dead ends: 14561 [2022-03-03 18:26:29,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:26:29,102 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:29,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1220 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:26:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2022-03-03 18:26:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666. [2022-03-03 18:26:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12600 states have (on average 1.9758730158730158) internal successors, (24896), 12665 states have internal predecessors, (24896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions. [2022-03-03 18:26:29,269 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477 [2022-03-03 18:26:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:29,269 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions. [2022-03-03 18:26:29,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions. [2022-03-03 18:26:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:29,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:29,274 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:29,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-03 18:26:29,274 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times [2022-03-03 18:26:29,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:29,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276979937] [2022-03-03 18:26:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:29,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:29,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276979937] [2022-03-03 18:26:29,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276979937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:29,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:29,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:29,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366813759] [2022-03-03 18:26:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:29,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:29,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:29,540 INFO L87 Difference]: Start difference. First operand 12666 states and 24896 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:30,510 INFO L93 Difference]: Finished difference Result 12802 states and 25168 transitions. [2022-03-03 18:26:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:26:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:30,528 INFO L225 Difference]: With dead ends: 12802 [2022-03-03 18:26:30,528 INFO L226 Difference]: Without dead ends: 12802 [2022-03-03 18:26:30,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:26:30,530 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 565 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:30,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 2745 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-03-03 18:26:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683. [2022-03-03 18:26:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12683 states, 12617 states have (on average 1.9759055242926211) internal successors, (24930), 12682 states have internal predecessors, (24930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions. [2022-03-03 18:26:30,766 INFO L78 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484 [2022-03-03 18:26:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:30,766 INFO L470 AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions. [2022-03-03 18:26:30,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions. [2022-03-03 18:26:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:30,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:30,770 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:30,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-03 18:26:30,770 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times [2022-03-03 18:26:30,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:30,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135332407] [2022-03-03 18:26:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:31,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:31,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135332407] [2022-03-03 18:26:31,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135332407] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:31,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:31,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:31,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273411838] [2022-03-03 18:26:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:31,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:31,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:31,067 INFO L87 Difference]: Start difference. First operand 12683 states and 24930 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:32,235 INFO L93 Difference]: Finished difference Result 12858 states and 25280 transitions. [2022-03-03 18:26:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:32,252 INFO L225 Difference]: With dead ends: 12858 [2022-03-03 18:26:32,252 INFO L226 Difference]: Without dead ends: 12858 [2022-03-03 18:26:32,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:26:32,253 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:32,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 3092 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-03 18:26:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703. [2022-03-03 18:26:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12703 states, 12637 states have (on average 1.9759436575136504) internal successors, (24970), 12702 states have internal predecessors, (24970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions. [2022-03-03 18:26:32,409 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484 [2022-03-03 18:26:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:32,409 INFO L470 AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions. [2022-03-03 18:26:32,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions. [2022-03-03 18:26:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:32,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:32,413 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:32,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-03 18:26:32,414 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times [2022-03-03 18:26:32,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:32,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599837473] [2022-03-03 18:26:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:32,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:32,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599837473] [2022-03-03 18:26:32,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599837473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:32,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:32,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:32,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603326328] [2022-03-03 18:26:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:32,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:32,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:32,665 INFO L87 Difference]: Start difference. First operand 12703 states and 24970 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:33,780 INFO L93 Difference]: Finished difference Result 12891 states and 25346 transitions. [2022-03-03 18:26:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:33,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:33,796 INFO L225 Difference]: With dead ends: 12891 [2022-03-03 18:26:33,796 INFO L226 Difference]: Without dead ends: 12891 [2022-03-03 18:26:33,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:33,797 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 578 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:33,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 2818 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2022-03-03 18:26:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704. [2022-03-03 18:26:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12704 states, 12638 states have (on average 1.9759455610064884) internal successors, (24972), 12703 states have internal predecessors, (24972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions. [2022-03-03 18:26:33,947 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484 [2022-03-03 18:26:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:33,948 INFO L470 AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions. [2022-03-03 18:26:33,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions. [2022-03-03 18:26:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:33,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:33,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:33,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-03 18:26:33,951 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times [2022-03-03 18:26:33,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:33,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741265332] [2022-03-03 18:26:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:34,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:34,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741265332] [2022-03-03 18:26:34,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741265332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:34,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:34,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:34,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133658031] [2022-03-03 18:26:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:34,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:34,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:34,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:34,302 INFO L87 Difference]: Start difference. First operand 12704 states and 24972 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:35,641 INFO L93 Difference]: Finished difference Result 12912 states and 25388 transitions. [2022-03-03 18:26:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:35,658 INFO L225 Difference]: With dead ends: 12912 [2022-03-03 18:26:35,658 INFO L226 Difference]: Without dead ends: 12912 [2022-03-03 18:26:35,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:35,659 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 601 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:35,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3300 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-03-03 18:26:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723. [2022-03-03 18:26:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12657 states have (on average 1.9759816702220114) internal successors, (25010), 12722 states have internal predecessors, (25010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions. [2022-03-03 18:26:35,813 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484 [2022-03-03 18:26:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:35,814 INFO L470 AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions. [2022-03-03 18:26:35,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions. [2022-03-03 18:26:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:35,817 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:35,817 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:35,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-03 18:26:35,817 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:35,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times [2022-03-03 18:26:35,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:35,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346523007] [2022-03-03 18:26:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:36,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:36,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346523007] [2022-03-03 18:26:36,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346523007] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:36,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:36,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:36,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271561273] [2022-03-03 18:26:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:36,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:36,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:36,044 INFO L87 Difference]: Start difference. First operand 12723 states and 25010 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:36,984 INFO L93 Difference]: Finished difference Result 12970 states and 25504 transitions. [2022-03-03 18:26:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:26:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:37,003 INFO L225 Difference]: With dead ends: 12970 [2022-03-03 18:26:37,003 INFO L226 Difference]: Without dead ends: 12970 [2022-03-03 18:26:37,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:26:37,003 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 613 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:37,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2440 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2022-03-03 18:26:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743. [2022-03-03 18:26:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12743 states, 12677 states have (on average 1.9760195629880886) internal successors, (25050), 12742 states have internal predecessors, (25050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions. [2022-03-03 18:26:37,163 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484 [2022-03-03 18:26:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:37,164 INFO L470 AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions. [2022-03-03 18:26:37,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions. [2022-03-03 18:26:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:37,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:37,167 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:37,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-03 18:26:37,167 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times [2022-03-03 18:26:37,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:37,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674142312] [2022-03-03 18:26:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:37,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:37,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674142312] [2022-03-03 18:26:37,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674142312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:37,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:37,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:37,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595421462] [2022-03-03 18:26:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:37,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:37,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:37,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:37,430 INFO L87 Difference]: Start difference. First operand 12743 states and 25050 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:38,733 INFO L93 Difference]: Finished difference Result 13201 states and 25966 transitions. [2022-03-03 18:26:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:26:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:38,754 INFO L225 Difference]: With dead ends: 13201 [2022-03-03 18:26:38,754 INFO L226 Difference]: Without dead ends: 13201 [2022-03-03 18:26:38,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2022-03-03 18:26:38,755 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 722 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:38,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 3462 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2022-03-03 18:26:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755. [2022-03-03 18:26:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12755 states, 12689 states have (on average 1.976042241311372) internal successors, (25074), 12754 states have internal predecessors, (25074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions. [2022-03-03 18:26:38,913 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484 [2022-03-03 18:26:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:38,913 INFO L470 AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions. [2022-03-03 18:26:38,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions. [2022-03-03 18:26:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:38,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:38,916 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:38,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-03 18:26:38,916 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times [2022-03-03 18:26:38,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:38,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178908118] [2022-03-03 18:26:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:39,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:39,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178908118] [2022-03-03 18:26:39,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178908118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:39,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:39,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:39,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312669524] [2022-03-03 18:26:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:39,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:39,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:39,136 INFO L87 Difference]: Start difference. First operand 12755 states and 25074 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:40,603 INFO L93 Difference]: Finished difference Result 23707 states and 46979 transitions. [2022-03-03 18:26:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:26:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:40,637 INFO L225 Difference]: With dead ends: 23707 [2022-03-03 18:26:40,638 INFO L226 Difference]: Without dead ends: 23707 [2022-03-03 18:26:40,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2022-03-03 18:26:40,638 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 1339 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:40,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 4354 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2022-03-03 18:26:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962. [2022-03-03 18:26:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12896 states have (on average 1.9764267990074442) internal successors, (25488), 12961 states have internal predecessors, (25488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions. [2022-03-03 18:26:40,860 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484 [2022-03-03 18:26:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:40,861 INFO L470 AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions. [2022-03-03 18:26:40,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions. [2022-03-03 18:26:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:40,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:40,865 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:40,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-03 18:26:40,865 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times [2022-03-03 18:26:40,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:40,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230279314] [2022-03-03 18:26:40,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:41,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:41,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230279314] [2022-03-03 18:26:41,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230279314] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:41,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:41,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:41,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197171896] [2022-03-03 18:26:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:41,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:41,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:41,113 INFO L87 Difference]: Start difference. First operand 12962 states and 25488 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:42,694 INFO L93 Difference]: Finished difference Result 23598 states and 46761 transitions. [2022-03-03 18:26:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 18:26:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:42,724 INFO L225 Difference]: With dead ends: 23598 [2022-03-03 18:26:42,724 INFO L226 Difference]: Without dead ends: 23598 [2022-03-03 18:26:42,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:26:42,725 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1413 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:42,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1413 Valid, 3998 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2022-03-03 18:26:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954. [2022-03-03 18:26:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12954 states, 12889 states have (on average 1.9762588253549538) internal successors, (25472), 12953 states have internal predecessors, (25472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions. [2022-03-03 18:26:42,936 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484 [2022-03-03 18:26:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:42,937 INFO L470 AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions. [2022-03-03 18:26:42,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions. [2022-03-03 18:26:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:42,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:42,940 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:42,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-03 18:26:42,940 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times [2022-03-03 18:26:42,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:42,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275995036] [2022-03-03 18:26:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:43,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:43,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275995036] [2022-03-03 18:26:43,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275995036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:43,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:43,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:43,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813427758] [2022-03-03 18:26:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:43,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:43,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:43,184 INFO L87 Difference]: Start difference. First operand 12954 states and 25472 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:44,558 INFO L93 Difference]: Finished difference Result 24018 states and 47600 transitions. [2022-03-03 18:26:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:26:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:44,598 INFO L225 Difference]: With dead ends: 24018 [2022-03-03 18:26:44,598 INFO L226 Difference]: Without dead ends: 24018 [2022-03-03 18:26:44,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:26:44,598 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 913 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:44,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4241 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-03-03 18:26:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195. [2022-03-03 18:26:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13195 states, 13130 states have (on average 1.9766945925361767) internal successors, (25954), 13194 states have internal predecessors, (25954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions. [2022-03-03 18:26:44,825 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484 [2022-03-03 18:26:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:44,826 INFO L470 AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions. [2022-03-03 18:26:44,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions. [2022-03-03 18:26:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:44,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:44,829 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:44,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-03 18:26:44,829 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times [2022-03-03 18:26:44,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:44,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929579382] [2022-03-03 18:26:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:45,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:45,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929579382] [2022-03-03 18:26:45,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929579382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:45,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:45,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:45,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957535578] [2022-03-03 18:26:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:45,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:45,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:45,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:45,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:45,103 INFO L87 Difference]: Start difference. First operand 13195 states and 25954 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:45,981 INFO L93 Difference]: Finished difference Result 13507 states and 26578 transitions. [2022-03-03 18:26:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:26:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:45,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:45,995 INFO L225 Difference]: With dead ends: 13507 [2022-03-03 18:26:45,996 INFO L226 Difference]: Without dead ends: 13507 [2022-03-03 18:26:45,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:26:45,996 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:45,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 2672 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2022-03-03 18:26:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199. [2022-03-03 18:26:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:26:46,161 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:26:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:46,162 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:26:46,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:26:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:46,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:46,165 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:46,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-03 18:26:46,166 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times [2022-03-03 18:26:46,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:46,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649471718] [2022-03-03 18:26:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:46,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:46,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649471718] [2022-03-03 18:26:46,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649471718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:46,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:46,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:46,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571310639] [2022-03-03 18:26:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:46,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:46,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:46,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:46,402 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:47,122 INFO L93 Difference]: Finished difference Result 13561 states and 26686 transitions. [2022-03-03 18:26:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:47,140 INFO L225 Difference]: With dead ends: 13561 [2022-03-03 18:26:47,140 INFO L226 Difference]: Without dead ends: 13561 [2022-03-03 18:26:47,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:47,141 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:47,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2252 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:26:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2022-03-03 18:26:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199. [2022-03-03 18:26:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:26:47,304 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:26:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:47,305 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:26:47,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:26:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:47,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:47,308 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:47,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-03 18:26:47,308 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times [2022-03-03 18:26:47,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:47,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432689869] [2022-03-03 18:26:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:47,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:47,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432689869] [2022-03-03 18:26:47,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432689869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:47,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:47,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:47,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736982890] [2022-03-03 18:26:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:47,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:47,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:47,575 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:48,530 INFO L93 Difference]: Finished difference Result 13609 states and 26782 transitions. [2022-03-03 18:26:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:48,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:48,549 INFO L225 Difference]: With dead ends: 13609 [2022-03-03 18:26:48,549 INFO L226 Difference]: Without dead ends: 13609 [2022-03-03 18:26:48,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:48,550 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 332 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:48,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 2810 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2022-03-03 18:26:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199. [2022-03-03 18:26:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:26:48,710 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:26:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:48,711 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:26:48,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:26:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:48,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:48,714 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:48,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-03 18:26:48,714 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times [2022-03-03 18:26:48,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:48,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559772046] [2022-03-03 18:26:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:49,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:49,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559772046] [2022-03-03 18:26:49,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559772046] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:49,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:49,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:49,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589560389] [2022-03-03 18:26:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:49,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:49,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:49,018 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:49,770 INFO L93 Difference]: Finished difference Result 13663 states and 26890 transitions. [2022-03-03 18:26:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:49,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:49,788 INFO L225 Difference]: With dead ends: 13663 [2022-03-03 18:26:49,788 INFO L226 Difference]: Without dead ends: 13663 [2022-03-03 18:26:49,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:49,788 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:49,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 2303 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:26:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2022-03-03 18:26:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199. [2022-03-03 18:26:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:26:49,948 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:26:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:49,948 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:26:49,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:26:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:49,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:49,952 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:49,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-03 18:26:49,952 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times [2022-03-03 18:26:49,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:49,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545473544] [2022-03-03 18:26:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:50,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:50,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545473544] [2022-03-03 18:26:50,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545473544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:50,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:50,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:50,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720837625] [2022-03-03 18:26:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:50,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:50,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:50,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:50,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:50,198 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:51,648 INFO L93 Difference]: Finished difference Result 23784 states and 47132 transitions. [2022-03-03 18:26:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:51,682 INFO L225 Difference]: With dead ends: 23784 [2022-03-03 18:26:51,682 INFO L226 Difference]: Without dead ends: 23784 [2022-03-03 18:26:51,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:26:51,683 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 765 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:51,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 4807 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2022-03-03 18:26:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971. [2022-03-03 18:26:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:26:51,907 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:26:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:51,907 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:26:51,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:26:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:51,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:51,910 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:51,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-03 18:26:51,910 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times [2022-03-03 18:26:51,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:51,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498826915] [2022-03-03 18:26:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:51,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:52,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:52,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498826915] [2022-03-03 18:26:52,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498826915] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:52,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:52,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:52,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851902091] [2022-03-03 18:26:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:52,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:52,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:52,138 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:53,711 INFO L93 Difference]: Finished difference Result 23965 states and 47494 transitions. [2022-03-03 18:26:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:26:53,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:53,745 INFO L225 Difference]: With dead ends: 23965 [2022-03-03 18:26:53,745 INFO L226 Difference]: Without dead ends: 23965 [2022-03-03 18:26:53,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:26:53,745 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:53,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 4774 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:26:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23965 states. [2022-03-03 18:26:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214. [2022-03-03 18:26:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:26:53,962 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:26:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:53,962 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:26:53,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:26:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:53,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:53,966 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:53,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-03 18:26:53,966 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times [2022-03-03 18:26:53,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:53,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120138200] [2022-03-03 18:26:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:54,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:54,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120138200] [2022-03-03 18:26:54,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120138200] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:54,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:54,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:54,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399885418] [2022-03-03 18:26:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:54,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:54,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:54,190 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:55,682 INFO L93 Difference]: Finished difference Result 23857 states and 47278 transitions. [2022-03-03 18:26:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:26:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:55,716 INFO L225 Difference]: With dead ends: 23857 [2022-03-03 18:26:55,716 INFO L226 Difference]: Without dead ends: 23857 [2022-03-03 18:26:55,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:26:55,717 INFO L933 BasicCegarLoop]: 939 mSDtfsCounter, 816 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:55,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 5100 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2022-03-03 18:26:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971. [2022-03-03 18:26:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:26:55,948 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:26:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:55,948 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:26:55,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:26:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:55,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:55,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:55,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-03 18:26:55,952 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times [2022-03-03 18:26:55,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:55,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302976856] [2022-03-03 18:26:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:56,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:56,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302976856] [2022-03-03 18:26:56,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302976856] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:56,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:56,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:56,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324183685] [2022-03-03 18:26:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:56,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:56,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:56,243 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:57,546 INFO L93 Difference]: Finished difference Result 25380 states and 50259 transitions. [2022-03-03 18:26:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:26:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:57,585 INFO L225 Difference]: With dead ends: 25380 [2022-03-03 18:26:57,585 INFO L226 Difference]: Without dead ends: 25380 [2022-03-03 18:26:57,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-03-03 18:26:57,586 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1399 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:57,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 4186 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-03-03 18:26:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569. [2022-03-03 18:26:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14569 states, 14504 states have (on average 1.993656922228351) internal successors, (28916), 14568 states have internal predecessors, (28916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions. [2022-03-03 18:26:57,835 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484 [2022-03-03 18:26:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:57,835 INFO L470 AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions. [2022-03-03 18:26:57,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions. [2022-03-03 18:26:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:57,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:57,839 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:57,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-03 18:26:57,839 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times [2022-03-03 18:26:57,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:57,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297073363] [2022-03-03 18:26:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:58,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:58,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297073363] [2022-03-03 18:26:58,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297073363] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:58,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:58,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:58,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017086292] [2022-03-03 18:26:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:58,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:58,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:58,146 INFO L87 Difference]: Start difference. First operand 14569 states and 28916 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:59,060 INFO L93 Difference]: Finished difference Result 16297 states and 32307 transitions. [2022-03-03 18:26:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:26:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:59,083 INFO L225 Difference]: With dead ends: 16297 [2022-03-03 18:26:59,083 INFO L226 Difference]: Without dead ends: 16297 [2022-03-03 18:26:59,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:59,085 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 574 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:59,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3050 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16297 states. [2022-03-03 18:26:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572. [2022-03-03 18:26:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14507 states have (on average 1.9936582339560212) internal successors, (28922), 14571 states have internal predecessors, (28922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions. [2022-03-03 18:26:59,284 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484 [2022-03-03 18:26:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:59,285 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions. [2022-03-03 18:26:59,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions. [2022-03-03 18:26:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:26:59,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:59,288 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:59,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-03 18:26:59,289 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:59,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times [2022-03-03 18:26:59,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:59,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723865301] [2022-03-03 18:26:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:59,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:59,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723865301] [2022-03-03 18:26:59,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723865301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:59,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:59,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:59,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239486603] [2022-03-03 18:26:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:59,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:59,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:59,542 INFO L87 Difference]: Start difference. First operand 14572 states and 28922 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:00,652 INFO L93 Difference]: Finished difference Result 16351 states and 32415 transitions. [2022-03-03 18:27:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:00,674 INFO L225 Difference]: With dead ends: 16351 [2022-03-03 18:27:00,674 INFO L226 Difference]: Without dead ends: 16351 [2022-03-03 18:27:00,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:27:00,675 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 601 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:00,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3454 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2022-03-03 18:27:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571. [2022-03-03 18:27:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14571 states, 14506 states have (on average 1.9936577967737488) internal successors, (28920), 14570 states have internal predecessors, (28920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions. [2022-03-03 18:27:00,869 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484 [2022-03-03 18:27:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:00,869 INFO L470 AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions. [2022-03-03 18:27:00,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions. [2022-03-03 18:27:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:00,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:00,873 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:00,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-03 18:27:00,873 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times [2022-03-03 18:27:00,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:00,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925459061] [2022-03-03 18:27:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:01,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:01,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925459061] [2022-03-03 18:27:01,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925459061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:01,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:01,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:01,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324664997] [2022-03-03 18:27:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:01,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:01,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:01,122 INFO L87 Difference]: Start difference. First operand 14571 states and 28920 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:01,950 INFO L93 Difference]: Finished difference Result 16399 states and 32511 transitions. [2022-03-03 18:27:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:01,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:01,973 INFO L225 Difference]: With dead ends: 16399 [2022-03-03 18:27:01,973 INFO L226 Difference]: Without dead ends: 16399 [2022-03-03 18:27:01,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:27:01,974 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 616 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:01,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 2788 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2022-03-03 18:27:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570. [2022-03-03 18:27:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-03 18:27:02,171 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-03 18:27:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:02,172 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-03 18:27:02,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-03 18:27:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:02,175 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:02,175 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:02,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-03 18:27:02,175 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times [2022-03-03 18:27:02,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:02,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210274741] [2022-03-03 18:27:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:02,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:02,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210274741] [2022-03-03 18:27:02,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210274741] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:02,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:02,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:02,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71652208] [2022-03-03 18:27:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:02,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:02,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:02,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:02,426 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:03,331 INFO L93 Difference]: Finished difference Result 16449 states and 32611 transitions. [2022-03-03 18:27:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:27:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:03,350 INFO L225 Difference]: With dead ends: 16449 [2022-03-03 18:27:03,351 INFO L226 Difference]: Without dead ends: 16449 [2022-03-03 18:27:03,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:27:03,351 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 629 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:03,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2795 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2022-03-03 18:27:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570. [2022-03-03 18:27:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-03 18:27:03,529 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-03 18:27:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:03,529 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-03 18:27:03,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-03 18:27:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:03,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:03,533 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:03,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-03 18:27:03,533 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times [2022-03-03 18:27:03,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:03,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360145178] [2022-03-03 18:27:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:03,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:03,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360145178] [2022-03-03 18:27:03,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360145178] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:03,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:03,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:03,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675967832] [2022-03-03 18:27:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:03,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:03,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:03,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:03,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:03,811 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:05,345 INFO L93 Difference]: Finished difference Result 16314 states and 32340 transitions. [2022-03-03 18:27:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:27:05,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:05,368 INFO L225 Difference]: With dead ends: 16314 [2022-03-03 18:27:05,368 INFO L226 Difference]: Without dead ends: 16314 [2022-03-03 18:27:05,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:27:05,369 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 722 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:05,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 4009 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2022-03-03 18:27:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555. [2022-03-03 18:27:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14555 states, 14490 states have (on average 1.9935127674258108) internal successors, (28886), 14554 states have internal predecessors, (28886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions. [2022-03-03 18:27:05,559 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484 [2022-03-03 18:27:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:05,559 INFO L470 AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions. [2022-03-03 18:27:05,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions. [2022-03-03 18:27:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:05,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:05,563 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:05,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-03 18:27:05,564 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times [2022-03-03 18:27:05,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:05,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887133403] [2022-03-03 18:27:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:05,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:05,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887133403] [2022-03-03 18:27:05,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887133403] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:05,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:05,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:05,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550204800] [2022-03-03 18:27:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:05,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:05,832 INFO L87 Difference]: Start difference. First operand 14555 states and 28886 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:07,563 INFO L93 Difference]: Finished difference Result 16306 states and 32322 transitions. [2022-03-03 18:27:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:07,584 INFO L225 Difference]: With dead ends: 16306 [2022-03-03 18:27:07,584 INFO L226 Difference]: Without dead ends: 16306 [2022-03-03 18:27:07,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:27:07,585 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 721 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:07,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 4098 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 18:27:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2022-03-03 18:27:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556. [2022-03-03 18:27:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14556 states, 14491 states have (on average 1.993513215099027) internal successors, (28888), 14555 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions. [2022-03-03 18:27:07,775 INFO L78 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484 [2022-03-03 18:27:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:07,776 INFO L470 AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions. [2022-03-03 18:27:07,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions. [2022-03-03 18:27:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:07,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:07,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:07,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-03 18:27:07,779 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times [2022-03-03 18:27:07,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:07,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029228157] [2022-03-03 18:27:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:08,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:08,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029228157] [2022-03-03 18:27:08,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029228157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:08,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:08,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:08,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429639705] [2022-03-03 18:27:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:08,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:08,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:08,030 INFO L87 Difference]: Start difference. First operand 14556 states and 28888 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:09,785 INFO L93 Difference]: Finished difference Result 16359 states and 32428 transitions. [2022-03-03 18:27:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:09,806 INFO L225 Difference]: With dead ends: 16359 [2022-03-03 18:27:09,807 INFO L226 Difference]: Without dead ends: 16359 [2022-03-03 18:27:09,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:09,807 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 734 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:09,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 4291 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 18:27:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2022-03-03 18:27:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540. [2022-03-03 18:27:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14540 states, 14475 states have (on average 1.9933678756476685) internal successors, (28854), 14539 states have internal predecessors, (28854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions. [2022-03-03 18:27:09,997 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484 [2022-03-03 18:27:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:09,997 INFO L470 AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions. [2022-03-03 18:27:09,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions. [2022-03-03 18:27:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:10,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:10,001 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:10,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-03 18:27:10,001 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times [2022-03-03 18:27:10,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:10,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603581575] [2022-03-03 18:27:10,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:10,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:10,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603581575] [2022-03-03 18:27:10,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603581575] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:10,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:10,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:10,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171332576] [2022-03-03 18:27:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:10,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:10,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:10,253 INFO L87 Difference]: Start difference. First operand 14540 states and 28854 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:11,333 INFO L93 Difference]: Finished difference Result 16300 states and 32309 transitions. [2022-03-03 18:27:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:11,356 INFO L225 Difference]: With dead ends: 16300 [2022-03-03 18:27:11,356 INFO L226 Difference]: Without dead ends: 16300 [2022-03-03 18:27:11,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:27:11,357 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 659 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:11,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 2864 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16300 states. [2022-03-03 18:27:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542. [2022-03-03 18:27:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14477 states have (on average 1.99336879187677) internal successors, (28858), 14541 states have internal predecessors, (28858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions. [2022-03-03 18:27:11,543 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484 [2022-03-03 18:27:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:11,543 INFO L470 AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions. [2022-03-03 18:27:11,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions. [2022-03-03 18:27:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:11,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:11,546 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:11,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-03 18:27:11,546 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times [2022-03-03 18:27:11,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:11,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864863464] [2022-03-03 18:27:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:11,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:11,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864863464] [2022-03-03 18:27:11,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864863464] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:11,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:11,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:11,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255345024] [2022-03-03 18:27:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:11,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:11,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:11,824 INFO L87 Difference]: Start difference. First operand 14542 states and 28858 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:13,172 INFO L93 Difference]: Finished difference Result 16358 states and 32425 transitions. [2022-03-03 18:27:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:13,199 INFO L225 Difference]: With dead ends: 16358 [2022-03-03 18:27:13,199 INFO L226 Difference]: Without dead ends: 16358 [2022-03-03 18:27:13,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:27:13,199 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 664 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:13,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 3416 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-03-03 18:27:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541. [2022-03-03 18:27:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14541 states, 14476 states have (on average 1.9933683337938657) internal successors, (28856), 14540 states have internal predecessors, (28856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions. [2022-03-03 18:27:13,404 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484 [2022-03-03 18:27:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:13,404 INFO L470 AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions. [2022-03-03 18:27:13,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions. [2022-03-03 18:27:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:13,409 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:13,410 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:13,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-03 18:27:13,410 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times [2022-03-03 18:27:13,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:13,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351295814] [2022-03-03 18:27:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:13,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:13,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351295814] [2022-03-03 18:27:13,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351295814] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:13,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:13,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:13,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179463012] [2022-03-03 18:27:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:13,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:13,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:13,672 INFO L87 Difference]: Start difference. First operand 14541 states and 28856 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:15,277 INFO L93 Difference]: Finished difference Result 16443 states and 32595 transitions. [2022-03-03 18:27:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:15,299 INFO L225 Difference]: With dead ends: 16443 [2022-03-03 18:27:15,299 INFO L226 Difference]: Without dead ends: 16443 [2022-03-03 18:27:15,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:15,299 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 675 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:15,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 3881 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2022-03-03 18:27:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214. [2022-03-03 18:27:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:15,473 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:15,474 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:15,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:15,477 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:15,477 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:15,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-03 18:27:15,477 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:15,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times [2022-03-03 18:27:15,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:15,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028455610] [2022-03-03 18:27:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:15,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:15,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028455610] [2022-03-03 18:27:15,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028455610] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:15,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:15,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:15,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567557656] [2022-03-03 18:27:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:15,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:15,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:15,748 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:17,008 INFO L93 Difference]: Finished difference Result 14947 states and 29393 transitions. [2022-03-03 18:27:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:17,027 INFO L225 Difference]: With dead ends: 14947 [2022-03-03 18:27:17,028 INFO L226 Difference]: Without dead ends: 14947 [2022-03-03 18:27:17,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:17,028 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 572 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3553 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:17,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 3553 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:27:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-03-03 18:27:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217. [2022-03-03 18:27:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13217 states, 13152 states have (on average 1.9767335766423357) internal successors, (25998), 13216 states have internal predecessors, (25998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions. [2022-03-03 18:27:17,194 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484 [2022-03-03 18:27:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:17,195 INFO L470 AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions. [2022-03-03 18:27:17,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions. [2022-03-03 18:27:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:17,198 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:17,198 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:17,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-03 18:27:17,198 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times [2022-03-03 18:27:17,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:17,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095767625] [2022-03-03 18:27:17,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:17,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:17,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095767625] [2022-03-03 18:27:17,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095767625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:17,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:17,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:17,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43381466] [2022-03-03 18:27:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:17,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:17,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:17,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:17,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:17,451 INFO L87 Difference]: Start difference. First operand 13217 states and 25998 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:18,517 INFO L93 Difference]: Finished difference Result 15001 states and 29501 transitions. [2022-03-03 18:27:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:18,535 INFO L225 Difference]: With dead ends: 15001 [2022-03-03 18:27:18,535 INFO L226 Difference]: Without dead ends: 15001 [2022-03-03 18:27:18,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:18,536 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 589 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:18,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2837 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15001 states. [2022-03-03 18:27:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216. [2022-03-03 18:27:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 13151 states have (on average 1.9767318074671127) internal successors, (25996), 13215 states have internal predecessors, (25996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions. [2022-03-03 18:27:18,699 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484 [2022-03-03 18:27:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:18,699 INFO L470 AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions. [2022-03-03 18:27:18,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions. [2022-03-03 18:27:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:18,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:18,703 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:18,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-03 18:27:18,703 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times [2022-03-03 18:27:18,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:18,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565039707] [2022-03-03 18:27:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:18,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:18,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565039707] [2022-03-03 18:27:18,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565039707] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:18,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:18,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:18,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408247318] [2022-03-03 18:27:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:18,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:18,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:18,948 INFO L87 Difference]: Start difference. First operand 13216 states and 25996 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:19,949 INFO L93 Difference]: Finished difference Result 15052 states and 29603 transitions. [2022-03-03 18:27:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:19,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:19,969 INFO L225 Difference]: With dead ends: 15052 [2022-03-03 18:27:19,970 INFO L226 Difference]: Without dead ends: 15052 [2022-03-03 18:27:19,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:27:19,970 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 602 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:19,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 2695 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:27:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2022-03-03 18:27:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215. [2022-03-03 18:27:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13150 states have (on average 1.9767300380228137) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-03 18:27:20,141 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-03 18:27:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:20,141 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-03 18:27:20,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-03 18:27:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:20,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:20,145 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:20,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-03 18:27:20,145 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times [2022-03-03 18:27:20,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:20,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059059095] [2022-03-03 18:27:20,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:20,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:20,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059059095] [2022-03-03 18:27:20,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059059095] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:20,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:20,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:20,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207868944] [2022-03-03 18:27:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:20,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:20,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:20,404 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:21,749 INFO L93 Difference]: Finished difference Result 15095 states and 29689 transitions. [2022-03-03 18:27:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:21,769 INFO L225 Difference]: With dead ends: 15095 [2022-03-03 18:27:21,769 INFO L226 Difference]: Without dead ends: 15095 [2022-03-03 18:27:21,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:27:21,769 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 623 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:21,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 3466 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2022-03-03 18:27:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214. [2022-03-03 18:27:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:21,992 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:21,992 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:21,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:21,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:21,996 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:21,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-03 18:27:21,996 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times [2022-03-03 18:27:21,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:21,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485745540] [2022-03-03 18:27:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:22,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:22,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485745540] [2022-03-03 18:27:22,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485745540] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:22,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:22,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:22,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709704498] [2022-03-03 18:27:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:22,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:22,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:22,216 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:23,844 INFO L93 Difference]: Finished difference Result 25238 states and 49975 transitions. [2022-03-03 18:27:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-03 18:27:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:23,885 INFO L225 Difference]: With dead ends: 25238 [2022-03-03 18:27:23,885 INFO L226 Difference]: Without dead ends: 25238 [2022-03-03 18:27:23,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:27:23,886 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1188 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:23,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 5500 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:27:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25238 states. [2022-03-03 18:27:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987. [2022-03-03 18:27:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12923 states have (on average 1.976166524800743) internal successors, (25538), 12986 states have internal predecessors, (25538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions. [2022-03-03 18:27:24,115 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484 [2022-03-03 18:27:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:24,116 INFO L470 AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions. [2022-03-03 18:27:24,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions. [2022-03-03 18:27:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:24,119 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:24,120 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:24,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-03 18:27:24,120 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times [2022-03-03 18:27:24,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:24,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17513718] [2022-03-03 18:27:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:24,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:24,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17513718] [2022-03-03 18:27:24,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17513718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:24,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:24,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:24,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052521272] [2022-03-03 18:27:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:24,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:24,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:24,385 INFO L87 Difference]: Start difference. First operand 12987 states and 25538 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:25,595 INFO L93 Difference]: Finished difference Result 24029 states and 47620 transitions. [2022-03-03 18:27:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:27:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:25,625 INFO L225 Difference]: With dead ends: 24029 [2022-03-03 18:27:25,625 INFO L226 Difference]: Without dead ends: 24029 [2022-03-03 18:27:25,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:27:25,625 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 1045 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:25,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 4040 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:27:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2022-03-03 18:27:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215. [2022-03-03 18:27:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13151 states have (on average 1.9765797277773554) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-03 18:27:25,831 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-03 18:27:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:25,831 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-03 18:27:25,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-03 18:27:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:25,834 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:25,834 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:25,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-03 18:27:25,835 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times [2022-03-03 18:27:25,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:25,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641769812] [2022-03-03 18:27:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:26,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:26,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641769812] [2022-03-03 18:27:26,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641769812] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:26,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:26,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:26,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605422856] [2022-03-03 18:27:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:26,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:26,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:26,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:26,093 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:26,799 INFO L93 Difference]: Finished difference Result 13519 states and 26600 transitions. [2022-03-03 18:27:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:27:26,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:26,816 INFO L225 Difference]: With dead ends: 13519 [2022-03-03 18:27:26,816 INFO L226 Difference]: Without dead ends: 13519 [2022-03-03 18:27:26,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-03 18:27:26,817 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 282 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:26,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 2734 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2022-03-03 18:27:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214. [2022-03-03 18:27:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:26,974 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:26,974 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:26,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:26,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:26,977 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:26,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-03 18:27:26,977 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times [2022-03-03 18:27:26,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:26,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287585794] [2022-03-03 18:27:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:27,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:27,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287585794] [2022-03-03 18:27:27,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287585794] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:27,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:27,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:27,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244538102] [2022-03-03 18:27:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:27,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:27,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:27,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:27,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:27,289 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:27,955 INFO L93 Difference]: Finished difference Result 13573 states and 26708 transitions. [2022-03-03 18:27:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:27:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:27,973 INFO L225 Difference]: With dead ends: 13573 [2022-03-03 18:27:27,973 INFO L226 Difference]: Without dead ends: 13573 [2022-03-03 18:27:27,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:27:27,973 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 300 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:27,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 2444 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2022-03-03 18:27:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214. [2022-03-03 18:27:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:28,130 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:28,131 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:28,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:28,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:28,134 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:28,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-03 18:27:28,134 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times [2022-03-03 18:27:28,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:28,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037814805] [2022-03-03 18:27:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:28,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:28,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037814805] [2022-03-03 18:27:28,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037814805] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:28,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:28,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:28,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542674615] [2022-03-03 18:27:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:28,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:28,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:28,412 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:29,455 INFO L93 Difference]: Finished difference Result 13621 states and 26804 transitions. [2022-03-03 18:27:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:29,473 INFO L225 Difference]: With dead ends: 13621 [2022-03-03 18:27:29,473 INFO L226 Difference]: Without dead ends: 13621 [2022-03-03 18:27:29,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:27:29,473 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:29,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3333 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13621 states. [2022-03-03 18:27:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214. [2022-03-03 18:27:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:29,634 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:29,634 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:29,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:29,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:29,638 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:29,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-03 18:27:29,638 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times [2022-03-03 18:27:29,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:29,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131105307] [2022-03-03 18:27:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:29,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:29,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131105307] [2022-03-03 18:27:29,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131105307] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:29,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:29,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:29,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508597468] [2022-03-03 18:27:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:29,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:29,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:29,876 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:30,591 INFO L93 Difference]: Finished difference Result 13675 states and 26912 transitions. [2022-03-03 18:27:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:30,609 INFO L225 Difference]: With dead ends: 13675 [2022-03-03 18:27:30,609 INFO L226 Difference]: Without dead ends: 13675 [2022-03-03 18:27:30,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:27:30,609 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 325 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:30,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 2522 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13675 states. [2022-03-03 18:27:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214. [2022-03-03 18:27:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:30,768 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:30,769 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:30,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:30,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:30,772 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:30,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-03 18:27:30,772 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times [2022-03-03 18:27:30,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:30,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35966796] [2022-03-03 18:27:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:30,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:30,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35966796] [2022-03-03 18:27:30,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35966796] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:30,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:30,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:30,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465065394] [2022-03-03 18:27:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:30,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:30,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:30,989 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:32,664 INFO L93 Difference]: Finished difference Result 23827 states and 47216 transitions. [2022-03-03 18:27:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:27:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:32,698 INFO L225 Difference]: With dead ends: 23827 [2022-03-03 18:27:32,699 INFO L226 Difference]: Without dead ends: 23827 [2022-03-03 18:27:32,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:27:32,699 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:32,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 5442 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23827 states. [2022-03-03 18:27:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971. [2022-03-03 18:27:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12907 states have (on average 1.9761369799333695) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:27:32,923 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:27:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:32,923 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:27:32,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:27:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:32,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:32,927 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:32,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-03 18:27:32,927 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times [2022-03-03 18:27:32,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:32,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675542924] [2022-03-03 18:27:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:33,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:33,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675542924] [2022-03-03 18:27:33,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675542924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:33,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:33,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:33,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163752664] [2022-03-03 18:27:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:33,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:33,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:33,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:33,154 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:34,446 INFO L93 Difference]: Finished difference Result 23624 states and 46810 transitions. [2022-03-03 18:27:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:34,481 INFO L225 Difference]: With dead ends: 23624 [2022-03-03 18:27:34,481 INFO L226 Difference]: Without dead ends: 23624 [2022-03-03 18:27:34,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:34,482 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:34,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 4411 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:27:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2022-03-03 18:27:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875. [2022-03-03 18:27:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 12812 states have (on average 1.9758039338120512) internal successors, (25314), 12874 states have internal predecessors, (25314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions. [2022-03-03 18:27:34,697 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484 [2022-03-03 18:27:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:34,698 INFO L470 AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions. [2022-03-03 18:27:34,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions. [2022-03-03 18:27:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:34,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:34,701 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:34,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-03 18:27:34,701 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times [2022-03-03 18:27:34,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:34,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823285564] [2022-03-03 18:27:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:34,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:34,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823285564] [2022-03-03 18:27:34,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823285564] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:34,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:34,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:34,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543564202] [2022-03-03 18:27:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:34,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:34,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:34,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:34,918 INFO L87 Difference]: Start difference. First operand 12875 states and 25314 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:36,506 INFO L93 Difference]: Finished difference Result 23548 states and 46658 transitions. [2022-03-03 18:27:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:27:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-03 18:27:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:36,539 INFO L225 Difference]: With dead ends: 23548 [2022-03-03 18:27:36,539 INFO L226 Difference]: Without dead ends: 23548 [2022-03-03 18:27:36,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-03 18:27:36,540 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 776 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:36,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5079 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:27:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2022-03-03 18:27:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618. [2022-03-03 18:27:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12555 states have (on average 1.9753086419753085) internal successors, (24800), 12617 states have internal predecessors, (24800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions. [2022-03-03 18:27:36,761 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484 [2022-03-03 18:27:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:36,761 INFO L470 AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions. [2022-03-03 18:27:36,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions. [2022-03-03 18:27:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-03 18:27:36,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:36,764 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:36,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-03 18:27:36,765 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times [2022-03-03 18:27:36,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:36,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087836228] [2022-03-03 18:27:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:36,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:36,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087836228] [2022-03-03 18:27:36,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087836228] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:36,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:36,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:36,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331875831] [2022-03-03 18:27:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:36,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:36,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:36,941 INFO L87 Difference]: Start difference. First operand 12618 states and 24800 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:37,316 INFO L93 Difference]: Finished difference Result 13358 states and 26280 transitions. [2022-03-03 18:27:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-03-03 18:27:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:37,333 INFO L225 Difference]: With dead ends: 13358 [2022-03-03 18:27:37,333 INFO L226 Difference]: Without dead ends: 13358 [2022-03-03 18:27:37,333 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-03 18:27:37,333 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 250 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:37,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 958 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:27:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2022-03-03 18:27:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928. [2022-03-03 18:27:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12928 states, 12866 states have (on average 1.9757500388621172) internal successors, (25420), 12927 states have internal predecessors, (25420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions. [2022-03-03 18:27:37,489 INFO L78 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488 [2022-03-03 18:27:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:37,490 INFO L470 AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions. [2022-03-03 18:27:37,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions. [2022-03-03 18:27:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-03 18:27:37,493 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:37,493 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:37,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-03 18:27:37,493 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times [2022-03-03 18:27:37,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:37,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242829454] [2022-03-03 18:27:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:37,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:37,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242829454] [2022-03-03 18:27:37,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242829454] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:37,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:37,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:37,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419062548] [2022-03-03 18:27:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:37,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:37,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:37,668 INFO L87 Difference]: Start difference. First operand 12928 states and 25420 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:38,238 INFO L93 Difference]: Finished difference Result 13909 states and 27382 transitions. [2022-03-03 18:27:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-03-03 18:27:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:38,256 INFO L225 Difference]: With dead ends: 13909 [2022-03-03 18:27:38,256 INFO L226 Difference]: Without dead ends: 13909 [2022-03-03 18:27:38,256 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-03 18:27:38,256 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 317 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:38,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1271 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:27:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-03-03 18:27:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339. [2022-03-03 18:27:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13339 states, 13280 states have (on average 1.97605421686747) internal successors, (26242), 13338 states have internal predecessors, (26242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions. [2022-03-03 18:27:38,469 INFO L78 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488 [2022-03-03 18:27:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:38,470 INFO L470 AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions. [2022-03-03 18:27:38,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions. [2022-03-03 18:27:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:27:38,473 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:38,473 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 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-03 18:27:38,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-03 18:27:38,473 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times [2022-03-03 18:27:38,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:38,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954186326] [2022-03-03 18:27:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1294 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-03-03 18:27:39,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:39,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954186326] [2022-03-03 18:27:39,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954186326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:39,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654589113] [2022-03-03 18:27:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:39,569 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-03 18:27:39,570 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-03 18:27:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:41,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-03 18:27:41,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:42,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-03 18:27:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:42,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:27:42,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654589113] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:42,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:27:42,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2022-03-03 18:27:42,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242804719] [2022-03-03 18:27:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:42,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 18:27:42,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 18:27:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:27:42,404 INFO L87 Difference]: Start difference. First operand 13339 states and 26242 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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-03 18:27:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:42,517 INFO L93 Difference]: Finished difference Result 23576 states and 46647 transitions. [2022-03-03 18:27:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 18:27:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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 494 [2022-03-03 18:27:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:42,555 INFO L225 Difference]: With dead ends: 23576 [2022-03-03 18:27:42,555 INFO L226 Difference]: Without dead ends: 23576 [2022-03-03 18:27:42,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:27:42,556 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 445 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:42,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 867 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:27:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23576 states. [2022-03-03 18:27:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23576 to 13477. [2022-03-03 18:27:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13477 states, 13416 states have (on average 1.9714519976147884) internal successors, (26449), 13476 states have internal predecessors, (26449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 26449 transitions. [2022-03-03 18:27:42,777 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 26449 transitions. Word has length 494 [2022-03-03 18:27:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:42,777 INFO L470 AbstractCegarLoop]: Abstraction has 13477 states and 26449 transitions. [2022-03-03 18:27:42,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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-03 18:27:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 26449 transitions. [2022-03-03 18:27:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:27:42,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:42,836 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 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-03 18:27:42,863 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-03 18:27:43,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:43,037 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times [2022-03-03 18:27:43,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:43,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416556566] [2022-03-03 18:27:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1342 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-03-03 18:27:44,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:44,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416556566] [2022-03-03 18:27:44,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416556566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:44,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428245853] [2022-03-03 18:27:44,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:27:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:44,128 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-03 18:27:44,129 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-03 18:27:46,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:27:46,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:27:46,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-03 18:27:46,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:46,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-03 18:27:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:46,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:27:46,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428245853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:46,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:27:46,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2022-03-03 18:27:46,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561729002] [2022-03-03 18:27:46,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:46,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-03 18:27:46,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-03 18:27:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:27:46,873 INFO L87 Difference]: Start difference. First operand 13477 states and 26449 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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-03 18:27:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:47,014 INFO L93 Difference]: Finished difference Result 24853 states and 49037 transitions. [2022-03-03 18:27:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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 494 [2022-03-03 18:27:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:47,054 INFO L225 Difference]: With dead ends: 24853 [2022-03-03 18:27:47,054 INFO L226 Difference]: Without dead ends: 24853 [2022-03-03 18:27:47,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:27:47,055 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 694 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:47,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 919 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:27:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24853 states. [2022-03-03 18:27:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24853 to 14168. [2022-03-03 18:27:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14168 states, 14103 states have (on average 1.9734808196837552) internal successors, (27832), 14167 states have internal predecessors, (27832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14168 states to 14168 states and 27832 transitions. [2022-03-03 18:27:47,295 INFO L78 Accepts]: Start accepts. Automaton has 14168 states and 27832 transitions. Word has length 494 [2022-03-03 18:27:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:47,295 INFO L470 AbstractCegarLoop]: Abstraction has 14168 states and 27832 transitions. [2022-03-03 18:27:47,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 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-03 18:27:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14168 states and 27832 transitions. [2022-03-03 18:27:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-03 18:27:47,297 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:47,297 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 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-03 18:27:47,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-03 18:27:47,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:47,498 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times [2022-03-03 18:27:47,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:47,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680833263] [2022-03-03 18:27:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:47,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:47,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680833263] [2022-03-03 18:27:47,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680833263] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:47,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:47,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:47,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47915677] [2022-03-03 18:27:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:47,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:47,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:47,822 INFO L87 Difference]: Start difference. First operand 14168 states and 27832 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:48,235 INFO L93 Difference]: Finished difference Result 14570 states and 28636 transitions. [2022-03-03 18:27:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-03-03 18:27:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:48,254 INFO L225 Difference]: With dead ends: 14570 [2022-03-03 18:27:48,254 INFO L226 Difference]: Without dead ends: 14570 [2022-03-03 18:27:48,254 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-03 18:27:48,255 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:48,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 908 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:27:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14570 states. [2022-03-03 18:27:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 14477. [2022-03-03 18:27:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14477 states, 14413 states have (on average 1.9739124401581905) internal successors, (28450), 14476 states have internal predecessors, (28450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14477 states to 14477 states and 28450 transitions. [2022-03-03 18:27:48,437 INFO L78 Accepts]: Start accepts. Automaton has 14477 states and 28450 transitions. Word has length 497 [2022-03-03 18:27:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:48,437 INFO L470 AbstractCegarLoop]: Abstraction has 14477 states and 28450 transitions. [2022-03-03 18:27:48,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14477 states and 28450 transitions. [2022-03-03 18:27:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-03 18:27:48,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:48,440 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 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-03 18:27:48,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-03-03 18:27:48,440 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times [2022-03-03 18:27:48,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:48,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402237460] [2022-03-03 18:27:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:48,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:48,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402237460] [2022-03-03 18:27:48,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402237460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:48,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:48,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:48,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799315268] [2022-03-03 18:27:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:48,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:48,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:48,635 INFO L87 Difference]: Start difference. First operand 14477 states and 28450 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:49,239 INFO L93 Difference]: Finished difference Result 15039 states and 29575 transitions. [2022-03-03 18:27:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-03-03 18:27:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:49,261 INFO L225 Difference]: With dead ends: 15039 [2022-03-03 18:27:49,261 INFO L226 Difference]: Without dead ends: 15039 [2022-03-03 18:27:49,261 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-03 18:27:49,261 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 313 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:49,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 1267 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15039 states. [2022-03-03 18:27:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15039 to 14910. [2022-03-03 18:27:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14910 states, 14847 states have (on average 1.9746076648481174) internal successors, (29317), 14909 states have internal predecessors, (29317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 29317 transitions. [2022-03-03 18:27:49,446 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 29317 transitions. Word has length 497 [2022-03-03 18:27:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:49,446 INFO L470 AbstractCegarLoop]: Abstraction has 14910 states and 29317 transitions. [2022-03-03 18:27:49,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 29317 transitions. [2022-03-03 18:27:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-03 18:27:49,448 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:49,449 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:27:49,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-03-03 18:27:49,449 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times [2022-03-03 18:27:49,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:49,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794026536] [2022-03-03 18:27:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:49,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:49,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794026536] [2022-03-03 18:27:49,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794026536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:49,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:49,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:49,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503130476] [2022-03-03 18:27:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:49,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:49,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:49,644 INFO L87 Difference]: Start difference. First operand 14910 states and 29317 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:50,130 INFO L93 Difference]: Finished difference Result 15314 states and 30125 transitions. [2022-03-03 18:27:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2022-03-03 18:27:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:50,150 INFO L225 Difference]: With dead ends: 15314 [2022-03-03 18:27:50,151 INFO L226 Difference]: Without dead ends: 15314 [2022-03-03 18:27:50,151 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-03 18:27:50,151 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 241 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:50,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 1207 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:27:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2022-03-03 18:27:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15218. [2022-03-03 18:27:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15218 states, 15156 states have (on average 1.974993401953022) internal successors, (29933), 15217 states have internal predecessors, (29933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 29933 transitions. [2022-03-03 18:27:50,412 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 29933 transitions. Word has length 505 [2022-03-03 18:27:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:50,413 INFO L470 AbstractCegarLoop]: Abstraction has 15218 states and 29933 transitions. [2022-03-03 18:27:50,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 29933 transitions. [2022-03-03 18:27:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-03 18:27:50,415 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:50,415 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:27:50,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-03 18:27:50,415 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times [2022-03-03 18:27:50,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:50,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407166659] [2022-03-03 18:27:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:50,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:50,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407166659] [2022-03-03 18:27:50,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407166659] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:50,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:50,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:50,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174233598] [2022-03-03 18:27:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:50,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:50,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:50,630 INFO L87 Difference]: Start difference. First operand 15218 states and 29933 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:51,105 INFO L93 Difference]: Finished difference Result 15782 states and 31062 transitions. [2022-03-03 18:27:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2022-03-03 18:27:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:51,145 INFO L225 Difference]: With dead ends: 15782 [2022-03-03 18:27:51,145 INFO L226 Difference]: Without dead ends: 15250 [2022-03-03 18:27:51,145 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-03 18:27:51,145 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 315 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:51,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 992 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:27:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15250 states. [2022-03-03 18:27:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15250 to 15125. [2022-03-03 18:27:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15125 states, 15064 states have (on average 1.9719861922464152) internal successors, (29706), 15124 states have internal predecessors, (29706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 29706 transitions. [2022-03-03 18:27:51,360 INFO L78 Accepts]: Start accepts. Automaton has 15125 states and 29706 transitions. Word has length 505 [2022-03-03 18:27:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:51,360 INFO L470 AbstractCegarLoop]: Abstraction has 15125 states and 29706 transitions. [2022-03-03 18:27:51,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15125 states and 29706 transitions. [2022-03-03 18:27:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-03-03 18:27:51,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:51,364 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:27:51,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-03 18:27:51,364 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times [2022-03-03 18:27:51,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:51,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500791639] [2022-03-03 18:27:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:51,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:51,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500791639] [2022-03-03 18:27:51,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500791639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:51,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:51,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:51,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048719068] [2022-03-03 18:27:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:51,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:51,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:51,595 INFO L87 Difference]: Start difference. First operand 15125 states and 29706 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:51,948 INFO L93 Difference]: Finished difference Result 15598 states and 30652 transitions. [2022-03-03 18:27:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 521 [2022-03-03 18:27:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:51,981 INFO L225 Difference]: With dead ends: 15598 [2022-03-03 18:27:51,981 INFO L226 Difference]: Without dead ends: 15598 [2022-03-03 18:27:51,982 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-03 18:27:51,982 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 248 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:51,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 755 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:27:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15598 states. [2022-03-03 18:27:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 15416. [2022-03-03 18:27:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15416 states, 15358 states have (on average 1.9721317879932283) internal successors, (30288), 15415 states have internal predecessors, (30288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 30288 transitions. [2022-03-03 18:27:52,193 INFO L78 Accepts]: Start accepts. Automaton has 15416 states and 30288 transitions. Word has length 521 [2022-03-03 18:27:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:52,193 INFO L470 AbstractCegarLoop]: Abstraction has 15416 states and 30288 transitions. [2022-03-03 18:27:52,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 15416 states and 30288 transitions. [2022-03-03 18:27:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-03-03 18:27:52,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:52,197 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:27:52,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-03 18:27:52,197 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times [2022-03-03 18:27:52,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:52,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405311285] [2022-03-03 18:27:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:52,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:52,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405311285] [2022-03-03 18:27:52,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405311285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:52,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:52,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:52,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078894288] [2022-03-03 18:27:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:52,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:52,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:52,435 INFO L87 Difference]: Start difference. First operand 15416 states and 30288 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:52,888 INFO L93 Difference]: Finished difference Result 17548 states and 34524 transitions. [2022-03-03 18:27:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 531 [2022-03-03 18:27:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:52,923 INFO L225 Difference]: With dead ends: 17548 [2022-03-03 18:27:52,924 INFO L226 Difference]: Without dead ends: 17197 [2022-03-03 18:27:52,924 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-03 18:27:52,924 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:52,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 876 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:27:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17197 states. [2022-03-03 18:27:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17197 to 15413. [2022-03-03 18:27:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15413 states, 15358 states have (on average 1.963992707383774) internal successors, (30163), 15412 states have internal predecessors, (30163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 30163 transitions. [2022-03-03 18:27:53,137 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 30163 transitions. Word has length 531 [2022-03-03 18:27:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:53,137 INFO L470 AbstractCegarLoop]: Abstraction has 15413 states and 30163 transitions. [2022-03-03 18:27:53,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 30163 transitions. [2022-03-03 18:27:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-03 18:27:53,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:53,142 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:27:53,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-03 18:27:53,143 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash -208741065, now seen corresponding path program 1 times [2022-03-03 18:27:53,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:53,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025785817] [2022-03-03 18:27:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:53,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:53,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025785817] [2022-03-03 18:27:53,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025785817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:27:53,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752180792] [2022-03-03 18:27:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:27:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:27:53,740 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-03 18:27:53,750 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-03 18:27:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:56,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-03 18:27:56,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:27:56,463 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 18:27:56,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-03-03 18:27:56,574 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:27:56,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:27:56,885 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:27:56,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:27:57,207 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:27:57,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:27:57,491 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:27:57,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:27:57,763 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 18:27:57,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 22 [2022-03-03 18:27:58,264 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-03 18:27:58,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-03-03 18:27:58,803 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-03 18:27:58,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-03-03 18:27:59,155 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-03 18:27:59,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-03-03 18:27:59,507 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-03 18:27:59,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-03-03 18:27:59,916 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-03 18:27:59,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-03-03 18:28:00,469 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:28:00,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 26 treesize of output 45 [2022-03-03 18:28:09,006 INFO L353 Elim1Store]: treesize reduction 38, result has 48.6 percent of original size [2022-03-03 18:28:09,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2022-03-03 18:28:11,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:11,592 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-03 18:28:11,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:28:11,773 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-03 18:28:11,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-03 18:28:12,504 INFO L353 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-03-03 18:28:12,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 50 [2022-03-03 18:28:12,696 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 42 treesize of output 40 [2022-03-03 18:28:12,747 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-03 18:28:12,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-03 18:28:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2022-03-03 18:28:12,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:28:12,853 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| 2 .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-03 18:28:12,905 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| 2 .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-03 18:28:13,372 INFO L353 Elim1Store]: treesize reduction 132, result has 22.8 percent of original size [2022-03-03 18:28:13,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 108 [2022-03-03 18:28:13,384 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 182 treesize of output 170 [2022-03-03 18:28:13,400 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-03 18:28:13,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 191 [2022-03-03 18:28:13,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 89 treesize of output 82 [2022-03-03 18:28:13,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 74 treesize of output 67 [2022-03-03 18:28:13,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-03-03 18:28:18,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:18,369 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-03 18:28:18,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2022-03-03 18:28:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-03-03 18:28:18,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752180792] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:28:18,405 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:28:18,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 37 [2022-03-03 18:28:18,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341757735] [2022-03-03 18:28:18,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:28:18,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-03 18:28:18,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:18,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-03 18:28:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1068, Unknown=10, NotChecked=138, Total=1406 [2022-03-03 18:28:18,407 INFO L87 Difference]: Start difference. First operand 15413 states and 30163 transitions. Second operand has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:20,113 INFO L93 Difference]: Finished difference Result 17784 states and 34899 transitions. [2022-03-03 18:28:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 18:28:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-03 18:28:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:20,139 INFO L225 Difference]: With dead ends: 17784 [2022-03-03 18:28:20,139 INFO L226 Difference]: Without dead ends: 17784 [2022-03-03 18:28:20,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1139 SyntacticMatches, 33 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=593, Invalid=3308, Unknown=13, NotChecked=246, Total=4160 [2022-03-03 18:28:20,140 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 2234 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3670 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:20,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2234 Valid, 7127 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1313 Invalid, 0 Unknown, 3670 Unchecked, 0.8s Time] [2022-03-03 18:28:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17784 states. [2022-03-03 18:28:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17784 to 17146. [2022-03-03 18:28:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17146 states, 17091 states have (on average 1.9676437891287812) internal successors, (33629), 17145 states have internal predecessors, (33629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 33629 transitions. [2022-03-03 18:28:20,399 INFO L78 Accepts]: Start accepts. Automaton has 17146 states and 33629 transitions. Word has length 589 [2022-03-03 18:28:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:20,400 INFO L470 AbstractCegarLoop]: Abstraction has 17146 states and 33629 transitions. [2022-03-03 18:28:20,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17146 states and 33629 transitions. [2022-03-03 18:28:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-03 18:28:20,405 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:20,405 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:28:20,438 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-03 18:28:20,606 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,SelfDestructingSolverStorable96 [2022-03-03 18:28:20,606 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash -208808955, now seen corresponding path program 2 times [2022-03-03 18:28:20,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:20,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026208952] [2022-03-03 18:28:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:21,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:21,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026208952] [2022-03-03 18:28:21,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026208952] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:21,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490932040] [2022-03-03 18:28:21,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:28:21,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:21,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:21,906 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-03 18:28:21,937 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-03 18:28:24,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:28:24,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:24,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-03 18:28:24,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:24,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:24,948 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-03 18:28:24,948 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 13 [2022-03-03 18:28:25,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:25,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:28:25,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,119 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:25,120 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 40 treesize of output 42 [2022-03-03 18:28:25,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,303 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:25,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-03 18:28:25,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:25,354 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:25,355 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 59 treesize of output 67 [2022-03-03 18:28:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-03 18:28:25,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:28:25,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490932040] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:25,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:28:25,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2022-03-03 18:28:25,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900899788] [2022-03-03 18:28:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:25,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:28:25,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:28:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-03 18:28:25,392 INFO L87 Difference]: Start difference. First operand 17146 states and 33629 transitions. Second operand has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:27,227 INFO L93 Difference]: Finished difference Result 46055 states and 91420 transitions. [2022-03-03 18:28:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:28:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-03 18:28:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:27,303 INFO L225 Difference]: With dead ends: 46055 [2022-03-03 18:28:27,303 INFO L226 Difference]: Without dead ends: 46055 [2022-03-03 18:28:27,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:28:27,304 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1128 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:27,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 2489 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:28:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2022-03-03 18:28:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 26239. [2022-03-03 18:28:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26239 states, 26184 states have (on average 2.0164604338527345) internal successors, (52799), 26238 states have internal predecessors, (52799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26239 states to 26239 states and 52799 transitions. [2022-03-03 18:28:27,832 INFO L78 Accepts]: Start accepts. Automaton has 26239 states and 52799 transitions. Word has length 589 [2022-03-03 18:28:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:27,833 INFO L470 AbstractCegarLoop]: Abstraction has 26239 states and 52799 transitions. [2022-03-03 18:28:27,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 26239 states and 52799 transitions. [2022-03-03 18:28:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-03 18:28:27,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:27,839 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:28:27,909 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-03 18:28:28,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:28,040 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -895811763, now seen corresponding path program 3 times [2022-03-03 18:28:28,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:28,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320052118] [2022-03-03 18:28:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:28,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:28,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320052118] [2022-03-03 18:28:28,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320052118] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:28,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149538752] [2022-03-03 18:28:28,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:28:28,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:28,931 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-03 18:28:28,954 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-03 18:28:31,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:28:31,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:31,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-03 18:28:31,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:31,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:32,021 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-03 18:28:32,021 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 13 [2022-03-03 18:28:32,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:28:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,349 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:32,349 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 35 treesize of output 37 [2022-03-03 18:28:32,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:32,367 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 40 treesize of output 42 [2022-03-03 18:28:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:32,408 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:32,408 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 52 treesize of output 57 [2022-03-03 18:28:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-03 18:28:32,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:28:32,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149538752] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:32,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:28:32,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-03 18:28:32,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316477753] [2022-03-03 18:28:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:32,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:32,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:28:32,441 INFO L87 Difference]: Start difference. First operand 26239 states and 52799 transitions. Second operand has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:33,741 INFO L93 Difference]: Finished difference Result 46138 states and 91586 transitions. [2022-03-03 18:28:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-03 18:28:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-03 18:28:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:33,815 INFO L225 Difference]: With dead ends: 46138 [2022-03-03 18:28:33,816 INFO L226 Difference]: Without dead ends: 46138 [2022-03-03 18:28:33,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:28:33,816 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 1094 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:33,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 1829 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:28:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46138 states. [2022-03-03 18:28:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46138 to 26263. [2022-03-03 18:28:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26263 states, 26208 states have (on average 2.0164453601953602) internal successors, (52847), 26262 states have internal predecessors, (52847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26263 states to 26263 states and 52847 transitions. [2022-03-03 18:28:34,405 INFO L78 Accepts]: Start accepts. Automaton has 26263 states and 52847 transitions. Word has length 589 [2022-03-03 18:28:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:34,405 INFO L470 AbstractCegarLoop]: Abstraction has 26263 states and 52847 transitions. [2022-03-03 18:28:34,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26263 states and 52847 transitions. [2022-03-03 18:28:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-03 18:28:34,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:34,411 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:28:34,439 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-03 18:28:34,612 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,SelfDestructingSolverStorable98 [2022-03-03 18:28:34,612 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -361079955, now seen corresponding path program 4 times [2022-03-03 18:28:34,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:34,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234597485] [2022-03-03 18:28:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:35,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:35,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234597485] [2022-03-03 18:28:35,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234597485] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:35,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225221717] [2022-03-03 18:28:35,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:28:35,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:35,270 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-03 18:28:35,271 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-03 18:28:38,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:28:38,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:38,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-03 18:28:38,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:39,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:28:39,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:28:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:39,734 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 35 treesize of output 37 [2022-03-03 18:28:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:39,774 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 40 treesize of output 42 [2022-03-03 18:28:39,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:28:39,812 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:28:39,812 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 52 treesize of output 57 [2022-03-03 18:28:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2022-03-03 18:28:39,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:28:41,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0))) is different from false [2022-03-03 18:28:43,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1 1))) 0))) is different from false [2022-03-03 18:28:45,703 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0))) is different from false [2022-03-03 18:28:46,493 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3)))))) is different from false [2022-03-03 18:28:46,545 INFO L353 Elim1Store]: treesize reduction 124, result has 23.5 percent of original size [2022-03-03 18:28:46,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-03-03 18:28:46,547 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 41 treesize of output 37 [2022-03-03 18:28:46,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 8 [2022-03-03 18:28:46,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,570 INFO L353 Elim1Store]: treesize reduction 40, result has 45.9 percent of original size [2022-03-03 18:28:46,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 62 [2022-03-03 18:28:46,573 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 41 treesize of output 37 [2022-03-03 18:28:46,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 18:28:46,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 8 [2022-03-03 18:28:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1855 trivial. 1 not checked. [2022-03-03 18:28:48,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225221717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:28:48,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:28:48,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 32 [2022-03-03 18:28:48,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198344106] [2022-03-03 18:28:48,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:28:48,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-03 18:28:48,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-03 18:28:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=620, Unknown=4, NotChecked=228, Total=1056 [2022-03-03 18:28:48,612 INFO L87 Difference]: Start difference. First operand 26263 states and 52847 transitions. Second operand has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:50,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))))) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-03 18:28:50,958 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0)) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-03 18:28:51,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3 1))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-03 18:28:52,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-03 18:28:56,701 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)))) is different from false [2022-03-03 18:28:57,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-03 18:28:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:58,170 INFO L93 Difference]: Finished difference Result 136660 states and 278972 transitions. [2022-03-03 18:28:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-03 18:28:58,170 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-03 18:28:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:58,436 INFO L225 Difference]: With dead ends: 136660 [2022-03-03 18:28:58,437 INFO L226 Difference]: Without dead ends: 136660 [2022-03-03 18:28:58,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=709, Invalid=2401, Unknown=10, NotChecked=1170, Total=4290 [2022-03-03 18:28:58,437 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 4008 mSDsluCounter, 6661 mSDsCounter, 0 mSdLazyCounter, 4649 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 7365 SdHoareTripleChecker+Invalid, 13837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 4649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8559 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:58,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 7365 Invalid, 13837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 4649 Invalid, 0 Unknown, 8559 Unchecked, 2.7s Time] [2022-03-03 18:28:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136660 states. [2022-03-03 18:29:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136660 to 64021. [2022-03-03 18:29:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64021 states, 63966 states have (on average 2.0758371634931057) internal successors, (132783), 64020 states have internal predecessors, (132783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64021 states to 64021 states and 132783 transitions. [2022-03-03 18:29:00,617 INFO L78 Accepts]: Start accepts. Automaton has 64021 states and 132783 transitions. Word has length 589 [2022-03-03 18:29:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:29:00,617 INFO L470 AbstractCegarLoop]: Abstraction has 64021 states and 132783 transitions. [2022-03-03 18:29:00,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:29:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 64021 states and 132783 transitions. [2022-03-03 18:29:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-03 18:29:00,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:29:00,709 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:29:00,741 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-03 18:29:00,909 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,SelfDestructingSolverStorable99 [2022-03-03 18:29:00,909 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:29:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:29:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -364683705, now seen corresponding path program 5 times [2022-03-03 18:29:00,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:29:00,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747729212] [2022-03-03 18:29:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:29:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:29:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:29:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:29:01,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:29:01,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747729212] [2022-03-03 18:29:01,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747729212] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:29:01,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073979412] [2022-03-03 18:29:01,917 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 18:29:01,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:29:01,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:29:01,924 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-03 18:29:01,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-03-03 18:38:23,846 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-03 18:38:23,846 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:38:24,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-03-03 18:38:25,054 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-03 18:38:25,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-03-03 18:38:25,101 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-03 18:38:25,101 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:38:25,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-03-03 18:38:25,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126240691] [2022-03-03 18:38:25,101 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-03 18:38:25,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-03 18:38:25,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:38:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-03 18:38:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:38:25,102 INFO L87 Difference]: Start difference. First operand 64021 states and 132783 transitions. Second operand has 13 states, 12 states have (on average 18.333333333333332) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:38:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 18:38:25,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-03 18:38:25,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:38:25,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:38:25,104 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-03 18:38:25,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-03-03 18:38:25,105 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-03 18:38:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-03 18:38:25,107 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-03 18:38:25,109 INFO L732 BasicCegarLoop]: Path program histogram: [28, 21, 15, 12, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:38:25,111 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:38:25,111 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:38:25,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:38:25 BasicIcfg [2022-03-03 18:38:25,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:38:25,113 INFO L158 Benchmark]: Toolchain (without parser) took 799333.24ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 125.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 353.9MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,113 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:38:25,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.12ms. Allocated memory is still 176.2MB. Free memory was 125.5MB in the beginning and 125.4MB in the end (delta: 67.9kB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.89ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 121.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,113 INFO L158 Benchmark]: Boogie Preprocessor took 65.83ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,113 INFO L158 Benchmark]: RCFGBuilder took 755.00ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 90.3MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,114 INFO L158 Benchmark]: TraceAbstraction took 797789.82ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 89.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 318.8MB. Max. memory is 8.0GB. [2022-03-03 18:38:25,114 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.13ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 628.12ms. Allocated memory is still 176.2MB. Free memory was 125.5MB in the beginning and 125.4MB in the end (delta: 67.9kB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.89ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 121.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.83ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 755.00ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 90.3MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 797789.82ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 89.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 318.8MB. 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: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 354 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 797.6s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.6s, AutomataDifference: 120.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71725 SdHoareTripleChecker+Valid, 91.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71725 mSDsluCounter, 314842 SdHoareTripleChecker+Invalid, 75.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12229 IncrementalHoareTripleChecker+Unchecked, 252999 mSDsCounter, 6015 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189617 IncrementalHoareTripleChecker+Invalid, 207861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6015 mSolverCounterUnsat, 62005 mSDtfsCounter, 189617 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8721 GetRequests, 6638 SyntacticMatches, 35 SemanticMatches, 2048 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12315 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64021occurred in iteration=100, InterpolantAutomatonStates: 1793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 100 MinimizatonAttempts, 488637 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 61.3s InterpolantComputationTime, 50757 NumberOfCodeBlocks, 48910 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 52441 ConstructedInterpolants, 844 QuantifiedInterpolants, 149015 SizeOfPredicates, 82 NumberOfNonLiveVariables, 9835 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 183612/190869 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