/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_17-arrayloop_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:53:36,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:53:36,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:53:36,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:53:36,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:53:36,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:53:36,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:53:36,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:53:36,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:53:36,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:53:36,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:53:36,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:53:36,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:53:36,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:53:36,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:53:36,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:53:36,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:53:36,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:53:36,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:53:36,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:53:36,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:53:36,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:53:36,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:53:36,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:53:36,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:53:36,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:53:36,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:53:36,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:53:36,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:53:36,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:53:36,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:53:36,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:53:36,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:53:36,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:53:36,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:53:36,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:53:36,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:53:36,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:53:36,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:53:36,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:53:36,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:53:36,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 16:53:36,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:53:36,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:53:36,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:53:36,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:53:36,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:53:36,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:53:36,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:53:36,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:53:36,814 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:53:36,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:53:36,815 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:53:36,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:53:36,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:53:36,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:53:36,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:53:36,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:53:36,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:53:36,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-01 16:53:37,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:53:37,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:53:37,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:53:37,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:53:37,025 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:53:37,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2022-03-01 16:53:37,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626ef992/90d12904ead24bb8af3bdb90a32900ef/FLAG1f53dfd64 [2022-03-01 16:53:37,531 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:53:37,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2022-03-01 16:53:37,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626ef992/90d12904ead24bb8af3bdb90a32900ef/FLAG1f53dfd64 [2022-03-01 16:53:38,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a626ef992/90d12904ead24bb8af3bdb90a32900ef [2022-03-01 16:53:38,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:53:38,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:53:38,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:53:38,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:53:38,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:53:38,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4795bde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38, skipping insertion in model container [2022-03-01 16:53:38,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:53:38,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:53:38,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:53:38,514 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:53:38,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:53:38,592 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:53:38,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38 WrapperNode [2022-03-01 16:53:38,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:53:38,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:53:38,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:53:38,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:53:38,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,664 INFO L137 Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2022-03-01 16:53:38,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:53:38,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:53:38,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:53:38,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:53:38,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:53:38,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:53:38,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:53:38,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:53:38,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (1/1) ... [2022-03-01 16:53:38,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:53:38,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:38,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 16:53:38,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 16:53:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:53:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-01 16:53:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:53:38,783 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:53:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 16:53:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:53:38,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:53:38,784 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:53:38,905 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:53:38,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:53:39,287 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:53:39,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:53:39,299 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:53:39,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:53:39 BoogieIcfgContainer [2022-03-01 16:53:39,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:53:39,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:53:39,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:53:39,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:53:39,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:53:38" (1/3) ... [2022-03-01 16:53:39,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aae2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:53:39, skipping insertion in model container [2022-03-01 16:53:39,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:53:38" (2/3) ... [2022-03-01 16:53:39,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aae2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:53:39, skipping insertion in model container [2022-03-01 16:53:39,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:53:39" (3/3) ... [2022-03-01 16:53:39,306 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2022-03-01 16:53:39,310 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:53:39,310 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:53:39,310 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-01 16:53:39,310 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:53:39,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,382 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,393 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,398 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-01 16:53:39,398 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-01 16:53:39,399 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-01 16:53:39,399 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-01 16:53:39,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,399 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-01 16:53:39,399 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-01 16:53:39,399 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-01 16:53:39,399 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-01 16:53:39,400 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-01 16:53:39,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,400 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-01 16:53:39,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,401 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-01 16:53:39,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,401 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-01 16:53:39,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 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-01 16:53:39,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 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-01 16:53:39,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 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-01 16:53:39,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,403 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-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 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-01 16:53:39,404 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-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 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-01 16:53:39,404 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-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 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-01 16:53:39,404 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-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 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-01 16:53:39,405 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-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 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-01 16:53:39,405 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-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,405 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-01 16:53:39,405 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-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,408 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-01 16:53:39,409 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-01 16:53:39,409 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-01 16:53:39,409 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-01 16:53:39,409 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-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 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-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,413 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-01 16:53:39,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 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-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 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-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,426 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-01 16:53:39,426 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-01 16:53:39,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,426 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-01 16:53:39,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,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-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,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-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 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-01 16:53:39,427 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-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,428 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-01 16:53:39,430 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-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,433 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-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:53:39,435 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:53:39,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:53:39,479 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 16:53:39,479 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-01 16:53:39,489 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow [2022-03-01 16:53:39,674 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-01 16:53:39,692 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-01 16:53:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-01 16:53:39,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:39,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:39,705 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-01 16:53:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times [2022-03-01 16:53:39,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:39,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335902530] [2022-03-01 16:53:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:39,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:39,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335902530] [2022-03-01 16:53:39,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335902530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:39,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:39,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:53:39,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531110898] [2022-03-01 16:53:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:39,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:53:39,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:53:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:40,038 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-01 16:53:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:40,661 INFO L93 Difference]: Finished difference Result 10027 states and 19985 transitions. [2022-03-01 16:53:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:53:40,666 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-01 16:53:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:40,716 INFO L225 Difference]: With dead ends: 10027 [2022-03-01 16:53:40,716 INFO L226 Difference]: Without dead ends: 10027 [2022-03-01 16:53:40,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:40,725 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 246 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:40,728 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.5s Time] [2022-03-01 16:53:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-03-01 16:53:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946. [2022-03-01 16:53:40,962 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-01 16:53:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions. [2022-03-01 16:53:41,032 INFO L78 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40 [2022-03-01 16:53:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:41,032 INFO L470 AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions. [2022-03-01 16:53:41,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions. [2022-03-01 16:53:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-01 16:53:41,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:41,039 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-01 16:53:41,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:53:41,040 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-01 16:53:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times [2022-03-01 16:53:41,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:41,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692711420] [2022-03-01 16:53:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:41,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:41,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692711420] [2022-03-01 16:53:41,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692711420] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:41,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:41,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:53:41,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75636217] [2022-03-01 16:53:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:41,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:53:41,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:41,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:53:41,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:41,173 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-01 16:53:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:41,636 INFO L93 Difference]: Finished difference Result 10347 states and 20626 transitions. [2022-03-01 16:53:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:53:41,636 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-01 16:53:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:41,678 INFO L225 Difference]: With dead ends: 10347 [2022-03-01 16:53:41,678 INFO L226 Difference]: Without dead ends: 10347 [2022-03-01 16:53:41,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:41,680 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:41,680 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.4s Time] [2022-03-01 16:53:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-01 16:53:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266. [2022-03-01 16:53:41,906 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-01 16:53:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions. [2022-03-01 16:53:41,928 INFO L78 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48 [2022-03-01 16:53:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:41,929 INFO L470 AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions. [2022-03-01 16:53:41,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions. [2022-03-01 16:53:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-01 16:53:41,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:41,930 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-01 16:53:41,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:53:41,931 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-01 16:53:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times [2022-03-01 16:53:41,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:41,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473525139] [2022-03-01 16:53:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:41,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:41,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473525139] [2022-03-01 16:53:41,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473525139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:41,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:41,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:53:41,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726364745] [2022-03-01 16:53:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:41,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:53:41,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:53:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:53:41,992 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-01 16:53:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:42,102 INFO L93 Difference]: Finished difference Result 19601 states and 39093 transitions. [2022-03-01 16:53:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:53:42,103 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-01 16:53:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:42,218 INFO L225 Difference]: With dead ends: 19601 [2022-03-01 16:53:42,219 INFO L226 Difference]: Without dead ends: 19601 [2022-03-01 16:53:42,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:53:42,221 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 226 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:42,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 552 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:53:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2022-03-01 16:53:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348. [2022-03-01 16:53:42,444 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-01 16:53:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions. [2022-03-01 16:53:42,465 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49 [2022-03-01 16:53:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:42,465 INFO L470 AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions. [2022-03-01 16:53:42,465 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-01 16:53:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions. [2022-03-01 16:53:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-01 16:53:42,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:42,466 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-01 16:53:42,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 16:53:42,467 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-01 16:53:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times [2022-03-01 16:53:42,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:42,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139482284] [2022-03-01 16:53:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:42,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:42,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139482284] [2022-03-01 16:53:42,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139482284] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:42,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:42,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:53:42,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985101371] [2022-03-01 16:53:42,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:42,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:53:42,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:53:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:42,600 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-01 16:53:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:42,783 INFO L93 Difference]: Finished difference Result 10347 states and 20627 transitions. [2022-03-01 16:53:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:53:42,783 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-01 16:53:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:42,803 INFO L225 Difference]: With dead ends: 10347 [2022-03-01 16:53:42,803 INFO L226 Difference]: Without dead ends: 10347 [2022-03-01 16:53:42,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:53:42,806 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:42,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 398 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:53:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-01 16:53:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347. [2022-03-01 16:53:43,020 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-01 16:53:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions. [2022-03-01 16:53:43,035 INFO L78 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59 [2022-03-01 16:53:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:43,036 INFO L470 AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions. [2022-03-01 16:53:43,036 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-01 16:53:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions. [2022-03-01 16:53:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-01 16:53:43,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:43,038 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-01 16:53:43,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 16:53:43,038 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-01 16:53:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times [2022-03-01 16:53:43,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:43,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281321624] [2022-03-01 16:53:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:43,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:43,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281321624] [2022-03-01 16:53:43,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281321624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:43,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754210871] [2022-03-01 16:53:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:43,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:43,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 16:53:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:43,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:53:43,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:43,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:43,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754210871] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:43,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:43,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:53:43,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317619918] [2022-03-01 16:53:43,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:43,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:53:43,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:53:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:53:43,609 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-01 16:53:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:43,864 INFO L93 Difference]: Finished difference Result 19642 states and 39134 transitions. [2022-03-01 16:53:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:53:43,865 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-01 16:53:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:43,914 INFO L225 Difference]: With dead ends: 19642 [2022-03-01 16:53:43,914 INFO L226 Difference]: Without dead ends: 19642 [2022-03-01 16:53:43,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:53:43,915 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 489 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:43,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1614 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:53:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2022-03-01 16:53:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429. [2022-03-01 16:53:44,130 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-01 16:53:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions. [2022-03-01 16:53:44,144 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90 [2022-03-01 16:53:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:44,145 INFO L470 AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions. [2022-03-01 16:53:44,145 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-01 16:53:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions. [2022-03-01 16:53:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-01 16:53:44,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:44,146 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-01 16:53:44,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-01 16:53:44,364 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-01 16:53:44,364 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-01 16:53:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times [2022-03-01 16:53:44,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:44,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573282685] [2022-03-01 16:53:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:44,474 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-01 16:53:44,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:44,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573282685] [2022-03-01 16:53:44,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573282685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:44,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293451376] [2022-03-01 16:53:44,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:53:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:44,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:44,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 16:53:44,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:53:44,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:44,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-01 16:53:44,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:44,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:53:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-01 16:53:44,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:53:44,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-01 16:53:44,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:44,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:53:44,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-01 16:53:44,955 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-01 16:53:44,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:53:44,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293451376] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:44,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:53:44,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-01 16:53:44,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507516827] [2022-03-01 16:53:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:44,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 16:53:44,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 16:53:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:53:44,957 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-01 16:53:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:45,715 INFO L93 Difference]: Finished difference Result 12090 states and 24032 transitions. [2022-03-01 16:53:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:53:45,716 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-01 16:53:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:45,748 INFO L225 Difference]: With dead ends: 12090 [2022-03-01 16:53:45,748 INFO L226 Difference]: Without dead ends: 12090 [2022-03-01 16:53:45,748 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-01 16:53:45,749 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:45,749 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.7s Time] [2022-03-01 16:53:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2022-03-01 16:53:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867. [2022-03-01 16:53:45,933 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-01 16:53:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions. [2022-03-01 16:53:45,955 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172 [2022-03-01 16:53:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:45,955 INFO L470 AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions. [2022-03-01 16:53:45,955 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-01 16:53:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions. [2022-03-01 16:53:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-01 16:53:45,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:45,957 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-01 16:53:45,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:46,175 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-01 16:53:46,175 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-01 16:53:46,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times [2022-03-01 16:53:46,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:46,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034261905] [2022-03-01 16:53:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:46,414 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-01 16:53:46,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:46,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034261905] [2022-03-01 16:53:46,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034261905] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:46,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303867429] [2022-03-01 16:53:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:46,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:46,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:46,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 16:53:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:46,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 16:53:46,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:46,911 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-01 16:53:46,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:47,217 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-01 16:53:47,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303867429] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:47,217 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:47,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 16:53:47,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828417487] [2022-03-01 16:53:47,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:47,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 16:53:47,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:47,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 16:53:47,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:53:47,219 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-01 16:53:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:47,495 INFO L93 Difference]: Finished difference Result 20585 states and 40856 transitions. [2022-03-01 16:53:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:53:47,495 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-01 16:53:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:47,530 INFO L225 Difference]: With dead ends: 20585 [2022-03-01 16:53:47,530 INFO L226 Difference]: Without dead ends: 20585 [2022-03-01 16:53:47,530 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-01 16:53:47,531 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 805 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:47,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2508 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:53:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2022-03-01 16:53:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031. [2022-03-01 16:53:47,754 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-01 16:53:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions. [2022-03-01 16:53:47,773 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180 [2022-03-01 16:53:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:47,774 INFO L470 AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions. [2022-03-01 16:53:47,774 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-01 16:53:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions. [2022-03-01 16:53:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-03-01 16:53:47,777 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:47,777 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-01 16:53:47,802 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-01 16:53:47,999 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-01 16:53:47,999 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-01 16:53:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times [2022-03-01 16:53:48,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:48,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721630662] [2022-03-01 16:53:48,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:48,261 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-01 16:53:48,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:48,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721630662] [2022-03-01 16:53:48,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721630662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:48,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181078492] [2022-03-01 16:53:48,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:53:48,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:48,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:48,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 16:53:48,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:53:48,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:48,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-01 16:53:48,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:48,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:53:48,909 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-01 16:53:48,910 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-01 16:53:48,948 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-01 16:53:48,948 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-01 16:53:49,000 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-01 16:53:49,001 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-01 16:53:49,026 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-01 16:53:49,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:53:49,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181078492] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:49,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:53:49,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-01 16:53:49,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284414954] [2022-03-01 16:53:49,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:49,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:53:49,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:53:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:49,028 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-01 16:53:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:49,581 INFO L93 Difference]: Finished difference Result 11586 states and 22859 transitions. [2022-03-01 16:53:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:53:49,582 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-01 16:53:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:49,602 INFO L225 Difference]: With dead ends: 11586 [2022-03-01 16:53:49,602 INFO L226 Difference]: Without dead ends: 11586 [2022-03-01 16:53:49,602 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-01 16:53:49,603 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:49,603 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.5s Time] [2022-03-01 16:53:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-03-01 16:53:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469. [2022-03-01 16:53:49,766 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-01 16:53:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions. [2022-03-01 16:53:49,786 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344 [2022-03-01 16:53:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:49,787 INFO L470 AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions. [2022-03-01 16:53:49,787 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-01 16:53:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions. [2022-03-01 16:53:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-03-01 16:53:49,791 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:49,791 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-01 16:53:49,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:50,008 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-01 16:53:50,008 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-01 16:53:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times [2022-03-01 16:53:50,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:50,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643706913] [2022-03-01 16:53:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:50,237 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-01 16:53:50,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:50,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643706913] [2022-03-01 16:53:50,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643706913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:50,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978701164] [2022-03-01 16:53:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:50,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:50,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 16:53:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:50,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 16:53:50,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:51,190 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-01 16:53:51,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:51,746 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-01 16:53:51,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978701164] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:51,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:51,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-01 16:53:51,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97354261] [2022-03-01 16:53:51,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:51,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:53:51,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:53:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:53:51,748 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-01 16:53:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:52,087 INFO L93 Difference]: Finished difference Result 21487 states and 42537 transitions. [2022-03-01 16:53:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:53:52,087 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-01 16:53:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:52,120 INFO L225 Difference]: With dead ends: 21487 [2022-03-01 16:53:52,121 INFO L226 Difference]: Without dead ends: 21487 [2022-03-01 16:53:52,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:53:52,123 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1141 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:52,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 3483 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:53:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2022-03-01 16:53:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592. [2022-03-01 16:53:52,321 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-01 16:53:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions. [2022-03-01 16:53:52,338 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353 [2022-03-01 16:53:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:52,339 INFO L470 AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions. [2022-03-01 16:53:52,339 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-01 16:53:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions. [2022-03-01 16:53:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:52,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:52,347 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-01 16:53:52,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-01 16:53:52,563 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-01 16:53:52,564 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-01 16:53:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times [2022-03-01 16:53:52,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:52,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824303819] [2022-03-01 16:53:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:52,913 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-01 16:53:52,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:52,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824303819] [2022-03-01 16:53:52,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824303819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:52,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:52,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:52,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461421793] [2022-03-01 16:53:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:52,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:52,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:52,914 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-01 16:53:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:53,783 INFO L93 Difference]: Finished difference Result 11725 states and 23014 transitions. [2022-03-01 16:53:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:53:53,795 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-01 16:53:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:53,811 INFO L225 Difference]: With dead ends: 11725 [2022-03-01 16:53:53,811 INFO L226 Difference]: Without dead ends: 11725 [2022-03-01 16:53:53,811 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-01 16:53:53,811 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:53,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:53:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2022-03-01 16:53:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609. [2022-03-01 16:53:53,955 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-01 16:53:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions. [2022-03-01 16:53:53,973 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476 [2022-03-01 16:53:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:53,974 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions. [2022-03-01 16:53:53,974 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-01 16:53:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions. [2022-03-01 16:53:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:53,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:53,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] [2022-03-01 16:53:53,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:53:53,978 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-01 16:53:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times [2022-03-01 16:53:53,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:53,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213541122] [2022-03-01 16:53:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:54,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-01 16:53:54,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:54,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213541122] [2022-03-01 16:53:54,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213541122] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:54,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:54,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:54,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371391783] [2022-03-01 16:53:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:54,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:54,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:54,358 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-01 16:53:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:55,454 INFO L93 Difference]: Finished difference Result 11752 states and 23068 transitions. [2022-03-01 16:53:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:53:55,455 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-01 16:53:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:55,469 INFO L225 Difference]: With dead ends: 11752 [2022-03-01 16:53:55,470 INFO L226 Difference]: Without dead ends: 11752 [2022-03-01 16:53:55,470 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-01 16:53:55,470 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:55,470 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.0s Time] [2022-03-01 16:53:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2022-03-01 16:53:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610. [2022-03-01 16:53:55,594 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-01 16:53:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions. [2022-03-01 16:53:55,612 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476 [2022-03-01 16:53:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:55,613 INFO L470 AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions. [2022-03-01 16:53:55,613 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-01 16:53:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions. [2022-03-01 16:53:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:55,615 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:55,616 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-01 16:53:55,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 16:53:55,616 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-01 16:53:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times [2022-03-01 16:53:55,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:55,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796730744] [2022-03-01 16:53:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:55,929 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-01 16:53:55,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:55,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796730744] [2022-03-01 16:53:55,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796730744] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:55,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:55,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:55,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620259563] [2022-03-01 16:53:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:55,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:55,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:55,931 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-01 16:53:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:57,317 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-01 16:53:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:53:57,318 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-01 16:53:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:57,333 INFO L225 Difference]: With dead ends: 11790 [2022-03-01 16:53:57,333 INFO L226 Difference]: Without dead ends: 11790 [2022-03-01 16:53:57,333 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-01 16:53:57,333 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 590 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:57,334 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.2s Time] [2022-03-01 16:53:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-01 16:53:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633. [2022-03-01 16:53:57,452 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-01 16:53:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions. [2022-03-01 16:53:57,468 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476 [2022-03-01 16:53:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:57,469 INFO L470 AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions. [2022-03-01 16:53:57,469 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-01 16:53:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions. [2022-03-01 16:53:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:57,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:57,472 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-01 16:53:57,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 16:53:57,472 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-01 16:53:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times [2022-03-01 16:53:57,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:57,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474850542] [2022-03-01 16:53:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:57,792 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-01 16:53:57,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:57,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474850542] [2022-03-01 16:53:57,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474850542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:57,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:57,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:57,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497434510] [2022-03-01 16:53:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:57,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:57,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:57,793 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-01 16:53:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:58,789 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-01 16:53:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:53:58,790 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-01 16:53:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:58,808 INFO L225 Difference]: With dead ends: 11790 [2022-03-01 16:53:58,808 INFO L226 Difference]: Without dead ends: 11790 [2022-03-01 16:53:58,809 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-01 16:53:58,810 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-01 16:53:58,811 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-01 16:53:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-01 16:53:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635. [2022-03-01 16:53:58,968 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-01 16:53:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions. [2022-03-01 16:53:58,987 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476 [2022-03-01 16:53:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:58,988 INFO L470 AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions. [2022-03-01 16:53:58,988 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-01 16:53:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions. [2022-03-01 16:53:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:58,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:58,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-01 16:53:58,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 16:53:58,995 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-01 16:53:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times [2022-03-01 16:53:58,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:58,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536311820] [2022-03-01 16:53:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:59,262 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-01 16:53:59,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:59,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536311820] [2022-03-01 16:53:59,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536311820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:59,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:59,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:59,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235394711] [2022-03-01 16:53:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:59,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:59,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:59,263 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-01 16:54:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:00,536 INFO L93 Difference]: Finished difference Result 11854 states and 23272 transitions. [2022-03-01 16:54:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:00,536 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-01 16:54:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:00,553 INFO L225 Difference]: With dead ends: 11854 [2022-03-01 16:54:00,553 INFO L226 Difference]: Without dead ends: 11854 [2022-03-01 16:54:00,554 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-01 16:54:00,554 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-01 16:54:00,554 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-01 16:54:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2022-03-01 16:54:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634. [2022-03-01 16:54:00,704 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-01 16:54:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions. [2022-03-01 16:54:00,725 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476 [2022-03-01 16:54:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:00,725 INFO L470 AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions. [2022-03-01 16:54:00,725 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-01 16:54:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions. [2022-03-01 16:54:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:00,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:00,730 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-01 16:54:00,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 16:54:00,730 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-01 16:54:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times [2022-03-01 16:54:00,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:00,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278551492] [2022-03-01 16:54:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:01,022 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-01 16:54:01,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:01,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278551492] [2022-03-01 16:54:01,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278551492] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:01,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:01,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:01,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725586849] [2022-03-01 16:54:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:01,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:01,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:01,024 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-01 16:54:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:02,109 INFO L93 Difference]: Finished difference Result 11855 states and 23274 transitions. [2022-03-01 16:54:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:02,109 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-01 16:54:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:02,126 INFO L225 Difference]: With dead ends: 11855 [2022-03-01 16:54:02,126 INFO L226 Difference]: Without dead ends: 11855 [2022-03-01 16:54:02,127 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-01 16:54:02,127 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-01 16:54:02,127 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-01 16:54:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2022-03-01 16:54:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657. [2022-03-01 16:54:02,279 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-01 16:54:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions. [2022-03-01 16:54:02,299 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476 [2022-03-01 16:54:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:02,299 INFO L470 AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions. [2022-03-01 16:54:02,299 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-01 16:54:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions. [2022-03-01 16:54:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:02,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:02,303 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-01 16:54:02,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 16:54:02,303 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-01 16:54:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times [2022-03-01 16:54:02,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:02,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986841360] [2022-03-01 16:54:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:02,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-01 16:54:02,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:02,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986841360] [2022-03-01 16:54:02,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986841360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:02,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:02,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:02,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544949022] [2022-03-01 16:54:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:02,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:02,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:02,610 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-01 16:54:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:03,710 INFO L93 Difference]: Finished difference Result 11923 states and 23410 transitions. [2022-03-01 16:54:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:54:03,710 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-01 16:54:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:03,725 INFO L225 Difference]: With dead ends: 11923 [2022-03-01 16:54:03,726 INFO L226 Difference]: Without dead ends: 11923 [2022-03-01 16:54:03,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-03-01 16:54:03,726 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.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:03,727 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.8s Time] [2022-03-01 16:54:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-03-01 16:54:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681. [2022-03-01 16:54:03,846 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-01 16:54:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions. [2022-03-01 16:54:03,862 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476 [2022-03-01 16:54:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:03,862 INFO L470 AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions. [2022-03-01 16:54:03,862 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-01 16:54:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions. [2022-03-01 16:54:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:03,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:03,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] [2022-03-01 16:54:03,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 16:54:03,866 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-01 16:54:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times [2022-03-01 16:54:03,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:03,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204237948] [2022-03-01 16:54:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:04,173 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-01 16:54:04,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:04,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204237948] [2022-03-01 16:54:04,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204237948] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:04,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:04,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:04,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242684948] [2022-03-01 16:54:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:04,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:04,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:04,175 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-01 16:54:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:05,340 INFO L93 Difference]: Finished difference Result 12163 states and 23890 transitions. [2022-03-01 16:54:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:54:05,359 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-01 16:54:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:05,385 INFO L225 Difference]: With dead ends: 12163 [2022-03-01 16:54:05,385 INFO L226 Difference]: Without dead ends: 12163 [2022-03-01 16:54:05,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:54:05,386 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1055 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:05,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3332 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2022-03-01 16:54:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685. [2022-03-01 16:54:05,510 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-01 16:54:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions. [2022-03-01 16:54:05,525 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476 [2022-03-01 16:54:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:05,526 INFO L470 AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions. [2022-03-01 16:54:05,526 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-01 16:54:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions. [2022-03-01 16:54:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:05,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:05,529 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-01 16:54:05,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 16:54:05,529 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-01 16:54:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times [2022-03-01 16:54:05,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:05,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942652927] [2022-03-01 16:54:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:05,765 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-01 16:54:05,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:05,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942652927] [2022-03-01 16:54:05,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942652927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:05,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:05,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:05,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705191688] [2022-03-01 16:54:05,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:05,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:05,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:05,767 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-01 16:54:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:07,092 INFO L93 Difference]: Finished difference Result 21888 states and 43344 transitions. [2022-03-01 16:54:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:54:07,098 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-01 16:54:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:07,137 INFO L225 Difference]: With dead ends: 21888 [2022-03-01 16:54:07,137 INFO L226 Difference]: Without dead ends: 21888 [2022-03-01 16:54:07,137 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-01 16:54:07,138 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1716 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:07,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1716 Valid, 4143 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-03-01 16:54:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752. [2022-03-01 16:54:07,314 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-01 16:54:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions. [2022-03-01 16:54:07,331 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476 [2022-03-01 16:54:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:07,332 INFO L470 AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions. [2022-03-01 16:54:07,332 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-01 16:54:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions. [2022-03-01 16:54:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:07,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:07,335 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-01 16:54:07,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 16:54:07,335 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-01 16:54:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times [2022-03-01 16:54:07,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:07,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045397472] [2022-03-01 16:54:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:07,537 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-01 16:54:07,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:07,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045397472] [2022-03-01 16:54:07,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045397472] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:07,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:07,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:07,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377415886] [2022-03-01 16:54:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:07,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:07,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:07,540 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-01 16:54:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:08,996 INFO L93 Difference]: Finished difference Result 21740 states and 43045 transitions. [2022-03-01 16:54:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-01 16:54:08,997 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-01 16:54:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:09,026 INFO L225 Difference]: With dead ends: 21740 [2022-03-01 16:54:09,026 INFO L226 Difference]: Without dead ends: 21740 [2022-03-01 16:54:09,028 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-01 16:54:09,028 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:09,028 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.1s Time] [2022-03-01 16:54:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2022-03-01 16:54:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831. [2022-03-01 16:54:09,198 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-01 16:54:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions. [2022-03-01 16:54:09,214 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476 [2022-03-01 16:54:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:09,215 INFO L470 AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions. [2022-03-01 16:54:09,215 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-01 16:54:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions. [2022-03-01 16:54:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:09,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:09,218 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-01 16:54:09,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 16:54:09,218 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-01 16:54:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times [2022-03-01 16:54:09,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:09,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148547727] [2022-03-01 16:54:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:09,486 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-01 16:54:09,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:09,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148547727] [2022-03-01 16:54:09,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148547727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:09,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:09,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:09,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573411517] [2022-03-01 16:54:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:09,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:09,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:09,489 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-01 16:54:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:10,092 INFO L93 Difference]: Finished difference Result 12198 states and 23964 transitions. [2022-03-01 16:54:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:10,093 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-01 16:54:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:10,107 INFO L225 Difference]: With dead ends: 12198 [2022-03-01 16:54:10,108 INFO L226 Difference]: Without dead ends: 12198 [2022-03-01 16:54:10,108 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-01 16:54:10,110 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:10,110 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.5s Time] [2022-03-01 16:54:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-03-01 16:54:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856. [2022-03-01 16:54:10,271 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-01 16:54:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions. [2022-03-01 16:54:10,287 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476 [2022-03-01 16:54:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:10,288 INFO L470 AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions. [2022-03-01 16:54:10,288 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-01 16:54:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions. [2022-03-01 16:54:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:10,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:10,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-01 16:54:10,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 16:54:10,291 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-01 16:54:10,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times [2022-03-01 16:54:10,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:10,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356154964] [2022-03-01 16:54:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:10,532 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-01 16:54:10,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:10,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356154964] [2022-03-01 16:54:10,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356154964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:10,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:10,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:10,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932265333] [2022-03-01 16:54:10,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:10,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:10,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:10,534 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-01 16:54:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:11,374 INFO L93 Difference]: Finished difference Result 12278 states and 24124 transitions. [2022-03-01 16:54:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:11,374 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-01 16:54:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:11,390 INFO L225 Difference]: With dead ends: 12278 [2022-03-01 16:54:11,391 INFO L226 Difference]: Without dead ends: 12278 [2022-03-01 16:54:11,391 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-01 16:54:11,391 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-01 16:54:11,391 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-01 16:54:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2022-03-01 16:54:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864. [2022-03-01 16:54:11,520 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-01 16:54:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions. [2022-03-01 16:54:11,536 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476 [2022-03-01 16:54:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:11,537 INFO L470 AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions. [2022-03-01 16:54:11,537 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-01 16:54:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions. [2022-03-01 16:54:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:11,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:11,539 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-01 16:54:11,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-01 16:54:11,540 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-01 16:54:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times [2022-03-01 16:54:11,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:11,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218676273] [2022-03-01 16:54:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:11,773 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-01 16:54:11,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:11,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218676273] [2022-03-01 16:54:11,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218676273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:11,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:11,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:11,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510716013] [2022-03-01 16:54:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:11,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:11,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:11,774 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-01 16:54:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:12,592 INFO L93 Difference]: Finished difference Result 12342 states and 24252 transitions. [2022-03-01 16:54:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:12,592 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-01 16:54:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:12,608 INFO L225 Difference]: With dead ends: 12342 [2022-03-01 16:54:12,608 INFO L226 Difference]: Without dead ends: 12342 [2022-03-01 16:54:12,608 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-01 16:54:12,609 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-01 16:54:12,609 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-01 16:54:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-03-01 16:54:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872. [2022-03-01 16:54:12,727 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-01 16:54:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions. [2022-03-01 16:54:12,744 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476 [2022-03-01 16:54:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:12,744 INFO L470 AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions. [2022-03-01 16:54:12,744 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-01 16:54:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions. [2022-03-01 16:54:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:12,747 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:12,747 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-01 16:54:12,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-01 16:54:12,747 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-01 16:54:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times [2022-03-01 16:54:12,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:12,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091078957] [2022-03-01 16:54:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:12,984 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-01 16:54:12,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:12,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091078957] [2022-03-01 16:54:12,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091078957] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:12,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:12,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:12,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376455057] [2022-03-01 16:54:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:12,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:12,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:12,986 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-01 16:54:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:14,194 INFO L93 Difference]: Finished difference Result 22094 states and 43756 transitions. [2022-03-01 16:54:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:54:14,194 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-01 16:54:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:14,224 INFO L225 Difference]: With dead ends: 22094 [2022-03-01 16:54:14,224 INFO L226 Difference]: Without dead ends: 22094 [2022-03-01 16:54:14,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:54:14,225 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:14,225 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.0s Time] [2022-03-01 16:54:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-03-01 16:54:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904. [2022-03-01 16:54:14,398 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-01 16:54:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions. [2022-03-01 16:54:14,414 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476 [2022-03-01 16:54:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:14,415 INFO L470 AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions. [2022-03-01 16:54:14,415 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-01 16:54:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions. [2022-03-01 16:54:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:14,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:14,418 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-01 16:54:14,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-01 16:54:14,418 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-01 16:54:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times [2022-03-01 16:54:14,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:14,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581149605] [2022-03-01 16:54:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:14,678 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-01 16:54:14,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:14,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581149605] [2022-03-01 16:54:14,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581149605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:14,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:14,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:14,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076637007] [2022-03-01 16:54:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:14,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:14,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:14,679 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-01 16:54:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:15,998 INFO L93 Difference]: Finished difference Result 21883 states and 43334 transitions. [2022-03-01 16:54:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:54:15,999 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-01 16:54:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:16,027 INFO L225 Difference]: With dead ends: 21883 [2022-03-01 16:54:16,027 INFO L226 Difference]: Without dead ends: 21883 [2022-03-01 16:54:16,028 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-01 16:54:16,029 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 1085 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:16,029 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.1s Time] [2022-03-01 16:54:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2022-03-01 16:54:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847. [2022-03-01 16:54:16,211 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-01 16:54:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-01 16:54:16,230 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-01 16:54:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:16,230 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-01 16:54:16,231 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-01 16:54:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-01 16:54:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:16,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:16,235 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-01 16:54:16,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-01 16:54:16,235 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-01 16:54:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times [2022-03-01 16:54:16,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:16,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439030713] [2022-03-01 16:54:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:16,469 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-01 16:54:16,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:16,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439030713] [2022-03-01 16:54:16,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439030713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:16,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:16,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:16,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191588219] [2022-03-01 16:54:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:16,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:16,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:16,475 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-01 16:54:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:17,915 INFO L93 Difference]: Finished difference Result 22050 states and 43668 transitions. [2022-03-01 16:54:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:54:17,916 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-01 16:54:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:17,946 INFO L225 Difference]: With dead ends: 22050 [2022-03-01 16:54:17,946 INFO L226 Difference]: Without dead ends: 22050 [2022-03-01 16:54:17,947 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-01 16:54:17,947 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 913 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-01 16:54:17,947 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-01 16:54:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22050 states. [2022-03-01 16:54:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919. [2022-03-01 16:54:18,118 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-01 16:54:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-01 16:54:18,134 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-01 16:54:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:18,135 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-01 16:54:18,136 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-01 16:54:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-01 16:54:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:18,138 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:18,139 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-01 16:54:18,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-01 16:54:18,139 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-01 16:54:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times [2022-03-01 16:54:18,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:18,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143079667] [2022-03-01 16:54:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:18,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:18,368 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-01 16:54:18,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:18,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143079667] [2022-03-01 16:54:18,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143079667] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:18,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:18,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:18,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985923103] [2022-03-01 16:54:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:18,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:18,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:18,370 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-01 16:54:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:19,929 INFO L93 Difference]: Finished difference Result 21957 states and 43482 transitions. [2022-03-01 16:54:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:54:19,930 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-01 16:54:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:19,961 INFO L225 Difference]: With dead ends: 21957 [2022-03-01 16:54:19,961 INFO L226 Difference]: Without dead ends: 21957 [2022-03-01 16:54:19,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:54:19,962 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-01 16:54:19,962 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-01 16:54:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-03-01 16:54:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847. [2022-03-01 16:54:20,134 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-01 16:54:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-01 16:54:20,150 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-01 16:54:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:20,151 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-01 16:54:20,151 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-01 16:54:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-01 16:54:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:20,153 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:20,153 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-01 16:54:20,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-01 16:54:20,154 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-01 16:54:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times [2022-03-01 16:54:20,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:20,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138331510] [2022-03-01 16:54:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:20,381 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-01 16:54:20,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:20,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138331510] [2022-03-01 16:54:20,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138331510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:20,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:20,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:20,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779416509] [2022-03-01 16:54:20,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:20,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:20,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:20,383 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-01 16:54:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:21,420 INFO L93 Difference]: Finished difference Result 13605 states and 26712 transitions. [2022-03-01 16:54:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:21,420 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-01 16:54:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:21,440 INFO L225 Difference]: With dead ends: 13605 [2022-03-01 16:54:21,441 INFO L226 Difference]: Without dead ends: 13605 [2022-03-01 16:54:21,441 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-01 16:54:21,441 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-01 16:54:21,441 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-01 16:54:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2022-03-01 16:54:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867. [2022-03-01 16:54:21,698 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-01 16:54:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions. [2022-03-01 16:54:21,712 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476 [2022-03-01 16:54:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:21,712 INFO L470 AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions. [2022-03-01 16:54:21,712 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-01 16:54:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions. [2022-03-01 16:54:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:21,720 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:21,720 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-01 16:54:21,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-01 16:54:21,720 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-01 16:54:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times [2022-03-01 16:54:21,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:21,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84905375] [2022-03-01 16:54:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:21,981 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-01 16:54:21,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:21,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84905375] [2022-03-01 16:54:21,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84905375] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:21,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:21,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:21,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463865150] [2022-03-01 16:54:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:21,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:21,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:21,982 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-01 16:54:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:23,064 INFO L93 Difference]: Finished difference Result 13688 states and 26878 transitions. [2022-03-01 16:54:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:23,065 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-01 16:54:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:23,087 INFO L225 Difference]: With dead ends: 13688 [2022-03-01 16:54:23,087 INFO L226 Difference]: Without dead ends: 13688 [2022-03-01 16:54:23,087 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-01 16:54:23,088 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:23,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 3246 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2022-03-01 16:54:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875. [2022-03-01 16:54:23,240 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-01 16:54:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions. [2022-03-01 16:54:23,258 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476 [2022-03-01 16:54:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:23,258 INFO L470 AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions. [2022-03-01 16:54:23,258 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-01 16:54:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions. [2022-03-01 16:54:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:23,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:23,261 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-01 16:54:23,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-01 16:54:23,263 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-01 16:54:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times [2022-03-01 16:54:23,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:23,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598496273] [2022-03-01 16:54:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:23,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-01 16:54:23,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:23,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598496273] [2022-03-01 16:54:23,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598496273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:23,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:23,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:23,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949332469] [2022-03-01 16:54:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:23,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:23,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:23,526 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-01 16:54:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:24,507 INFO L93 Difference]: Finished difference Result 13858 states and 27218 transitions. [2022-03-01 16:54:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:24,507 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-01 16:54:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:24,527 INFO L225 Difference]: With dead ends: 13858 [2022-03-01 16:54:24,528 INFO L226 Difference]: Without dead ends: 13858 [2022-03-01 16:54:24,528 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-01 16:54:24,528 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 640 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:24,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 3277 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:54:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2022-03-01 16:54:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883. [2022-03-01 16:54:24,664 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-01 16:54:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:54:24,683 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:54:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:24,683 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:54:24,683 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-01 16:54:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:54:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:24,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:24,686 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-01 16:54:24,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-01 16:54:24,686 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-01 16:54:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times [2022-03-01 16:54:24,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:24,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177547232] [2022-03-01 16:54:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:24,972 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-01 16:54:24,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:24,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177547232] [2022-03-01 16:54:24,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177547232] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:24,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:24,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:24,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048410383] [2022-03-01 16:54:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:24,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:24,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:24,973 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-01 16:54:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:26,150 INFO L93 Difference]: Finished difference Result 13640 states and 26782 transitions. [2022-03-01 16:54:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:26,151 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-01 16:54:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:26,169 INFO L225 Difference]: With dead ends: 13640 [2022-03-01 16:54:26,169 INFO L226 Difference]: Without dead ends: 13640 [2022-03-01 16:54:26,169 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-01 16:54:26,170 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:26,170 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.0s Time] [2022-03-01 16:54:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2022-03-01 16:54:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884. [2022-03-01 16:54:26,303 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-01 16:54:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions. [2022-03-01 16:54:26,320 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476 [2022-03-01 16:54:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:26,320 INFO L470 AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions. [2022-03-01 16:54:26,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-01 16:54:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions. [2022-03-01 16:54:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:26,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:26,324 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-01 16:54:26,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-01 16:54:26,324 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-01 16:54:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times [2022-03-01 16:54:26,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:26,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946714202] [2022-03-01 16:54:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:26,582 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-01 16:54:26,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:26,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946714202] [2022-03-01 16:54:26,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946714202] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:26,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:26,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:26,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642099673] [2022-03-01 16:54:26,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:26,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:26,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:26,585 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-01 16:54:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:27,953 INFO L93 Difference]: Finished difference Result 13799 states and 27100 transitions. [2022-03-01 16:54:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:27,953 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-01 16:54:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:27,971 INFO L225 Difference]: With dead ends: 13799 [2022-03-01 16:54:27,971 INFO L226 Difference]: Without dead ends: 13799 [2022-03-01 16:54:27,971 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-01 16:54:27,971 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:27,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 3545 Invalid, 2778 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-03-01 16:54:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883. [2022-03-01 16:54:28,098 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-01 16:54:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:54:28,115 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:54:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:28,115 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:54:28,116 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-01 16:54:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:54:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:28,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:28,119 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-01 16:54:28,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-01 16:54:28,119 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-01 16:54:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times [2022-03-01 16:54:28,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:28,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175460572] [2022-03-01 16:54:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:28,393 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-01 16:54:28,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:28,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175460572] [2022-03-01 16:54:28,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175460572] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:28,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:28,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:28,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005420716] [2022-03-01 16:54:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:28,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:28,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:28,394 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-01 16:54:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:29,648 INFO L93 Difference]: Finished difference Result 13633 states and 26767 transitions. [2022-03-01 16:54:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:29,648 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-01 16:54:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:29,668 INFO L225 Difference]: With dead ends: 13633 [2022-03-01 16:54:29,668 INFO L226 Difference]: Without dead ends: 13633 [2022-03-01 16:54:29,668 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-01 16:54:29,669 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 749 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:29,669 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.1s Time] [2022-03-01 16:54:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2022-03-01 16:54:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883. [2022-03-01 16:54:29,802 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-01 16:54:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:54:29,819 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:54:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:29,819 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:54:29,820 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-01 16:54:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:54:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:29,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:29,823 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-01 16:54:29,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-01 16:54:29,823 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-01 16:54:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times [2022-03-01 16:54:29,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:29,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580155257] [2022-03-01 16:54:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:30,060 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-01 16:54:30,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:30,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580155257] [2022-03-01 16:54:30,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580155257] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:30,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:30,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:30,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003388722] [2022-03-01 16:54:30,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:30,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:30,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:30,062 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-01 16:54:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:30,889 INFO L93 Difference]: Finished difference Result 13686 states and 26874 transitions. [2022-03-01 16:54:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:30,889 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-01 16:54:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:30,907 INFO L225 Difference]: With dead ends: 13686 [2022-03-01 16:54:30,908 INFO L226 Difference]: Without dead ends: 13686 [2022-03-01 16:54:30,908 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-01 16:54:30,909 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-01 16:54:30,909 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-01 16:54:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-03-01 16:54:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889. [2022-03-01 16:54:31,047 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-01 16:54:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions. [2022-03-01 16:54:31,065 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476 [2022-03-01 16:54:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:31,065 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions. [2022-03-01 16:54:31,065 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-01 16:54:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions. [2022-03-01 16:54:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:31,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:31,068 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-01 16:54:31,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-01 16:54:31,068 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-01 16:54:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times [2022-03-01 16:54:31,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:31,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918958606] [2022-03-01 16:54:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:31,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-01 16:54:31,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:31,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918958606] [2022-03-01 16:54:31,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918958606] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:31,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:31,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:31,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910875200] [2022-03-01 16:54:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:31,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:31,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:31,289 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-01 16:54:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:31,885 INFO L93 Difference]: Finished difference Result 13769 states and 27040 transitions. [2022-03-01 16:54:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:31,885 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-01 16:54:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:31,906 INFO L225 Difference]: With dead ends: 13769 [2022-03-01 16:54:31,906 INFO L226 Difference]: Without dead ends: 13769 [2022-03-01 16:54:31,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:54:31,906 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 617 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:31,907 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.5s Time] [2022-03-01 16:54:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2022-03-01 16:54:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888. [2022-03-01 16:54:32,036 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-01 16:54:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions. [2022-03-01 16:54:32,052 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476 [2022-03-01 16:54:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:32,053 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions. [2022-03-01 16:54:32,053 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-01 16:54:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions. [2022-03-01 16:54:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:32,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:32,056 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-01 16:54:32,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-01 16:54:32,056 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-01 16:54:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times [2022-03-01 16:54:32,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:32,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188126558] [2022-03-01 16:54:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:32,255 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-01 16:54:32,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:32,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188126558] [2022-03-01 16:54:32,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188126558] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:32,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:32,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:32,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595350008] [2022-03-01 16:54:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:32,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:32,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:32,257 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-01 16:54:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:33,154 INFO L93 Difference]: Finished difference Result 13833 states and 27168 transitions. [2022-03-01 16:54:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:54:33,154 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-01 16:54:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:33,172 INFO L225 Difference]: With dead ends: 13833 [2022-03-01 16:54:33,172 INFO L226 Difference]: Without dead ends: 13833 [2022-03-01 16:54:33,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:54:33,173 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 630 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:33,173 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.7s Time] [2022-03-01 16:54:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-01 16:54:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887. [2022-03-01 16:54:33,304 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-01 16:54:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions. [2022-03-01 16:54:33,320 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476 [2022-03-01 16:54:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:33,320 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions. [2022-03-01 16:54:33,320 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-01 16:54:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions. [2022-03-01 16:54:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:33,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:33,323 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-01 16:54:33,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-01 16:54:33,324 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-01 16:54:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times [2022-03-01 16:54:33,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:33,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396636799] [2022-03-01 16:54:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:33,536 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-01 16:54:33,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:33,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396636799] [2022-03-01 16:54:33,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396636799] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:33,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:33,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:33,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806002763] [2022-03-01 16:54:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:33,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:33,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:33,538 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-01 16:54:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:34,924 INFO L93 Difference]: Finished difference Result 23633 states and 46768 transitions. [2022-03-01 16:54:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:54:34,925 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-01 16:54:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:34,958 INFO L225 Difference]: With dead ends: 23633 [2022-03-01 16:54:34,958 INFO L226 Difference]: Without dead ends: 23633 [2022-03-01 16:54:34,958 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-01 16:54:34,958 INFO L933 BasicCegarLoop]: 917 mSDtfsCounter, 1277 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:34,958 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.1s Time] [2022-03-01 16:54:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2022-03-01 16:54:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919. [2022-03-01 16:54:35,143 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-01 16:54:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-01 16:54:35,159 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-01 16:54:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:35,160 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-01 16:54:35,160 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-01 16:54:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-01 16:54:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:35,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:35,163 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-01 16:54:35,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-01 16:54:35,163 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-01 16:54:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times [2022-03-01 16:54:35,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:35,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572494357] [2022-03-01 16:54:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:35,387 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-01 16:54:35,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:35,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572494357] [2022-03-01 16:54:35,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572494357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:35,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:35,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:35,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292811226] [2022-03-01 16:54:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:35,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:35,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:35,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:35,388 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-01 16:54:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:37,492 INFO L93 Difference]: Finished difference Result 23388 states and 46278 transitions. [2022-03-01 16:54:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-01 16:54:37,492 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-01 16:54:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:37,524 INFO L225 Difference]: With dead ends: 23388 [2022-03-01 16:54:37,525 INFO L226 Difference]: Without dead ends: 23388 [2022-03-01 16:54:37,525 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-01 16:54:37,526 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-01 16:54:37,526 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-01 16:54:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2022-03-01 16:54:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863. [2022-03-01 16:54:37,713 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-01 16:54:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions. [2022-03-01 16:54:37,731 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476 [2022-03-01 16:54:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:37,731 INFO L470 AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions. [2022-03-01 16:54:37,731 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-01 16:54:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions. [2022-03-01 16:54:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:37,734 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:37,734 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-01 16:54:37,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-01 16:54:37,734 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-01 16:54:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times [2022-03-01 16:54:37,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:37,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983485853] [2022-03-01 16:54:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:37,958 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-01 16:54:37,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:37,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983485853] [2022-03-01 16:54:37,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983485853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:37,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:37,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:37,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416092766] [2022-03-01 16:54:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:37,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:37,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:37,960 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-01 16:54:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:38,902 INFO L93 Difference]: Finished difference Result 12207 states and 23984 transitions. [2022-03-01 16:54:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:38,903 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-01 16:54:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:38,918 INFO L225 Difference]: With dead ends: 12207 [2022-03-01 16:54:38,918 INFO L226 Difference]: Without dead ends: 12207 [2022-03-01 16:54:38,918 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-01 16:54:38,919 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:38,919 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.8s Time] [2022-03-01 16:54:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2022-03-01 16:54:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879. [2022-03-01 16:54:39,073 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-01 16:54:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions. [2022-03-01 16:54:39,090 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476 [2022-03-01 16:54:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:39,090 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions. [2022-03-01 16:54:39,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-01 16:54:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions. [2022-03-01 16:54:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:39,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:39,093 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-01 16:54:39,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-01 16:54:39,093 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-01 16:54:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times [2022-03-01 16:54:39,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:39,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482622906] [2022-03-01 16:54:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:39,313 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-01 16:54:39,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:39,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482622906] [2022-03-01 16:54:39,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482622906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:39,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:39,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:39,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705070987] [2022-03-01 16:54:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:39,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:39,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:39,314 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-01 16:54:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:40,086 INFO L93 Difference]: Finished difference Result 12290 states and 24150 transitions. [2022-03-01 16:54:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:40,087 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-01 16:54:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:40,105 INFO L225 Difference]: With dead ends: 12290 [2022-03-01 16:54:40,105 INFO L226 Difference]: Without dead ends: 12290 [2022-03-01 16:54:40,105 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-01 16:54:40,106 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-01 16:54:40,106 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-01 16:54:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2022-03-01 16:54:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887. [2022-03-01 16:54:40,243 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-01 16:54:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions. [2022-03-01 16:54:40,261 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476 [2022-03-01 16:54:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:40,261 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions. [2022-03-01 16:54:40,261 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-01 16:54:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions. [2022-03-01 16:54:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:40,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:40,264 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-01 16:54:40,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-01 16:54:40,264 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-01 16:54:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times [2022-03-01 16:54:40,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:40,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147296973] [2022-03-01 16:54:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:40,489 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-01 16:54:40,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:40,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147296973] [2022-03-01 16:54:40,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147296973] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:40,490 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:40,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:40,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241930864] [2022-03-01 16:54:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:40,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:40,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:40,490 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-01 16:54:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:41,103 INFO L93 Difference]: Finished difference Result 12354 states and 24278 transitions. [2022-03-01 16:54:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:41,103 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-01 16:54:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:41,124 INFO L225 Difference]: With dead ends: 12354 [2022-03-01 16:54:41,124 INFO L226 Difference]: Without dead ends: 12354 [2022-03-01 16:54:41,124 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-01 16:54:41,124 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 330 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:41,124 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.5s Time] [2022-03-01 16:54:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2022-03-01 16:54:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895. [2022-03-01 16:54:41,245 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-01 16:54:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions. [2022-03-01 16:54:41,261 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476 [2022-03-01 16:54:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:41,261 INFO L470 AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions. [2022-03-01 16:54:41,261 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-01 16:54:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions. [2022-03-01 16:54:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:41,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:41,264 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-01 16:54:41,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-01 16:54:41,264 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-01 16:54:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times [2022-03-01 16:54:41,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:41,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308583295] [2022-03-01 16:54:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:41,500 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-01 16:54:41,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:41,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308583295] [2022-03-01 16:54:41,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308583295] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:41,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:41,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:41,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582247586] [2022-03-01 16:54:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:41,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:41,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:41,503 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-01 16:54:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:43,126 INFO L93 Difference]: Finished difference Result 22106 states and 43782 transitions. [2022-03-01 16:54:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:54:43,126 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-01 16:54:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:43,160 INFO L225 Difference]: With dead ends: 22106 [2022-03-01 16:54:43,160 INFO L226 Difference]: Without dead ends: 22106 [2022-03-01 16:54:43,160 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-01 16:54:43,160 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-01 16:54:43,160 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-01 16:54:43,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22106 states. [2022-03-01 16:54:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927. [2022-03-01 16:54:43,350 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-01 16:54:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions. [2022-03-01 16:54:43,367 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476 [2022-03-01 16:54:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:43,367 INFO L470 AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions. [2022-03-01 16:54:43,367 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-01 16:54:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions. [2022-03-01 16:54:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:43,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:43,372 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-01 16:54:43,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-01 16:54:43,372 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-01 16:54:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times [2022-03-01 16:54:43,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:43,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452330532] [2022-03-01 16:54:43,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:43,605 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-01 16:54:43,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:43,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452330532] [2022-03-01 16:54:43,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452330532] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:43,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:43,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:43,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288558018] [2022-03-01 16:54:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:43,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:43,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:43,606 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-01 16:54:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:45,028 INFO L93 Difference]: Finished difference Result 21911 states and 43392 transitions. [2022-03-01 16:54:45,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:54:45,028 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-01 16:54:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:45,059 INFO L225 Difference]: With dead ends: 21911 [2022-03-01 16:54:45,059 INFO L226 Difference]: Without dead ends: 21911 [2022-03-01 16:54:45,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:54:45,060 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-01 16:54:45,064 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-01 16:54:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2022-03-01 16:54:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848. [2022-03-01 16:54:45,238 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-01 16:54:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions. [2022-03-01 16:54:45,255 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476 [2022-03-01 16:54:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:45,255 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions. [2022-03-01 16:54:45,255 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-01 16:54:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions. [2022-03-01 16:54:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:45,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:45,258 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-01 16:54:45,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-01 16:54:45,259 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-01 16:54:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times [2022-03-01 16:54:45,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:45,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727394510] [2022-03-01 16:54:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:45,505 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-01 16:54:45,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:45,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727394510] [2022-03-01 16:54:45,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727394510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:45,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:45,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:45,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400355008] [2022-03-01 16:54:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:45,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:45,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:45,507 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-01 16:54:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:46,863 INFO L93 Difference]: Finished difference Result 21819 states and 43200 transitions. [2022-03-01 16:54:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:46,863 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-01 16:54:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:46,894 INFO L225 Difference]: With dead ends: 21819 [2022-03-01 16:54:46,894 INFO L226 Difference]: Without dead ends: 21819 [2022-03-01 16:54:46,895 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-01 16:54:46,895 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:46,895 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.2s Time] [2022-03-01 16:54:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2022-03-01 16:54:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741. [2022-03-01 16:54:47,073 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-01 16:54:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions. [2022-03-01 16:54:47,090 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476 [2022-03-01 16:54:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:47,090 INFO L470 AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions. [2022-03-01 16:54:47,090 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-01 16:54:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions. [2022-03-01 16:54:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:47,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:47,093 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-01 16:54:47,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-01 16:54:47,093 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-01 16:54:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times [2022-03-01 16:54:47,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:47,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871886505] [2022-03-01 16:54:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:47,309 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-01 16:54:47,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:47,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871886505] [2022-03-01 16:54:47,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871886505] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:47,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:47,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:47,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622218797] [2022-03-01 16:54:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:47,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:47,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:47,310 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-01 16:54:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:49,181 INFO L93 Difference]: Finished difference Result 21742 states and 43046 transitions. [2022-03-01 16:54:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 16:54:49,182 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-01 16:54:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:49,212 INFO L225 Difference]: With dead ends: 21742 [2022-03-01 16:54:49,212 INFO L226 Difference]: Without dead ends: 21742 [2022-03-01 16:54:49,213 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-01 16:54:49,213 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-01 16:54:49,213 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-01 16:54:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2022-03-01 16:54:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608. [2022-03-01 16:54:49,385 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-01 16:54:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions. [2022-03-01 16:54:49,401 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476 [2022-03-01 16:54:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:49,401 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions. [2022-03-01 16:54:49,401 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-01 16:54:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions. [2022-03-01 16:54:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-01 16:54:49,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:49,406 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-01 16:54:49,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-01 16:54:49,406 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-01 16:54:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times [2022-03-01 16:54:49,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:49,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659934475] [2022-03-01 16:54:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:49,564 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-01 16:54:49,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:49,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659934475] [2022-03-01 16:54:49,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659934475] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:49,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:49,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:54:49,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068436939] [2022-03-01 16:54:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:49,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:54:49,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:54:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:49,566 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-01 16:54:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:50,009 INFO L93 Difference]: Finished difference Result 15459 states and 30482 transitions. [2022-03-01 16:54:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:54:50,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-01 16:54:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:50,032 INFO L225 Difference]: With dead ends: 15459 [2022-03-01 16:54:50,032 INFO L226 Difference]: Without dead ends: 15459 [2022-03-01 16:54:50,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:50,032 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:50,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 890 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:54:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2022-03-01 16:54:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246. [2022-03-01 16:54:50,237 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-01 16:54:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions. [2022-03-01 16:54:50,254 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477 [2022-03-01 16:54:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:50,254 INFO L470 AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions. [2022-03-01 16:54:50,254 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-01 16:54:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions. [2022-03-01 16:54:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-01 16:54:50,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:50,257 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-01 16:54:50,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-01 16:54:50,257 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-01 16:54:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times [2022-03-01 16:54:50,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:50,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800458903] [2022-03-01 16:54:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:50,476 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-01 16:54:50,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:50,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800458903] [2022-03-01 16:54:50,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800458903] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:50,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:50,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:54:50,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708870481] [2022-03-01 16:54:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:50,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:54:50,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:54:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:50,477 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-01 16:54:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:51,079 INFO L93 Difference]: Finished difference Result 14561 states and 28686 transitions. [2022-03-01 16:54:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:54:51,079 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-01 16:54:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:51,098 INFO L225 Difference]: With dead ends: 14561 [2022-03-01 16:54:51,099 INFO L226 Difference]: Without dead ends: 14561 [2022-03-01 16:54:51,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:51,103 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:51,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1214 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:54:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2022-03-01 16:54:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666. [2022-03-01 16:54:51,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-01 16:54:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions. [2022-03-01 16:54:51,268 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477 [2022-03-01 16:54:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:51,268 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions. [2022-03-01 16:54:51,268 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-01 16:54:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions. [2022-03-01 16:54:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:51,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:51,272 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-01 16:54:51,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-01 16:54:51,272 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-01 16:54:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times [2022-03-01 16:54:51,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:51,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734323287] [2022-03-01 16:54:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:51,509 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-01 16:54:51,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:51,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734323287] [2022-03-01 16:54:51,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734323287] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:51,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:51,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:51,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323644543] [2022-03-01 16:54:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:51,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:51,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:51,511 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-01 16:54:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:52,441 INFO L93 Difference]: Finished difference Result 12802 states and 25168 transitions. [2022-03-01 16:54:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:54:52,441 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-01 16:54:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:52,458 INFO L225 Difference]: With dead ends: 12802 [2022-03-01 16:54:52,458 INFO L226 Difference]: Without dead ends: 12802 [2022-03-01 16:54:52,458 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-01 16:54:52,460 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.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:52,460 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.8s Time] [2022-03-01 16:54:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-03-01 16:54:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683. [2022-03-01 16:54:52,594 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-01 16:54:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions. [2022-03-01 16:54:52,613 INFO L78 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484 [2022-03-01 16:54:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:52,613 INFO L470 AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions. [2022-03-01 16:54:52,613 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-01 16:54:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions. [2022-03-01 16:54:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:52,619 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:52,619 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-01 16:54:52,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-01 16:54:52,619 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-01 16:54:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times [2022-03-01 16:54:52,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:52,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513345340] [2022-03-01 16:54:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:52,889 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-01 16:54:52,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:52,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513345340] [2022-03-01 16:54:52,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513345340] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:52,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:52,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:52,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165578923] [2022-03-01 16:54:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:52,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:52,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:52,890 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-01 16:54:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:53,744 INFO L93 Difference]: Finished difference Result 12858 states and 25280 transitions. [2022-03-01 16:54:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:53,744 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-01 16:54:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:53,763 INFO L225 Difference]: With dead ends: 12858 [2022-03-01 16:54:53,764 INFO L226 Difference]: Without dead ends: 12858 [2022-03-01 16:54:53,764 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-01 16:54:53,764 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:53,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 3092 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-01 16:54:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703. [2022-03-01 16:54:53,918 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-01 16:54:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions. [2022-03-01 16:54:53,940 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484 [2022-03-01 16:54:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:53,940 INFO L470 AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions. [2022-03-01 16:54:53,940 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-01 16:54:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions. [2022-03-01 16:54:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:53,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:53,943 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-01 16:54:53,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-01 16:54:53,943 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-01 16:54:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times [2022-03-01 16:54:53,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:53,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232314342] [2022-03-01 16:54:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:54,163 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-01 16:54:54,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:54,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232314342] [2022-03-01 16:54:54,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232314342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:54,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:54,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:54,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615393641] [2022-03-01 16:54:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:54,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:54,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:54,165 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-01 16:54:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:55,173 INFO L93 Difference]: Finished difference Result 12891 states and 25346 transitions. [2022-03-01 16:54:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:55,173 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-01 16:54:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:55,190 INFO L225 Difference]: With dead ends: 12891 [2022-03-01 16:54:55,190 INFO L226 Difference]: Without dead ends: 12891 [2022-03-01 16:54:55,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:55,191 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 578 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:55,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 2818 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:54:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2022-03-01 16:54:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704. [2022-03-01 16:54:55,423 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-01 16:54:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions. [2022-03-01 16:54:55,442 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484 [2022-03-01 16:54:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:55,443 INFO L470 AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions. [2022-03-01 16:54:55,443 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-01 16:54:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions. [2022-03-01 16:54:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:55,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:55,446 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-01 16:54:55,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-01 16:54:55,446 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-01 16:54:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times [2022-03-01 16:54:55,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:55,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719659295] [2022-03-01 16:54:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:55,696 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-01 16:54:55,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:55,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719659295] [2022-03-01 16:54:55,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719659295] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:55,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:55,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:55,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154941140] [2022-03-01 16:54:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:55,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:55,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:55,698 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-01 16:54:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:57,037 INFO L93 Difference]: Finished difference Result 12912 states and 25388 transitions. [2022-03-01 16:54:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:57,037 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-01 16:54:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:57,054 INFO L225 Difference]: With dead ends: 12912 [2022-03-01 16:54:57,054 INFO L226 Difference]: Without dead ends: 12912 [2022-03-01 16:54:57,054 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-01 16:54:57,055 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 601 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-01 16:54:57,055 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-01 16:54:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-03-01 16:54:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723. [2022-03-01 16:54:57,199 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-01 16:54:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions. [2022-03-01 16:54:57,218 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484 [2022-03-01 16:54:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:57,219 INFO L470 AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions. [2022-03-01 16:54:57,219 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-01 16:54:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions. [2022-03-01 16:54:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:57,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:57,221 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-01 16:54:57,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-01 16:54:57,222 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-01 16:54:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times [2022-03-01 16:54:57,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:57,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990339886] [2022-03-01 16:54:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:57,437 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-01 16:54:57,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:57,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990339886] [2022-03-01 16:54:57,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990339886] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:57,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:57,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:57,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617798170] [2022-03-01 16:54:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:57,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:57,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:57,439 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-01 16:54:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:58,367 INFO L93 Difference]: Finished difference Result 12970 states and 25504 transitions. [2022-03-01 16:54:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:54:58,367 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-01 16:54:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:58,384 INFO L225 Difference]: With dead ends: 12970 [2022-03-01 16:54:58,384 INFO L226 Difference]: Without dead ends: 12970 [2022-03-01 16:54:58,384 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-01 16:54:58,385 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-01 16:54:58,385 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-01 16:54:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2022-03-01 16:54:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743. [2022-03-01 16:54:58,516 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-01 16:54:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions. [2022-03-01 16:54:58,535 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484 [2022-03-01 16:54:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:58,535 INFO L470 AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions. [2022-03-01 16:54:58,535 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-01 16:54:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions. [2022-03-01 16:54:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:58,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:58,538 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-01 16:54:58,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-01 16:54:58,538 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-01 16:54:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times [2022-03-01 16:54:58,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:58,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160875868] [2022-03-01 16:54:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:58,771 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-01 16:54:58,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:58,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160875868] [2022-03-01 16:54:58,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160875868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:58,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:58,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:58,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609965593] [2022-03-01 16:54:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:58,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:58,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:58,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:58,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:58,773 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-01 16:55:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:00,012 INFO L93 Difference]: Finished difference Result 13201 states and 25966 transitions. [2022-03-01 16:55:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:55:00,012 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-01 16:55:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:00,054 INFO L225 Difference]: With dead ends: 13201 [2022-03-01 16:55:00,054 INFO L226 Difference]: Without dead ends: 13201 [2022-03-01 16:55:00,054 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-01 16:55:00,055 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-01 16:55:00,056 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-01 16:55:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2022-03-01 16:55:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755. [2022-03-01 16:55:00,194 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-01 16:55:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions. [2022-03-01 16:55:00,213 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484 [2022-03-01 16:55:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:00,214 INFO L470 AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions. [2022-03-01 16:55:00,214 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-01 16:55:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions. [2022-03-01 16:55:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:00,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:00,218 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-01 16:55:00,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-01 16:55:00,218 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-01 16:55:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times [2022-03-01 16:55:00,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:00,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945646077] [2022-03-01 16:55:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:00,431 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-01 16:55:00,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:00,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945646077] [2022-03-01 16:55:00,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945646077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:00,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:00,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:00,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925105690] [2022-03-01 16:55:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:00,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:00,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:00,432 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-01 16:55:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:01,681 INFO L93 Difference]: Finished difference Result 23707 states and 46979 transitions. [2022-03-01 16:55:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:55:01,681 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-01 16:55:01,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:01,715 INFO L225 Difference]: With dead ends: 23707 [2022-03-01 16:55:01,715 INFO L226 Difference]: Without dead ends: 23707 [2022-03-01 16:55:01,716 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-01 16:55:01,716 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 1339 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:01,716 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.0s Time] [2022-03-01 16:55:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2022-03-01 16:55:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962. [2022-03-01 16:55:01,913 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-01 16:55:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions. [2022-03-01 16:55:01,932 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484 [2022-03-01 16:55:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:01,933 INFO L470 AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions. [2022-03-01 16:55:01,933 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-01 16:55:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions. [2022-03-01 16:55:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:01,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:01,936 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-01 16:55:01,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-01 16:55:01,936 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-01 16:55:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times [2022-03-01 16:55:01,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:01,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241561604] [2022-03-01 16:55:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:02,170 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-01 16:55:02,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:02,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241561604] [2022-03-01 16:55:02,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241561604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:02,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:02,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:02,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965124897] [2022-03-01 16:55:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:02,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:02,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:02,171 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-01 16:55:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:03,495 INFO L93 Difference]: Finished difference Result 23598 states and 46761 transitions. [2022-03-01 16:55:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:55:03,495 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-01 16:55:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:03,529 INFO L225 Difference]: With dead ends: 23598 [2022-03-01 16:55:03,530 INFO L226 Difference]: Without dead ends: 23598 [2022-03-01 16:55:03,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:55:03,530 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1413 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:03,530 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.0s Time] [2022-03-01 16:55:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2022-03-01 16:55:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954. [2022-03-01 16:55:03,728 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-01 16:55:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions. [2022-03-01 16:55:03,747 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484 [2022-03-01 16:55:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:03,747 INFO L470 AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions. [2022-03-01 16:55:03,747 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-01 16:55:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions. [2022-03-01 16:55:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:03,750 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:03,750 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-01 16:55:03,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-01 16:55:03,750 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-01 16:55:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times [2022-03-01 16:55:03,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:03,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842485953] [2022-03-01 16:55:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:03,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-01 16:55:03,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:03,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842485953] [2022-03-01 16:55:03,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842485953] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:03,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:03,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:03,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121916648] [2022-03-01 16:55:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:03,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:03,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:03,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:03,962 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-01 16:55:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:05,334 INFO L93 Difference]: Finished difference Result 24018 states and 47600 transitions. [2022-03-01 16:55:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:55:05,335 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-01 16:55:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:05,370 INFO L225 Difference]: With dead ends: 24018 [2022-03-01 16:55:05,370 INFO L226 Difference]: Without dead ends: 24018 [2022-03-01 16:55:05,370 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-01 16:55:05,370 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-01 16:55:05,370 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-01 16:55:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-03-01 16:55:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195. [2022-03-01 16:55:05,578 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-01 16:55:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions. [2022-03-01 16:55:05,598 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484 [2022-03-01 16:55:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:05,598 INFO L470 AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions. [2022-03-01 16:55:05,598 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-01 16:55:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions. [2022-03-01 16:55:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:05,601 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:05,602 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-01 16:55:05,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-01 16:55:05,602 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-01 16:55:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times [2022-03-01 16:55:05,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:05,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520977792] [2022-03-01 16:55:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:05,813 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-01 16:55:05,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:05,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520977792] [2022-03-01 16:55:05,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520977792] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:05,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:05,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:05,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297356174] [2022-03-01 16:55:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:05,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:05,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:05,814 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-01 16:55:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:06,520 INFO L93 Difference]: Finished difference Result 13507 states and 26578 transitions. [2022-03-01 16:55:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:06,520 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-01 16:55:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:06,537 INFO L225 Difference]: With dead ends: 13507 [2022-03-01 16:55:06,537 INFO L226 Difference]: Without dead ends: 13507 [2022-03-01 16:55:06,537 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-01 16:55:06,538 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:06,538 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.6s Time] [2022-03-01 16:55:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2022-03-01 16:55:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199. [2022-03-01 16:55:06,680 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-01 16:55:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:55:06,700 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:55:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:06,700 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:55:06,700 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-01 16:55:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:55:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:06,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:06,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-01 16:55:06,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-01 16:55:06,704 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-01 16:55:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times [2022-03-01 16:55:06,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:06,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590214768] [2022-03-01 16:55:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:06,906 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-01 16:55:06,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:06,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590214768] [2022-03-01 16:55:06,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590214768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:06,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:06,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:06,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436736410] [2022-03-01 16:55:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:06,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:06,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:06,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:06,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:06,908 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-01 16:55:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:07,564 INFO L93 Difference]: Finished difference Result 13561 states and 26686 transitions. [2022-03-01 16:55:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55: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-01 16:55:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:07,583 INFO L225 Difference]: With dead ends: 13561 [2022-03-01 16:55:07,583 INFO L226 Difference]: Without dead ends: 13561 [2022-03-01 16:55:07,583 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-01 16:55:07,583 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:07,583 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.5s Time] [2022-03-01 16:55:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2022-03-01 16:55:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199. [2022-03-01 16:55:07,727 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-01 16:55:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:55:07,747 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:55:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:07,747 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:55:07,748 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-01 16:55:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:55:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:07,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:07,751 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-01 16:55:07,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-01 16:55:07,751 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-01 16:55:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times [2022-03-01 16:55:07,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:07,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230393230] [2022-03-01 16:55:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:07,934 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-01 16:55:07,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:07,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230393230] [2022-03-01 16:55:07,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230393230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:07,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:07,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:07,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108117538] [2022-03-01 16:55:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:07,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:07,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:07,936 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-01 16:55:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:08,750 INFO L93 Difference]: Finished difference Result 13609 states and 26782 transitions. [2022-03-01 16:55:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:08,750 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-01 16:55:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:08,768 INFO L225 Difference]: With dead ends: 13609 [2022-03-01 16:55:08,768 INFO L226 Difference]: Without dead ends: 13609 [2022-03-01 16:55:08,768 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-01 16:55:08,769 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 332 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:08,769 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.7s Time] [2022-03-01 16:55:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2022-03-01 16:55:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199. [2022-03-01 16:55:08,915 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-01 16:55:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:55:08,936 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:55:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:08,936 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:55:08,936 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-01 16:55:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:55:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:08,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:08,939 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-01 16:55:08,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-01 16:55:08,940 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-01 16:55:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times [2022-03-01 16:55:08,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:08,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035065101] [2022-03-01 16:55:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:09,159 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-01 16:55:09,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:09,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035065101] [2022-03-01 16:55:09,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035065101] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:09,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:09,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:09,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519364320] [2022-03-01 16:55:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:09,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:09,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:09,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:09,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:09,160 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-01 16:55:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:09,920 INFO L93 Difference]: Finished difference Result 13663 states and 26890 transitions. [2022-03-01 16:55:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:09,921 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-01 16:55:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:09,940 INFO L225 Difference]: With dead ends: 13663 [2022-03-01 16:55:09,940 INFO L226 Difference]: Without dead ends: 13663 [2022-03-01 16:55:09,940 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-01 16:55:09,940 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-01 16:55:09,941 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-01 16:55:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2022-03-01 16:55:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199. [2022-03-01 16:55:10,095 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-01 16:55:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:55:10,116 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:55:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:10,116 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:55:10,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-01 16:55:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:55:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:10,119 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:10,119 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-01 16:55:10,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-01 16:55:10,120 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-01 16:55:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times [2022-03-01 16:55:10,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:10,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602115539] [2022-03-01 16:55:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:10,426 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-01 16:55:10,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:10,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602115539] [2022-03-01 16:55:10,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602115539] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:10,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:10,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:10,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626008076] [2022-03-01 16:55:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:10,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:10,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:10,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:10,427 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-01 16:55:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:11,748 INFO L93 Difference]: Finished difference Result 23784 states and 47132 transitions. [2022-03-01 16:55:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:11,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-01 16:55:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:11,782 INFO L225 Difference]: With dead ends: 23784 [2022-03-01 16:55:11,782 INFO L226 Difference]: Without dead ends: 23784 [2022-03-01 16:55:11,782 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-01 16:55:11,782 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:11,782 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.2s Time] [2022-03-01 16:55:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2022-03-01 16:55:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971. [2022-03-01 16:55:11,979 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-01 16:55:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:55:11,998 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:55:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:11,998 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:55:11,998 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-01 16:55:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:55:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:12,001 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:12,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-01 16:55:12,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-01 16:55:12,001 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-01 16:55:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times [2022-03-01 16:55:12,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:12,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636236447] [2022-03-01 16:55:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:12,207 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-01 16:55:12,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:12,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636236447] [2022-03-01 16:55:12,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636236447] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:12,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:12,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:12,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13062940] [2022-03-01 16:55:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:12,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:12,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:12,208 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-01 16:55:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:13,540 INFO L93 Difference]: Finished difference Result 23965 states and 47494 transitions. [2022-03-01 16:55:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:55:13,540 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-01 16:55:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:13,577 INFO L225 Difference]: With dead ends: 23965 [2022-03-01 16:55:13,577 INFO L226 Difference]: Without dead ends: 23965 [2022-03-01 16:55:13,578 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-01 16:55:13,578 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:13,578 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.1s Time] [2022-03-01 16:55:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23965 states. [2022-03-01 16:55:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214. [2022-03-01 16:55:13,780 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-01 16:55:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:13,800 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:13,800 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:13,800 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-01 16:55:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:13,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:13,803 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-01 16:55:13,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-01 16:55:13,803 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-01 16:55:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times [2022-03-01 16:55:13,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:13,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518263008] [2022-03-01 16:55:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:13,989 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-01 16:55:13,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:13,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518263008] [2022-03-01 16:55:13,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518263008] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:13,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:13,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:13,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574319989] [2022-03-01 16:55:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:13,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:13,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:13,990 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-01 16:55:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:15,403 INFO L93 Difference]: Finished difference Result 23857 states and 47278 transitions. [2022-03-01 16:55:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:55:15,403 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-01 16:55:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:15,437 INFO L225 Difference]: With dead ends: 23857 [2022-03-01 16:55:15,437 INFO L226 Difference]: Without dead ends: 23857 [2022-03-01 16:55:15,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:55:15,438 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:15,438 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.2s Time] [2022-03-01 16:55:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2022-03-01 16:55:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971. [2022-03-01 16:55:15,635 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-01 16:55:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:55:15,655 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:55:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:15,655 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:55:15,655 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-01 16:55:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:55:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:15,658 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:15,659 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-01 16:55:15,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-01 16:55:15,659 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-01 16:55:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times [2022-03-01 16:55:15,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:15,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245482371] [2022-03-01 16:55:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:15,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-01 16:55:15,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:15,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245482371] [2022-03-01 16:55:15,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245482371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:15,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:15,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:15,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128135834] [2022-03-01 16:55:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:15,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:15,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:15,910 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-01 16:55:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:17,237 INFO L93 Difference]: Finished difference Result 25380 states and 50259 transitions. [2022-03-01 16:55:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:55:17,237 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-01 16:55:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:17,275 INFO L225 Difference]: With dead ends: 25380 [2022-03-01 16:55:17,276 INFO L226 Difference]: Without dead ends: 25380 [2022-03-01 16:55:17,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-03-01 16:55:17,276 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-01 16:55:17,276 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-01 16:55:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-03-01 16:55:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569. [2022-03-01 16:55:17,492 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-01 16:55:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions. [2022-03-01 16:55:17,514 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484 [2022-03-01 16:55:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:17,514 INFO L470 AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions. [2022-03-01 16:55:17,514 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-01 16:55:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions. [2022-03-01 16:55:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:17,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:17,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:17,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-01 16:55:17,518 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-01 16:55:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times [2022-03-01 16:55:17,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:17,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915401929] [2022-03-01 16:55:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:17,750 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-01 16:55:17,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:17,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915401929] [2022-03-01 16:55:17,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915401929] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:17,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:17,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:17,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715115194] [2022-03-01 16:55:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:17,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:17,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:17,752 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-01 16:55:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:18,604 INFO L93 Difference]: Finished difference Result 16297 states and 32307 transitions. [2022-03-01 16:55:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:18,605 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-01 16:55:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:18,627 INFO L225 Difference]: With dead ends: 16297 [2022-03-01 16:55:18,627 INFO L226 Difference]: Without dead ends: 16297 [2022-03-01 16:55:18,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:55:18,628 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.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:18,628 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.7s Time] [2022-03-01 16:55:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16297 states. [2022-03-01 16:55:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572. [2022-03-01 16:55:18,805 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-01 16:55:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions. [2022-03-01 16:55:18,827 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484 [2022-03-01 16:55:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:18,828 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions. [2022-03-01 16:55:18,828 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-01 16:55:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions. [2022-03-01 16:55:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:18,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:18,831 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-01 16:55:18,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-01 16:55:18,831 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-01 16:55:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times [2022-03-01 16:55:18,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:18,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133826955] [2022-03-01 16:55:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:19,083 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-01 16:55:19,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:19,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133826955] [2022-03-01 16:55:19,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133826955] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:19,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:19,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:19,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756064684] [2022-03-01 16:55:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:19,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:19,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:19,084 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-01 16:55:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:20,151 INFO L93 Difference]: Finished difference Result 16351 states and 32415 transitions. [2022-03-01 16:55:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:20,151 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-01 16:55:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:20,173 INFO L225 Difference]: With dead ends: 16351 [2022-03-01 16:55:20,173 INFO L226 Difference]: Without dead ends: 16351 [2022-03-01 16:55:20,173 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-01 16:55:20,173 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 601 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-01 16:55:20,173 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-01 16:55:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2022-03-01 16:55:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571. [2022-03-01 16:55:20,340 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-01 16:55:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions. [2022-03-01 16:55:20,362 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484 [2022-03-01 16:55:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:20,362 INFO L470 AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions. [2022-03-01 16:55:20,362 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-01 16:55:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions. [2022-03-01 16:55:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:20,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:20,365 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-01 16:55:20,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-01 16:55:20,366 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-01 16:55:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times [2022-03-01 16:55:20,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:20,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350305075] [2022-03-01 16:55:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:20,575 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-01 16:55:20,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:20,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350305075] [2022-03-01 16:55:20,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350305075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:20,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:20,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:20,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638917606] [2022-03-01 16:55:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:20,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:20,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:20,577 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-01 16:55:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:21,359 INFO L93 Difference]: Finished difference Result 16399 states and 32511 transitions. [2022-03-01 16:55:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:21,360 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-01 16:55:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:21,381 INFO L225 Difference]: With dead ends: 16399 [2022-03-01 16:55:21,382 INFO L226 Difference]: Without dead ends: 16399 [2022-03-01 16:55:21,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:55:21,383 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:21,383 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.6s Time] [2022-03-01 16:55:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2022-03-01 16:55:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570. [2022-03-01 16:55:21,647 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-01 16:55:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-01 16:55:21,671 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-01 16:55:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:21,671 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-01 16:55:21,671 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-01 16:55:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-01 16:55:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:21,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:21,674 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-01 16:55:21,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-01 16:55:21,674 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-01 16:55:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times [2022-03-01 16:55:21,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:21,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657156636] [2022-03-01 16:55:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:21,959 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-01 16:55:21,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:21,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657156636] [2022-03-01 16:55:21,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657156636] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:21,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:21,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:21,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173180253] [2022-03-01 16:55:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:21,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:21,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:21,960 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-01 16:55:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:22,796 INFO L93 Difference]: Finished difference Result 16449 states and 32611 transitions. [2022-03-01 16:55:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:55:22,796 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-01 16:55:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:22,818 INFO L225 Difference]: With dead ends: 16449 [2022-03-01 16:55:22,818 INFO L226 Difference]: Without dead ends: 16449 [2022-03-01 16:55:22,818 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-01 16:55:22,819 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 629 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-01 16:55:22,819 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-01 16:55:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2022-03-01 16:55:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570. [2022-03-01 16:55:22,989 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-01 16:55:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-01 16:55:23,012 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-01 16:55:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:23,012 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-01 16:55:23,012 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-01 16:55:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-01 16:55:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:23,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:23,015 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-01 16:55:23,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-01 16:55:23,015 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-01 16:55:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times [2022-03-01 16:55:23,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:23,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698056972] [2022-03-01 16:55:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:23,239 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-01 16:55:23,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:23,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698056972] [2022-03-01 16:55:23,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698056972] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:23,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:23,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:23,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17450928] [2022-03-01 16:55:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:23,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:23,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:23,240 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-01 16:55:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:24,451 INFO L93 Difference]: Finished difference Result 16314 states and 32340 transitions. [2022-03-01 16:55:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:55:24,452 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-01 16:55:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:24,474 INFO L225 Difference]: With dead ends: 16314 [2022-03-01 16:55:24,474 INFO L226 Difference]: Without dead ends: 16314 [2022-03-01 16:55:24,474 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-01 16:55:24,474 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 722 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:24,474 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.1s Time] [2022-03-01 16:55:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2022-03-01 16:55:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555. [2022-03-01 16:55:24,668 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-01 16:55:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions. [2022-03-01 16:55:24,690 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484 [2022-03-01 16:55:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:24,691 INFO L470 AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions. [2022-03-01 16:55:24,691 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-01 16:55:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions. [2022-03-01 16:55:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:24,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:24,708 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-01 16:55:24,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-01 16:55:24,708 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-01 16:55:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times [2022-03-01 16:55:24,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:24,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509539256] [2022-03-01 16:55:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:24,943 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-01 16:55:24,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:24,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509539256] [2022-03-01 16:55:24,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509539256] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:24,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:24,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:24,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816466715] [2022-03-01 16:55:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:24,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:24,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:24,945 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-01 16:55:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:26,621 INFO L93 Difference]: Finished difference Result 16306 states and 32322 transitions. [2022-03-01 16:55:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:26,621 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-01 16:55:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:26,644 INFO L225 Difference]: With dead ends: 16306 [2022-03-01 16:55:26,644 INFO L226 Difference]: Without dead ends: 16306 [2022-03-01 16:55:26,644 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-01 16:55:26,644 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:26,645 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.5s Time] [2022-03-01 16:55:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2022-03-01 16:55:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556. [2022-03-01 16:55:26,894 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-01 16:55:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions. [2022-03-01 16:55:26,915 INFO L78 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484 [2022-03-01 16:55:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:26,915 INFO L470 AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions. [2022-03-01 16:55:26,915 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-01 16:55:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions. [2022-03-01 16:55:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:26,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:26,919 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-01 16:55:26,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-01 16:55:26,919 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-01 16:55:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times [2022-03-01 16:55:26,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:26,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299418907] [2022-03-01 16:55:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:27,162 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-01 16:55:27,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:27,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299418907] [2022-03-01 16:55:27,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299418907] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:27,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:27,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:27,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623573755] [2022-03-01 16:55:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:27,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:27,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:27,164 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-01 16:55:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:28,889 INFO L93 Difference]: Finished difference Result 16359 states and 32428 transitions. [2022-03-01 16:55:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:28,889 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-01 16:55:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:28,912 INFO L225 Difference]: With dead ends: 16359 [2022-03-01 16:55:28,912 INFO L226 Difference]: Without dead ends: 16359 [2022-03-01 16:55:28,912 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-01 16:55:28,912 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-01 16:55:28,912 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-01 16:55:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2022-03-01 16:55:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540. [2022-03-01 16:55:29,079 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-01 16:55:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions. [2022-03-01 16:55:29,101 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484 [2022-03-01 16:55:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:29,101 INFO L470 AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions. [2022-03-01 16:55:29,101 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-01 16:55:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions. [2022-03-01 16:55:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:29,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:29,104 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-01 16:55:29,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-01 16:55:29,105 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-01 16:55:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times [2022-03-01 16:55:29,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:29,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930471735] [2022-03-01 16:55:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:29,328 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-01 16:55:29,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:29,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930471735] [2022-03-01 16:55:29,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930471735] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:29,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:29,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:29,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418061536] [2022-03-01 16:55:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:29,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:29,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:29,329 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-01 16:55:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:30,257 INFO L93 Difference]: Finished difference Result 16300 states and 32309 transitions. [2022-03-01 16:55:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:30,257 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-01 16:55:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:30,279 INFO L225 Difference]: With dead ends: 16300 [2022-03-01 16:55:30,279 INFO L226 Difference]: Without dead ends: 16300 [2022-03-01 16:55:30,279 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-01 16:55:30,280 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 659 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:30,280 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.8s Time] [2022-03-01 16:55:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16300 states. [2022-03-01 16:55:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542. [2022-03-01 16:55:30,461 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-01 16:55:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions. [2022-03-01 16:55:30,484 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484 [2022-03-01 16:55:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:30,484 INFO L470 AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions. [2022-03-01 16:55:30,484 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-01 16:55:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions. [2022-03-01 16:55:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:30,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:30,487 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-01 16:55:30,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-01 16:55:30,487 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-01 16:55:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times [2022-03-01 16:55:30,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:30,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678575440] [2022-03-01 16:55:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:30,760 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-01 16:55:30,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:30,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678575440] [2022-03-01 16:55:30,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678575440] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:30,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:30,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:30,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608711177] [2022-03-01 16:55:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:30,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:30,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:30,761 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-01 16:55:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:32,025 INFO L93 Difference]: Finished difference Result 16358 states and 32425 transitions. [2022-03-01 16:55:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:32,025 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-01 16:55:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:32,049 INFO L225 Difference]: With dead ends: 16358 [2022-03-01 16:55:32,049 INFO L226 Difference]: Without dead ends: 16358 [2022-03-01 16:55:32,049 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-01 16:55:32,049 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 664 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:32,049 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.1s Time] [2022-03-01 16:55:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-03-01 16:55:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541. [2022-03-01 16:55:32,243 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-01 16:55:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions. [2022-03-01 16:55:32,362 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484 [2022-03-01 16:55:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:32,362 INFO L470 AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions. [2022-03-01 16:55:32,362 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-01 16:55:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions. [2022-03-01 16:55:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:32,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:32,365 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-01 16:55:32,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-01 16:55:32,365 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-01 16:55:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times [2022-03-01 16:55:32,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:32,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123600630] [2022-03-01 16:55:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:32,600 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-01 16:55:32,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:32,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123600630] [2022-03-01 16:55:32,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123600630] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:32,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:32,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:32,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548718931] [2022-03-01 16:55:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:32,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:32,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:32,601 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-01 16:55:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:34,016 INFO L93 Difference]: Finished difference Result 16443 states and 32595 transitions. [2022-03-01 16:55:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:34,017 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-01 16:55:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:34,041 INFO L225 Difference]: With dead ends: 16443 [2022-03-01 16:55:34,041 INFO L226 Difference]: Without dead ends: 16443 [2022-03-01 16:55:34,041 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-01 16:55:34,041 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 675 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:34,041 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.2s Time] [2022-03-01 16:55:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2022-03-01 16:55:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214. [2022-03-01 16:55:34,204 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-01 16:55:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:34,224 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:34,224 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:34,224 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-01 16:55:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:34,227 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:34,227 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-01 16:55:34,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-01 16:55:34,228 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-01 16:55:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times [2022-03-01 16:55:34,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:34,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259869323] [2022-03-01 16:55:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:34,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-01 16:55:34,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:34,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259869323] [2022-03-01 16:55:34,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259869323] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:34,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:34,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:34,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290900744] [2022-03-01 16:55:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:34,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:34,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:34,422 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-01 16:55:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:35,490 INFO L93 Difference]: Finished difference Result 14947 states and 29393 transitions. [2022-03-01 16:55:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:35,490 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-01 16:55:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:35,510 INFO L225 Difference]: With dead ends: 14947 [2022-03-01 16:55:35,510 INFO L226 Difference]: Without dead ends: 14947 [2022-03-01 16:55:35,511 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-01 16:55:35,511 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 572 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:35,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 3553 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:55:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-03-01 16:55:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217. [2022-03-01 16:55:35,671 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-01 16:55:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions. [2022-03-01 16:55:35,691 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484 [2022-03-01 16:55:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:35,692 INFO L470 AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions. [2022-03-01 16:55:35,692 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-01 16:55:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions. [2022-03-01 16:55:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:35,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:35,695 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-01 16:55:35,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-01 16:55:35,695 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-01 16:55:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times [2022-03-01 16:55:35,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:35,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676141005] [2022-03-01 16:55:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:35,929 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-01 16:55:35,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:35,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676141005] [2022-03-01 16:55:35,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676141005] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:35,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:35,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:35,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698252089] [2022-03-01 16:55:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:35,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:35,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:35,930 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-01 16:55:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:36,853 INFO L93 Difference]: Finished difference Result 15001 states and 29501 transitions. [2022-03-01 16:55:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:36,854 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-01 16:55:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:36,873 INFO L225 Difference]: With dead ends: 15001 [2022-03-01 16:55:36,873 INFO L226 Difference]: Without dead ends: 15001 [2022-03-01 16:55:36,874 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-01 16:55:36,874 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 589 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:36,874 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.8s Time] [2022-03-01 16:55:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15001 states. [2022-03-01 16:55:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216. [2022-03-01 16:55:37,020 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-01 16:55:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions. [2022-03-01 16:55:37,040 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484 [2022-03-01 16:55:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:37,040 INFO L470 AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions. [2022-03-01 16:55:37,040 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-01 16:55:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions. [2022-03-01 16:55:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:37,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:37,043 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-01 16:55:37,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-01 16:55:37,043 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-01 16:55:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times [2022-03-01 16:55:37,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:37,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709638319] [2022-03-01 16:55:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:37,307 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-01 16:55:37,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:37,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709638319] [2022-03-01 16:55:37,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709638319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:37,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:37,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:37,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010695981] [2022-03-01 16:55:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:37,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:37,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:37,308 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-01 16:55:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:38,066 INFO L93 Difference]: Finished difference Result 15052 states and 29603 transitions. [2022-03-01 16:55:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:38,071 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-01 16:55:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:38,091 INFO L225 Difference]: With dead ends: 15052 [2022-03-01 16:55:38,091 INFO L226 Difference]: Without dead ends: 15052 [2022-03-01 16:55:38,091 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-01 16:55:38,091 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 602 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:38,092 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.6s Time] [2022-03-01 16:55:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2022-03-01 16:55:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215. [2022-03-01 16:55:38,241 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-01 16:55:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-01 16:55:38,260 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-01 16:55:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:38,261 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-01 16:55:38,261 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-01 16:55:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-01 16:55:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:38,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:38,264 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-01 16:55:38,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-01 16:55:38,264 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-01 16:55:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times [2022-03-01 16:55:38,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:38,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965080530] [2022-03-01 16:55:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:38,457 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-01 16:55:38,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:38,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965080530] [2022-03-01 16:55:38,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965080530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:38,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:38,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:38,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345872623] [2022-03-01 16:55:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:38,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:38,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:38,459 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-01 16:55:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:39,379 INFO L93 Difference]: Finished difference Result 15095 states and 29689 transitions. [2022-03-01 16:55:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:39,380 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-01 16:55:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:39,400 INFO L225 Difference]: With dead ends: 15095 [2022-03-01 16:55:39,400 INFO L226 Difference]: Without dead ends: 15095 [2022-03-01 16:55:39,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:55:39,400 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 623 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:39,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 3466 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:55:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2022-03-01 16:55:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214. [2022-03-01 16:55:39,547 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-01 16:55:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:39,567 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:39,567 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:39,568 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-01 16:55:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:39,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:39,571 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-01 16:55:39,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-01 16:55:39,571 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-01 16:55:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times [2022-03-01 16:55:39,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:39,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275307049] [2022-03-01 16:55:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:39,763 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-01 16:55:39,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:39,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275307049] [2022-03-01 16:55:39,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275307049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:39,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:39,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:39,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271975350] [2022-03-01 16:55:39,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:39,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:39,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:39,765 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-01 16:55:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:41,212 INFO L93 Difference]: Finished difference Result 25238 states and 49975 transitions. [2022-03-01 16:55:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 16:55:41,212 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-01 16:55:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:41,255 INFO L225 Difference]: With dead ends: 25238 [2022-03-01 16:55:41,255 INFO L226 Difference]: Without dead ends: 25238 [2022-03-01 16:55:41,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:55:41,256 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1188 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:41,256 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.1s Time] [2022-03-01 16:55:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25238 states. [2022-03-01 16:55:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987. [2022-03-01 16:55:41,485 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-01 16:55:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions. [2022-03-01 16:55:41,507 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484 [2022-03-01 16:55:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:41,507 INFO L470 AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions. [2022-03-01 16:55:41,507 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-01 16:55:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions. [2022-03-01 16:55:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:41,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:41,510 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-01 16:55:41,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-01 16:55:41,510 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-01 16:55:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times [2022-03-01 16:55:41,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:41,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181182746] [2022-03-01 16:55:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:41,728 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-01 16:55:41,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:41,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181182746] [2022-03-01 16:55:41,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181182746] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:41,729 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:41,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:41,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843891884] [2022-03-01 16:55:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:41,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:41,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:41,729 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-01 16:55:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:42,814 INFO L93 Difference]: Finished difference Result 24029 states and 47620 transitions. [2022-03-01 16:55:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:55:42,814 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-01 16:55:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:42,851 INFO L225 Difference]: With dead ends: 24029 [2022-03-01 16:55:42,851 INFO L226 Difference]: Without dead ends: 24029 [2022-03-01 16:55:42,851 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-01 16:55:42,851 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 1045 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:42,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 4040 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:55:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2022-03-01 16:55:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215. [2022-03-01 16:55:43,066 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-01 16:55:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-01 16:55:43,087 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-01 16:55:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:43,087 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-01 16:55:43,088 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-01 16:55:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-01 16:55:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:43,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:43,091 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-01 16:55:43,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-01 16:55:43,091 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-01 16:55:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times [2022-03-01 16:55:43,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:43,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796628282] [2022-03-01 16:55:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:43,338 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-01 16:55:43,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:43,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796628282] [2022-03-01 16:55:43,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796628282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:43,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:43,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:43,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678324704] [2022-03-01 16:55:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:43,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:43,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:43,339 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-01 16:55:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:43,974 INFO L93 Difference]: Finished difference Result 13519 states and 26600 transitions. [2022-03-01 16:55:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:55:43,975 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-01 16:55:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:43,993 INFO L225 Difference]: With dead ends: 13519 [2022-03-01 16:55:43,993 INFO L226 Difference]: Without dead ends: 13519 [2022-03-01 16:55:43,993 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-01 16:55:43,994 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-01 16:55:43,994 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-01 16:55:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2022-03-01 16:55:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214. [2022-03-01 16:55:44,146 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-01 16:55:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:44,167 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:44,167 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:44,167 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-01 16:55:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:44,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:44,170 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-01 16:55:44,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-01 16:55:44,170 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-01 16:55:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times [2022-03-01 16:55:44,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:44,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185250146] [2022-03-01 16:55:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:44,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-01 16:55:44,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:44,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185250146] [2022-03-01 16:55:44,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185250146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:44,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:44,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:44,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779607742] [2022-03-01 16:55:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:44,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:44,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:44,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-01 16:55:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:45,047 INFO L93 Difference]: Finished difference Result 13573 states and 26708 transitions. [2022-03-01 16:55:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:45,047 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-01 16:55:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:45,067 INFO L225 Difference]: With dead ends: 13573 [2022-03-01 16:55:45,067 INFO L226 Difference]: Without dead ends: 13573 [2022-03-01 16:55:45,068 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-01 16:55:45,068 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 300 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:45,068 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.5s Time] [2022-03-01 16:55:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2022-03-01 16:55:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214. [2022-03-01 16:55:45,216 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-01 16:55:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:45,237 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:45,237 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:45,237 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-01 16:55:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:45,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:45,241 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-01 16:55:45,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-01 16:55:45,241 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-01 16:55:45,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times [2022-03-01 16:55:45,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:45,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36706048] [2022-03-01 16:55:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:45,484 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-01 16:55:45,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:45,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36706048] [2022-03-01 16:55:45,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36706048] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:45,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:45,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:45,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906315485] [2022-03-01 16:55:45,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:45,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:45,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:45,486 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-01 16:55:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:46,519 INFO L93 Difference]: Finished difference Result 13621 states and 26804 transitions. [2022-03-01 16:55:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:46,519 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-01 16:55:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:46,540 INFO L225 Difference]: With dead ends: 13621 [2022-03-01 16:55:46,540 INFO L226 Difference]: Without dead ends: 13621 [2022-03-01 16:55:46,540 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-01 16:55:46,540 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-01 16:55:46,541 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-01 16:55:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13621 states. [2022-03-01 16:55:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214. [2022-03-01 16:55:46,704 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-01 16:55:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:46,727 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:46,727 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:46,727 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-01 16:55:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:46,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:46,730 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-01 16:55:46,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-01 16:55:46,730 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-01 16:55:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times [2022-03-01 16:55:46,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:46,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565809237] [2022-03-01 16:55:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:47,025 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-01 16:55:47,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:47,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565809237] [2022-03-01 16:55:47,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565809237] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:47,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:47,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:47,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632632480] [2022-03-01 16:55:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:47,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:47,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:47,026 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-01 16:55:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:47,648 INFO L93 Difference]: Finished difference Result 13675 states and 26912 transitions. [2022-03-01 16:55:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:47,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-01 16:55:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:47,666 INFO L225 Difference]: With dead ends: 13675 [2022-03-01 16:55:47,667 INFO L226 Difference]: Without dead ends: 13675 [2022-03-01 16:55:47,667 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-01 16:55:47,667 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 325 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:47,667 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.5s Time] [2022-03-01 16:55:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13675 states. [2022-03-01 16:55:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214. [2022-03-01 16:55:47,811 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-01 16:55:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:47,831 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:47,831 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:47,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-01 16:55:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:47,834 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:47,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-01 16:55:47,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-01 16:55:47,835 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-01 16:55:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times [2022-03-01 16:55:47,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:47,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874415072] [2022-03-01 16:55:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:48,027 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-01 16:55:48,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:48,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874415072] [2022-03-01 16:55:48,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874415072] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:48,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:48,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:48,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419095186] [2022-03-01 16:55:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:48,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:48,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:48,028 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-01 16:55:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:49,380 INFO L93 Difference]: Finished difference Result 23827 states and 47216 transitions. [2022-03-01 16:55:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:55:49,380 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-01 16:55:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:49,414 INFO L225 Difference]: With dead ends: 23827 [2022-03-01 16:55:49,414 INFO L226 Difference]: Without dead ends: 23827 [2022-03-01 16:55:49,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:55:49,414 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:49,414 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.2s Time] [2022-03-01 16:55:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23827 states. [2022-03-01 16:55:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971. [2022-03-01 16:55:49,611 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-01 16:55:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:55:49,629 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:55:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:49,630 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:55:49,630 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-01 16:55:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:55:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:49,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:49,633 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-01 16:55:49,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-01 16:55:49,633 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-01 16:55:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times [2022-03-01 16:55:49,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:49,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45827815] [2022-03-01 16:55:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:49,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-01 16:55:49,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:49,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45827815] [2022-03-01 16:55:49,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45827815] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:49,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:49,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:49,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157729840] [2022-03-01 16:55:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:49,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:49,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:49,831 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-01 16:55:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:50,966 INFO L93 Difference]: Finished difference Result 23624 states and 46810 transitions. [2022-03-01 16:55:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:50,966 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-01 16:55:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:51,002 INFO L225 Difference]: With dead ends: 23624 [2022-03-01 16:55:51,002 INFO L226 Difference]: Without dead ends: 23624 [2022-03-01 16:55:51,003 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-01 16:55:51,003 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:51,003 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.0s Time] [2022-03-01 16:55:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2022-03-01 16:55:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875. [2022-03-01 16:55:51,220 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-01 16:55:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions. [2022-03-01 16:55:51,241 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484 [2022-03-01 16:55:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:51,241 INFO L470 AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions. [2022-03-01 16:55:51,241 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-01 16:55:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions. [2022-03-01 16:55:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:51,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:51,245 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-01 16:55:51,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-01 16:55:51,245 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-01 16:55:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times [2022-03-01 16:55:51,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:51,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115255637] [2022-03-01 16:55:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:51,468 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-01 16:55:51,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:51,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115255637] [2022-03-01 16:55:51,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115255637] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:51,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:51,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:51,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681789294] [2022-03-01 16:55:51,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:51,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:51,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:51,472 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-01 16:55:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:53,144 INFO L93 Difference]: Finished difference Result 23548 states and 46658 transitions. [2022-03-01 16:55:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:55:53,145 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-01 16:55:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:53,180 INFO L225 Difference]: With dead ends: 23548 [2022-03-01 16:55:53,180 INFO L226 Difference]: Without dead ends: 23548 [2022-03-01 16:55:53,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:55:53,180 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-01 16:55:53,181 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-01 16:55:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2022-03-01 16:55:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618. [2022-03-01 16:55:53,393 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-01 16:55:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions. [2022-03-01 16:55:53,413 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484 [2022-03-01 16:55:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:53,414 INFO L470 AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions. [2022-03-01 16:55:53,414 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-01 16:55:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions. [2022-03-01 16:55:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-01 16:55:53,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:53,417 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-01 16:55:53,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-01 16:55:53,417 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-01 16:55:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times [2022-03-01 16:55:53,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:53,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716650107] [2022-03-01 16:55:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:53,579 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-01 16:55:53,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:53,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716650107] [2022-03-01 16:55:53,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716650107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:53,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:53,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:53,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855141769] [2022-03-01 16:55:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:53,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:53,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:53,580 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-01 16:55:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:53,876 INFO L93 Difference]: Finished difference Result 13358 states and 26280 transitions. [2022-03-01 16:55:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:53,876 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-01 16:55:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:53,895 INFO L225 Difference]: With dead ends: 13358 [2022-03-01 16:55:53,895 INFO L226 Difference]: Without dead ends: 13358 [2022-03-01 16:55:53,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:53,897 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 250 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:53,897 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.2s Time] [2022-03-01 16:55:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2022-03-01 16:55:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928. [2022-03-01 16:55:54,050 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-01 16:55:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions. [2022-03-01 16:55:54,071 INFO L78 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488 [2022-03-01 16:55:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:54,071 INFO L470 AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions. [2022-03-01 16:55:54,071 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-01 16:55:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions. [2022-03-01 16:55:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-01 16:55:54,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:54,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-01 16:55:54,075 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-01 16:55:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times [2022-03-01 16:55:54,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:54,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34873004] [2022-03-01 16:55:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:54,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-01 16:55:54,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:54,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34873004] [2022-03-01 16:55:54,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34873004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:54,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:54,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:54,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794630460] [2022-03-01 16:55:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:54,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:54,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:54,253 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-01 16:55:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:54,671 INFO L93 Difference]: Finished difference Result 13909 states and 27382 transitions. [2022-03-01 16:55:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:54,672 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-01 16:55:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:54,691 INFO L225 Difference]: With dead ends: 13909 [2022-03-01 16:55:54,691 INFO L226 Difference]: Without dead ends: 13909 [2022-03-01 16:55:54,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:54,691 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 317 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:54,691 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.4s Time] [2022-03-01 16:55:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-03-01 16:55:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339. [2022-03-01 16:55:54,851 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-01 16:55:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions. [2022-03-01 16:55:54,873 INFO L78 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488 [2022-03-01 16:55:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:54,873 INFO L470 AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions. [2022-03-01 16:55:54,873 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-01 16:55:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions. [2022-03-01 16:55:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:55:54,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:54,876 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-01 16:55:54,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-01 16:55:54,877 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-01 16:55:54,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times [2022-03-01 16:55:54,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:54,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633430] [2022-03-01 16:55:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1244 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2022-03-01 16:55:55,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:55,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633430] [2022-03-01 16:55:55,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:55,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515910951] [2022-03-01 16:55:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:55,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:55,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 16:55:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:58,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 16:55:58,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:58,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:55:58,780 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-01 16:55:58,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:55:58,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515910951] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:58,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:55:58,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 25 [2022-03-01 16:55:58,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529945231] [2022-03-01 16:55:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:58,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:58,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:55:58,781 INFO L87 Difference]: Start difference. First operand 13339 states and 26242 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:58,983 INFO L93 Difference]: Finished difference Result 35101 states and 69697 transitions. [2022-03-01 16:55:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01 16:55:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:59,038 INFO L225 Difference]: With dead ends: 35101 [2022-03-01 16:55:59,038 INFO L226 Difference]: Without dead ends: 35101 [2022-03-01 16:55:59,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 504 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:55:59,039 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 715 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:59,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 1591 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:55:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35101 states. [2022-03-01 16:55:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35101 to 13790. [2022-03-01 16:55:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13790 states, 13729 states have (on average 1.9721756865030229) internal successors, (27076), 13789 states have internal predecessors, (27076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 27076 transitions. [2022-03-01 16:55:59,334 INFO L78 Accepts]: Start accepts. Automaton has 13790 states and 27076 transitions. Word has length 494 [2022-03-01 16:55:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:59,334 INFO L470 AbstractCegarLoop]: Abstraction has 13790 states and 27076 transitions. [2022-03-01 16:55:59,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13790 states and 27076 transitions. [2022-03-01 16:55:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:55:59,337 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:59,337 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-01 16:55:59,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-01 16:55:59,555 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-01 16:55:59,555 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-01 16:55:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times [2022-03-01 16:55:59,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:59,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272722626] [2022-03-01 16:55:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-01 16:56:00,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:00,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272722626] [2022-03-01 16:56:00,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272722626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:00,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247472279] [2022-03-01 16:56:00,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:56:00,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:00,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:00,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:00,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 16:56:02,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:56:02,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:56:02,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 16:56:02,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:56:02,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:56:02,992 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-01 16:56:02,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:56:02,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247472279] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:56:02,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:56:02,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2022-03-01 16:56:02,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704246477] [2022-03-01 16:56:02,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:56:02,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:56:02,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:56:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:56:02,993 INFO L87 Difference]: Start difference. First operand 13790 states and 27076 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:03,163 INFO L93 Difference]: Finished difference Result 35769 states and 70870 transitions. [2022-03-01 16:56:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 16:56:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01 16:56:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:03,217 INFO L225 Difference]: With dead ends: 35769 [2022-03-01 16:56:03,218 INFO L226 Difference]: Without dead ends: 35769 [2022-03-01 16:56:03,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:56:03,218 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 910 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:03,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 1238 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:56:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35769 states. [2022-03-01 16:56:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35769 to 13982. [2022-03-01 16:56:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13982 states, 13917 states have (on average 1.9663720629446002) internal successors, (27366), 13981 states have internal predecessors, (27366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13982 states to 13982 states and 27366 transitions. [2022-03-01 16:56:03,511 INFO L78 Accepts]: Start accepts. Automaton has 13982 states and 27366 transitions. Word has length 494 [2022-03-01 16:56:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:03,511 INFO L470 AbstractCegarLoop]: Abstraction has 13982 states and 27366 transitions. [2022-03-01 16:56:03,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13982 states and 27366 transitions. [2022-03-01 16:56:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:56:03,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:03,514 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-01 16:56:03,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-01 16:56:03,734 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-01 16:56:03,734 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -251041000, now seen corresponding path program 3 times [2022-03-01 16:56:03,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:03,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492833669] [2022-03-01 16:56:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-01 16:56:04,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:04,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492833669] [2022-03-01 16:56:04,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492833669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:04,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389174485] [2022-03-01 16:56:04,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:56:04,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:04,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:04,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 16:56:06,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:56:06,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:56:06,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 16:56:06,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:56:07,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:56:07,422 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-01 16:56:07,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:56:07,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389174485] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:56:07,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:56:07,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2022-03-01 16:56:07,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412337854] [2022-03-01 16:56:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:56:07,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:56:07,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:56:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:56:07,423 INFO L87 Difference]: Start difference. First operand 13982 states and 27366 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:07,725 INFO L93 Difference]: Finished difference Result 45755 states and 90748 transitions. [2022-03-01 16:56:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 16:56:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01 16:56:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:07,803 INFO L225 Difference]: With dead ends: 45755 [2022-03-01 16:56:07,803 INFO L226 Difference]: Without dead ends: 45755 [2022-03-01 16:56:07,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:56:07,803 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 1238 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:07,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1238 Valid, 1691 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:56:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45755 states. [2022-03-01 16:56:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45755 to 13984. [2022-03-01 16:56:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13984 states, 13919 states have (on average 1.9663768948918745) internal successors, (27370), 13983 states have internal predecessors, (27370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13984 states to 13984 states and 27370 transitions. [2022-03-01 16:56:08,180 INFO L78 Accepts]: Start accepts. Automaton has 13984 states and 27370 transitions. Word has length 494 [2022-03-01 16:56:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:08,181 INFO L470 AbstractCegarLoop]: Abstraction has 13984 states and 27370 transitions. [2022-03-01 16:56:08,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13984 states and 27370 transitions. [2022-03-01 16:56:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:56:08,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:08,184 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-01 16:56:08,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 16:56:08,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:08,403 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash -824021608, now seen corresponding path program 4 times [2022-03-01 16:56:08,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:08,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072866079] [2022-03-01 16:56:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-01 16:56:09,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:09,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072866079] [2022-03-01 16:56:09,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072866079] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:09,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495416190] [2022-03-01 16:56:09,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:56:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:09,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:09,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:09,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 17:01:00,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 17:01:00,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:01:00,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 17:01:00,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:01:01,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 17:01:01,693 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-01 17:01:01,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 17:01:01,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495416190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:01,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 17:01:01,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2022-03-01 17:01:01,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527728517] [2022-03-01 17:01:01,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:01,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:01,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:01,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-01 17:01:01,695 INFO L87 Difference]: Start difference. First operand 13984 states and 27370 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:01,898 INFO L93 Difference]: Finished difference Result 35462 states and 70231 transitions. [2022-03-01 17:01:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01 17:01:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:01,958 INFO L225 Difference]: With dead ends: 35462 [2022-03-01 17:01:01,958 INFO L226 Difference]: Without dead ends: 35462 [2022-03-01 17:01:01,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-03-01 17:01:01,958 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 794 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:01,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 1273 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 17:01:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2022-03-01 17:01:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 14266. [2022-03-01 17:01:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14266 states, 14201 states have (on average 1.9670445743257516) internal successors, (27934), 14265 states have internal predecessors, (27934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14266 states to 14266 states and 27934 transitions. [2022-03-01 17:01:02,275 INFO L78 Accepts]: Start accepts. Automaton has 14266 states and 27934 transitions. Word has length 494 [2022-03-01 17:01:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:02,275 INFO L470 AbstractCegarLoop]: Abstraction has 14266 states and 27934 transitions. [2022-03-01 17:01:02,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14266 states and 27934 transitions. [2022-03-01 17:01:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-01 17:01:02,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:02,277 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-01 17:01:02,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-01 17:01:02,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:01:02,499 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times [2022-03-01 17:01:02,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:02,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272387501] [2022-03-01 17:01:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:02,719 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-01 17:01:02,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:02,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272387501] [2022-03-01 17:01:02,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272387501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:02,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:02,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:02,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794190766] [2022-03-01 17:01:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:02,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:02,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:02,720 INFO L87 Difference]: Start difference. First operand 14266 states and 27934 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-01 17:01:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:03,021 INFO L93 Difference]: Finished difference Result 14670 states and 28743 transitions. [2022-03-01 17:01:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:03,021 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-01 17:01:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:03,039 INFO L225 Difference]: With dead ends: 14670 [2022-03-01 17:01:03,040 INFO L226 Difference]: Without dead ends: 14670 [2022-03-01 17:01:03,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:03,040 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:03,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 801 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 17:01:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2022-03-01 17:01:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 14577. [2022-03-01 17:01:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14577 states, 14513 states have (on average 1.967684145249087) internal successors, (28557), 14576 states have internal predecessors, (28557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14577 states to 14577 states and 28557 transitions. [2022-03-01 17:01:03,222 INFO L78 Accepts]: Start accepts. Automaton has 14577 states and 28557 transitions. Word has length 497 [2022-03-01 17:01:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:03,222 INFO L470 AbstractCegarLoop]: Abstraction has 14577 states and 28557 transitions. [2022-03-01 17:01:03,222 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-01 17:01:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14577 states and 28557 transitions. [2022-03-01 17:01:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-01 17:01:03,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:03,224 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-01 17:01:03,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-01 17:01:03,224 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times [2022-03-01 17:01:03,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:03,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073865958] [2022-03-01 17:01:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:03,431 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-01 17:01:03,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:03,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073865958] [2022-03-01 17:01:03,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073865958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:03,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:03,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:03,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116425227] [2022-03-01 17:01:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:03,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:03,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:03,433 INFO L87 Difference]: Start difference. First operand 14577 states and 28557 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-01 17:01:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:03,833 INFO L93 Difference]: Finished difference Result 15135 states and 29674 transitions. [2022-03-01 17:01:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:03,833 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-01 17:01:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:03,855 INFO L225 Difference]: With dead ends: 15135 [2022-03-01 17:01:03,856 INFO L226 Difference]: Without dead ends: 15135 [2022-03-01 17:01:03,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:03,856 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:03,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1017 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 17:01:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15135 states. [2022-03-01 17:01:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15135 to 15006. [2022-03-01 17:01:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15006 states, 14943 states have (on average 1.9685471458207857) internal successors, (29416), 15005 states have internal predecessors, (29416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15006 states to 15006 states and 29416 transitions. [2022-03-01 17:01:04,061 INFO L78 Accepts]: Start accepts. Automaton has 15006 states and 29416 transitions. Word has length 497 [2022-03-01 17:01:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:04,061 INFO L470 AbstractCegarLoop]: Abstraction has 15006 states and 29416 transitions. [2022-03-01 17:01:04,061 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-01 17:01:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 15006 states and 29416 transitions. [2022-03-01 17:01:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-01 17:01:04,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:04,064 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-01 17:01:04,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-01 17:01:04,064 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times [2022-03-01 17:01:04,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:04,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476238087] [2022-03-01 17:01:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:04,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-01 17:01:04,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:04,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476238087] [2022-03-01 17:01:04,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476238087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:04,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:04,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:04,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120295196] [2022-03-01 17:01:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:04,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:04,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:04,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:04,299 INFO L87 Difference]: Start difference. First operand 15006 states and 29416 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-01 17:01:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:04,571 INFO L93 Difference]: Finished difference Result 15412 states and 30229 transitions. [2022-03-01 17:01:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:04,571 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-01 17:01:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:04,595 INFO L225 Difference]: With dead ends: 15412 [2022-03-01 17:01:04,595 INFO L226 Difference]: Without dead ends: 15412 [2022-03-01 17:01:04,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:04,596 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:04,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 801 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 17:01:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15412 states. [2022-03-01 17:01:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15412 to 15316. [2022-03-01 17:01:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15316 states, 15254 states have (on average 1.969122853022158) internal successors, (30037), 15315 states have internal predecessors, (30037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15316 states to 15316 states and 30037 transitions. [2022-03-01 17:01:04,859 INFO L78 Accepts]: Start accepts. Automaton has 15316 states and 30037 transitions. Word has length 505 [2022-03-01 17:01:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:04,859 INFO L470 AbstractCegarLoop]: Abstraction has 15316 states and 30037 transitions. [2022-03-01 17:01:04,859 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-01 17:01:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15316 states and 30037 transitions. [2022-03-01 17:01:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-01 17:01:04,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:04,861 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-01 17:01:04,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-01 17:01:04,862 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times [2022-03-01 17:01:04,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:04,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124351201] [2022-03-01 17:01:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:05,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-01 17:01:05,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:05,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124351201] [2022-03-01 17:01:05,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124351201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:05,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:05,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:05,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600107127] [2022-03-01 17:01:05,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:05,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:05,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:05,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:05,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:05,066 INFO L87 Difference]: Start difference. First operand 15316 states and 30037 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-01 17:01:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:05,522 INFO L93 Difference]: Finished difference Result 15876 states and 31158 transitions. [2022-03-01 17:01:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:05,522 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-01 17:01:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:05,559 INFO L225 Difference]: With dead ends: 15876 [2022-03-01 17:01:05,559 INFO L226 Difference]: Without dead ends: 15344 [2022-03-01 17:01:05,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:05,560 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:05,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1052 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 17:01:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15344 states. [2022-03-01 17:01:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15344 to 15147. [2022-03-01 17:01:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15147 states, 15086 states have (on average 1.9657961023465464) internal successors, (29656), 15146 states have internal predecessors, (29656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15147 states to 15147 states and 29656 transitions. [2022-03-01 17:01:05,808 INFO L78 Accepts]: Start accepts. Automaton has 15147 states and 29656 transitions. Word has length 505 [2022-03-01 17:01:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:05,808 INFO L470 AbstractCegarLoop]: Abstraction has 15147 states and 29656 transitions. [2022-03-01 17:01:05,809 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-01 17:01:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 15147 states and 29656 transitions. [2022-03-01 17:01:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-03-01 17:01:05,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:05,812 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-01 17:01:05,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-01 17:01:05,812 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times [2022-03-01 17:01:05,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:05,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765507239] [2022-03-01 17:01:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:06,270 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-01 17:01:06,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:06,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765507239] [2022-03-01 17:01:06,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765507239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:06,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:06,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:06,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385771249] [2022-03-01 17:01:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:06,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:06,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:06,272 INFO L87 Difference]: Start difference. First operand 15147 states and 29656 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-01 17:01:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:06,672 INFO L93 Difference]: Finished difference Result 15622 states and 30607 transitions. [2022-03-01 17:01:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:06,672 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-01 17:01:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:06,715 INFO L225 Difference]: With dead ends: 15622 [2022-03-01 17:01:06,715 INFO L226 Difference]: Without dead ends: 15622 [2022-03-01 17:01:06,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:06,715 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 242 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:06,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1008 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 17:01:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15622 states. [2022-03-01 17:01:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15622 to 15440. [2022-03-01 17:01:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15440 states, 15382 states have (on average 1.9661292419711351) internal successors, (30243), 15439 states have internal predecessors, (30243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15440 states to 15440 states and 30243 transitions. [2022-03-01 17:01:06,901 INFO L78 Accepts]: Start accepts. Automaton has 15440 states and 30243 transitions. Word has length 521 [2022-03-01 17:01:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:06,901 INFO L470 AbstractCegarLoop]: Abstraction has 15440 states and 30243 transitions. [2022-03-01 17:01:06,902 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-01 17:01:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15440 states and 30243 transitions. [2022-03-01 17:01:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-03-01 17:01:06,904 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:06,904 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-01 17:01:06,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-03-01 17:01:06,905 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 17:01:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times [2022-03-01 17:01:06,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:06,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70136731] [2022-03-01 17:01:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:07,091 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-01 17:01:07,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:07,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70136731] [2022-03-01 17:01:07,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70136731] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:01:07,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:01:07,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 17:01:07,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576665537] [2022-03-01 17:01:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:01:07,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:01:07,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:01:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:07,092 INFO L87 Difference]: Start difference. First operand 15440 states and 30243 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-01 17:01:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:07,452 INFO L93 Difference]: Finished difference Result 17574 states and 34484 transitions. [2022-03-01 17:01:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:01:07,453 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-01 17:01:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:07,478 INFO L225 Difference]: With dead ends: 17574 [2022-03-01 17:01:07,478 INFO L226 Difference]: Without dead ends: 17223 [2022-03-01 17:01:07,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:01:07,478 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:07,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 937 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 17:01:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2022-03-01 17:01:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 15344. [2022-03-01 17:01:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15344 states, 15289 states have (on average 1.9638302047223495) internal successors, (30025), 15343 states have internal predecessors, (30025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15344 states to 15344 states and 30025 transitions. [2022-03-01 17:01:07,727 INFO L78 Accepts]: Start accepts. Automaton has 15344 states and 30025 transitions. Word has length 531 [2022-03-01 17:01:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:07,728 INFO L470 AbstractCegarLoop]: Abstraction has 15344 states and 30025 transitions. [2022-03-01 17:01:07,728 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-01 17:01:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15344 states and 30025 transitions. [2022-03-01 17:01:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-01 17:01:07,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:07,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:01:07,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-03-01 17:01:07,732 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-01 17:01:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -723369720, now seen corresponding path program 1 times [2022-03-01 17:01:07,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:07,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624089758] [2022-03-01 17:01:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 39 proven. 1086 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-03-01 17:01:08,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:01:08,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624089758] [2022-03-01 17:01:08,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624089758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:01:08,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759663483] [2022-03-01 17:01:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:08,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:01:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:01:08,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:01:08,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 17:01:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:01:11,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 2157 conjuncts, 116 conjunts are in the unsatisfiable core [2022-03-01 17:01:11,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:01:11,588 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 17:01:11,588 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-01 17:01:11,736 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 17:01:11,736 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-01 17:01:12,221 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 17:01:12,221 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-01 17:01:12,702 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 17:01:12,703 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-01 17:01:13,109 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 17:01:13,109 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-01 17:01:13,563 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 17:01:13,564 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-01 17:01:15,027 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:15,028 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 31 treesize of output 50 [2022-03-01 17:01:16,498 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:16,498 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 31 treesize of output 50 [2022-03-01 17:01:17,970 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:17,971 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 31 treesize of output 50 [2022-03-01 17:01:18,973 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:18,973 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 31 treesize of output 50 [2022-03-01 17:01:19,994 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:19,994 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 31 treesize of output 50 [2022-03-01 17:01:21,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 17:01:22,046 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:22,047 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 31 treesize of output 50 [2022-03-01 17:01:25,938 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-01 17:01:26,247 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 9 treesize of output 3 [2022-03-01 17:01:26,682 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 17:01:26,684 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 31 treesize of output 50 [2022-03-01 17:01:27,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-01 17:01:27,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:01:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 17:01:27,726 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-01 17:01:27,726 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 25 treesize of output 35 [2022-03-01 17:01:27,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-03-01 17:01:27,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:01:27,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 17:01:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 996 proven. 27 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2022-03-01 17:01:27,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:01:38,264 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 15 treesize of output 13 [2022-03-01 17:01:38,269 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 28 treesize of output 26 [2022-03-01 17:02:13,486 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-01 17:02:13,486 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 188 treesize of output 183 [2022-03-01 17:02:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 1004 proven. 7 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-03-01 17:02:13,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759663483] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:02:13,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:02:13,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 16] total 54 [2022-03-01 17:02:13,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496907260] [2022-03-01 17:02:13,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:02:13,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-01 17:02:13,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-01 17:02:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2452, Unknown=6, NotChecked=0, Total=2970 [2022-03-01 17:02:13,612 INFO L87 Difference]: Start difference. First operand 15344 states and 30025 transitions. Second operand has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:16,127 INFO L93 Difference]: Finished difference Result 28057 states and 55986 transitions. [2022-03-01 17:02:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 17:02:16,128 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 566 [2022-03-01 17:02:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:16,177 INFO L225 Difference]: With dead ends: 28057 [2022-03-01 17:02:16,178 INFO L226 Difference]: Without dead ends: 28057 [2022-03-01 17:02:16,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1111 SyntacticMatches, 32 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4109 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1290, Invalid=6536, Unknown=6, NotChecked=0, Total=7832 [2022-03-01 17:02:16,179 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 1756 mSDsluCounter, 7886 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 8439 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:16,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 8439 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1150 Invalid, 0 Unknown, 681 Unchecked, 0.6s Time] [2022-03-01 17:02:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28057 states. [2022-03-01 17:02:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28057 to 19015. [2022-03-01 17:02:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19015 states, 18960 states have (on average 1.969831223628692) internal successors, (37348), 19014 states have internal predecessors, (37348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19015 states to 19015 states and 37348 transitions. [2022-03-01 17:02:16,520 INFO L78 Accepts]: Start accepts. Automaton has 19015 states and 37348 transitions. Word has length 566 [2022-03-01 17:02:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:16,521 INFO L470 AbstractCegarLoop]: Abstraction has 19015 states and 37348 transitions. [2022-03-01 17:02:16,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19015 states and 37348 transitions. [2022-03-01 17:02:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-01 17:02:16,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:16,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:02:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-01 17:02:16,743 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-01 17:02:16,743 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-01 17:02:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -723437610, now seen corresponding path program 2 times [2022-03-01 17:02:16,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:16,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189142186] [2022-03-01 17:02:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 108 proven. 1009 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2022-03-01 17:02:17,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:17,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189142186] [2022-03-01 17:02:17,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189142186] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:17,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487966195] [2022-03-01 17:02:17,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 17:02:17,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:17,938 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:02:17,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 17:02:20,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 17:02:20,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:20,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 2157 conjuncts, 96 conjunts are in the unsatisfiable core [2022-03-01 17:02:20,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:20,886 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:20,886 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 17 treesize of output 21 [2022-03-01 17:02:20,970 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:20,971 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 17 treesize of output 21 [2022-03-01 17:02:21,191 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:21,191 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 17 treesize of output 21 [2022-03-01 17:02:21,345 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:21,345 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 17 treesize of output 21 [2022-03-01 17:02:21,486 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:21,486 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 17 treesize of output 21 [2022-03-01 17:02:21,638 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:21,638 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 17 treesize of output 21 [2022-03-01 17:02:21,813 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:21,814 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 17 treesize of output 21 [2022-03-01 17:02:22,083 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 17:02:22,083 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 14 [2022-03-01 17:02:22,383 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 17:02:22,383 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 14 [2022-03-01 17:02:22,668 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:22,668 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 17 treesize of output 21 [2022-03-01 17:02:22,971 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:22,971 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 17 treesize of output 21 [2022-03-01 17:02:23,410 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 17:02:23,411 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 14 [2022-03-01 17:02:24,232 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 17:02:24,233 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 17 treesize of output 21 [2022-03-01 17:02:24,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-01 17:02:24,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-01 17:02:24,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 17:02:24,768 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 17:02:24,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-03-01 17:02:24,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:24,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 17:02:25,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:25,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2022-03-01 17:02:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 1829 trivial. 0 not checked. [2022-03-01 17:02:25,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:07,628 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-01 17:04:07,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 51 [2022-03-01 17:04:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-01 17:04:07,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487966195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:07,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:07,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 39 [2022-03-01 17:04:07,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427280394] [2022-03-01 17:04:07,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:07,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 17:04:07,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 17:04:07,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1280, Unknown=7, NotChecked=0, Total=1560 [2022-03-01 17:04:07,727 INFO L87 Difference]: Start difference. First operand 19015 states and 37348 transitions. Second operand has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:14,964 INFO L93 Difference]: Finished difference Result 45235 states and 89758 transitions. [2022-03-01 17:04:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-01 17:04:14,964 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 566 [2022-03-01 17:04:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:15,045 INFO L225 Difference]: With dead ends: 45235 [2022-03-01 17:04:15,045 INFO L226 Difference]: Without dead ends: 45235 [2022-03-01 17:04:15,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 1146 SyntacticMatches, 22 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 79.9s TimeCoverageRelationStatistics Valid=2233, Invalid=7462, Unknown=7, NotChecked=0, Total=9702 [2022-03-01 17:04:15,052 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 5215 mSDsluCounter, 6450 mSDsCounter, 0 mSdLazyCounter, 6314 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 7002 SdHoareTripleChecker+Invalid, 10572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 6314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3470 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:15,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5215 Valid, 7002 Invalid, 10572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 6314 Invalid, 0 Unknown, 3470 Unchecked, 3.9s Time] [2022-03-01 17:04:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45235 states. [2022-03-01 17:04:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45235 to 15388. [2022-03-01 17:04:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15388 states, 15333 states have (on average 1.9639339985651862) internal successors, (30113), 15387 states have internal predecessors, (30113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15388 states to 15388 states and 30113 transitions. [2022-03-01 17:04:15,454 INFO L78 Accepts]: Start accepts. Automaton has 15388 states and 30113 transitions. Word has length 566 [2022-03-01 17:04:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:15,454 INFO L470 AbstractCegarLoop]: Abstraction has 15388 states and 30113 transitions. [2022-03-01 17:04:15,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15388 states and 30113 transitions. [2022-03-01 17:04:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-01 17:04:15,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:15,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:15,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:15,681 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-01 17:04:15,682 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-01 17:04:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1410440418, now seen corresponding path program 3 times [2022-03-01 17:04:15,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:15,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610650908] [2022-03-01 17:04:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2022-03-01 17:04:16,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:16,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610650908] [2022-03-01 17:04:16,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610650908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:16,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439467316] [2022-03-01 17:04:16,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 17:04:16,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:16,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:16,751 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-01 17:07:54,785 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:07:54,799 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-01 17:07:55,986 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-01 17:07:56,000 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-01 17:07:56,027 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-01 17:07:56,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-01 17:07:56,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-03-01 17:07:56,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964128225] [2022-03-01 17:07:56,027 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-01 17:07:56,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-01 17:07:56,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:07:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-01 17:07:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-01 17:07:56,028 INFO L87 Difference]: Start difference. First operand 15388 states and 30113 transitions. Second operand has 17 states, 16 states have (on average 12.3125) internal successors, (197), 17 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:07:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 17:07:56,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-01 17:07:56,030 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-01 17:07:56,030 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-01 17:07:56,030 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-01 17:07:56,031 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 137 [2022-03-01 17:07:56,036 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-01 17:07:56,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-03-01 17:07:56,039 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-01 17:07:56,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-01 17:07:56,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-01 17:07:56,043 INFO L732 BasicCegarLoop]: Path program histogram: [28, 21, 15, 12, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:07:56,045 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 17:07:56,045 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:07:56,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:07:56 BasicIcfg [2022-03-01 17:07:56,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:07:56,047 INFO L158 Benchmark]: Toolchain (without parser) took 857998.92ms. Allocated memory was 195.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 138.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 578.7MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,047 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:07:56,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.50ms. Allocated memory is still 195.0MB. Free memory was 138.4MB in the beginning and 139.0MB in the end (delta: -597.8kB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,038 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-01 17:07:56,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.88ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 134.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,048 INFO L158 Benchmark]: Boogie Preprocessor took 62.37ms. Allocated memory is still 195.0MB. Free memory was 134.8MB in the beginning and 131.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,048 INFO L158 Benchmark]: RCFGBuilder took 572.58ms. Allocated memory is still 195.0MB. Free memory was 131.1MB in the beginning and 103.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,048 INFO L158 Benchmark]: TraceAbstraction took 856744.81ms. Allocated memory was 195.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 102.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 542.9MB. Max. memory is 8.0GB. [2022-03-01 17:07:56,048 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.50ms. Allocated memory is still 195.0MB. Free memory was 138.4MB in the beginning and 139.0MB in the end (delta: -597.8kB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.88ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 134.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.37ms. Allocated memory is still 195.0MB. Free memory was 134.8MB in the beginning and 131.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 572.58ms. Allocated memory is still 195.0MB. Free memory was 131.1MB in the beginning and 103.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 856744.81ms. Allocated memory was 195.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 102.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 542.9MB. 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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 (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 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: 856.6s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.3s, AutomataDifference: 105.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72746 SdHoareTripleChecker+Valid, 82.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72746 mSDsluCounter, 315122 SdHoareTripleChecker+Invalid, 67.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4151 IncrementalHoareTripleChecker+Unchecked, 253346 mSDsCounter, 5733 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187576 IncrementalHoareTripleChecker+Invalid, 197460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5733 mSolverCounterUnsat, 61921 mSDtfsCounter, 187576 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8590 GetRequests, 6438 SyntacticMatches, 72 SemanticMatches, 2080 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16736 ImplicationChecksByTransitivity, 111.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19015occurred in iteration=99, InterpolantAutomatonStates: 1798, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.1s AutomataMinimizationTime, 100 MinimizatonAttempts, 490006 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 295.5s SatisfiabilityAnalysisTime, 193.8s InterpolantComputationTime, 50262 NumberOfCodeBlocks, 49032 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 51900 ConstructedInterpolants, 639 QuantifiedInterpolants, 216362 SizeOfPredicates, 109 NumberOfNonLiveVariables, 11307 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 179661/190571 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