/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_13-arraycollapse_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:11:32,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:11:32,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:11:32,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:11:32,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:11:32,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:11:32,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:11:32,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:11:32,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:11:32,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:11:32,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:11:32,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:11:32,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:11:32,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:11:32,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:11:32,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:11:32,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:11:32,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:11:32,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:11:32,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:11:32,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:11:32,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:11:32,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:11:32,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:11:32,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:11:32,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:11:32,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:11:32,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:11:32,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:11:32,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:11:32,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:11:32,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:11:32,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:11:32,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:11:32,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:11:32,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:11:32,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:11:32,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:11:32,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:11:32,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:11:32,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:11:32,794 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-15 15:11:32,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:11:32,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:11:32,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:11:32,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:11:32,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:11:32,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:11:32,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:11:32,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:11:32,820 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:11:32,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:11:32,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:11:32,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:11:32,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:11:32,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:11:32,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:11:32,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:11:32,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:11:32,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:11:32,824 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-15 15:11:33,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:11:33,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:11:33,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:11:33,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:11:33,033 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:11:33,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2022-03-15 15:11:33,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e0f771/2654773b0d5f45c3a800a8fcaa234285/FLAGd7c8ead34 [2022-03-15 15:11:33,557 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:11:33,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2022-03-15 15:11:33,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e0f771/2654773b0d5f45c3a800a8fcaa234285/FLAGd7c8ead34 [2022-03-15 15:11:34,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e0f771/2654773b0d5f45c3a800a8fcaa234285 [2022-03-15 15:11:34,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:11:34,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:11:34,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:11:34,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:11:34,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:11:34,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ff2fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34, skipping insertion in model container [2022-03-15 15:11:34,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:11:34,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:11:34,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:11:34,470 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:11:34,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:11:34,546 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:11:34,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34 WrapperNode [2022-03-15 15:11:34,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:11:34,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:11:34,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:11:34,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:11:34,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,597 INFO L137 Inliner]: procedures = 371, calls = 47, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 448 [2022-03-15 15:11:34,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:11:34,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:11:34,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:11:34,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:11:34,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:11:34,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:11:34,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:11:34,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:11:34,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (1/1) ... [2022-03-15 15:11:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:11:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:34,684 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-15 15:11:34,691 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-15 15:11:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:11:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 15:11:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:11:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:11:34,717 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:11:34,890 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:11:34,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:11:35,473 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:11:35,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:11:35,486 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 15:11:35,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:11:35 BoogieIcfgContainer [2022-03-15 15:11:35,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:11:35,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:11:35,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:11:35,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:11:35,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:11:34" (1/3) ... [2022-03-15 15:11:35,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d032d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:11:35, skipping insertion in model container [2022-03-15 15:11:35,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:11:34" (2/3) ... [2022-03-15 15:11:35,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d032d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:11:35, skipping insertion in model container [2022-03-15 15:11:35,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:11:35" (3/3) ... [2022-03-15 15:11:35,495 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2022-03-15 15:11:35,498 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:11:35,498 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:11:35,498 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-03-15 15:11:35,498 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:11:35,562 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,571 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,589 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,589 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,589 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,590 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,603 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-15 15:11:35,604 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-15 15:11:35,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,605 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-15 15:11:35,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 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-15 15:11:35,606 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-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 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-15 15:11:35,606 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-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 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-15 15:11:35,606 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-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 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-15 15:11:35,606 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-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 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-15 15:11:35,607 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-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 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-15 15:11:35,607 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-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 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-15 15:11:35,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 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-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 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-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 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-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 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-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,625 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,625 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-15 15:11:35,626 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-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 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-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,627 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-15 15:11:35,627 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-15 15:11:35,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 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-15 15:11:35,629 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-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,629 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-15 15:11:35,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:11:35,631 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:11:35,669 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:11:35,674 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-15 15:11:35,674 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-03-15 15:11:35,690 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 544 places, 545 transitions, 1095 flow [2022-03-15 15:11:35,771 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3687 states, 3630 states have (on average 1.893939393939394) internal successors, (6875), 3686 states have internal predecessors, (6875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 3687 states, 3630 states have (on average 1.893939393939394) internal successors, (6875), 3686 states have internal predecessors, (6875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 15:11:35,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:35,787 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] [2022-03-15 15:11:35,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash -257997757, now seen corresponding path program 1 times [2022-03-15 15:11:35,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:35,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475145319] [2022-03-15 15:11:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:35,961 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-15 15:11:35,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:35,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475145319] [2022-03-15 15:11:35,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475145319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:35,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:35,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:11:35,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814174891] [2022-03-15 15:11:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:35,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 15:11:35,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:36,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 15:11:36,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:11:36,022 INFO L87 Difference]: Start difference. First operand has 3687 states, 3630 states have (on average 1.893939393939394) internal successors, (6875), 3686 states have internal predecessors, (6875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:36,092 INFO L93 Difference]: Finished difference Result 3687 states and 6834 transitions. [2022-03-15 15:11:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 15:11:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-03-15 15:11:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:36,126 INFO L225 Difference]: With dead ends: 3687 [2022-03-15 15:11:36,126 INFO L226 Difference]: Without dead ends: 3676 [2022-03-15 15:11:36,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:11:36,130 INFO L933 BasicCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:36,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 539 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:11:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-03-15 15:11:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3676. [2022-03-15 15:11:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 3616 states have (on average 1.8844026548672566) internal successors, (6814), 3675 states have internal predecessors, (6814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 6814 transitions. [2022-03-15 15:11:36,265 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 6814 transitions. Word has length 56 [2022-03-15 15:11:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:36,266 INFO L470 AbstractCegarLoop]: Abstraction has 3676 states and 6814 transitions. [2022-03-15 15:11:36,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 6814 transitions. [2022-03-15 15:11:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 15:11:36,269 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:36,269 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] [2022-03-15 15:11:36,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:11:36,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1692302498, now seen corresponding path program 1 times [2022-03-15 15:11:36,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:36,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842978281] [2022-03-15 15:11:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:36,362 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-15 15:11:36,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:36,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842978281] [2022-03-15 15:11:36,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842978281] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:36,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:36,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:11:36,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182032217] [2022-03-15 15:11:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:36,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:11:36,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:11:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:11:36,364 INFO L87 Difference]: Start difference. First operand 3676 states and 6814 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:36,400 INFO L93 Difference]: Finished difference Result 3680 states and 6818 transitions. [2022-03-15 15:11:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:11:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-03-15 15:11:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:36,411 INFO L225 Difference]: With dead ends: 3680 [2022-03-15 15:11:36,411 INFO L226 Difference]: Without dead ends: 3680 [2022-03-15 15:11:36,412 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-15 15:11:36,414 INFO L933 BasicCegarLoop]: 534 mSDtfsCounter, 3 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:36,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1064 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:11:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2022-03-15 15:11:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3677. [2022-03-15 15:11:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3617 states have (on average 1.8841581421067182) internal successors, (6815), 3676 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 6815 transitions. [2022-03-15 15:11:36,519 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 6815 transitions. Word has length 56 [2022-03-15 15:11:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:36,519 INFO L470 AbstractCegarLoop]: Abstraction has 3677 states and 6815 transitions. [2022-03-15 15:11:36,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 6815 transitions. [2022-03-15 15:11:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 15:11:36,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:36,521 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] [2022-03-15 15:11:36,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:11:36,523 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1449414752, now seen corresponding path program 1 times [2022-03-15 15:11:36,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:36,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487756908] [2022-03-15 15:11:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:36,597 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-15 15:11:36,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:36,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487756908] [2022-03-15 15:11:36,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487756908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:36,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677682287] [2022-03-15 15:11:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:36,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:36,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:36,599 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-15 15:11:36,604 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-15 15:11:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:36,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:11:36,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:36,815 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-15 15:11:36,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:11:36,906 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-15 15:11:36,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677682287] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:36,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:36,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:11:36,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601203089] [2022-03-15 15:11:36,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:36,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:11:36,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:11:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:11:36,908 INFO L87 Difference]: Start difference. First operand 3677 states and 6815 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:36,976 INFO L93 Difference]: Finished difference Result 3687 states and 6825 transitions. [2022-03-15 15:11:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:11:36,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-03-15 15:11:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:36,986 INFO L225 Difference]: With dead ends: 3687 [2022-03-15 15:11:36,986 INFO L226 Difference]: Without dead ends: 3687 [2022-03-15 15:11:36,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 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-15 15:11:36,987 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 10 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:36,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 3718 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:11:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2022-03-15 15:11:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3687. [2022-03-15 15:11:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3627 states have (on average 1.881720430107527) internal successors, (6825), 3686 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 6825 transitions. [2022-03-15 15:11:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 6825 transitions. Word has length 61 [2022-03-15 15:11:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:37,049 INFO L470 AbstractCegarLoop]: Abstraction has 3687 states and 6825 transitions. [2022-03-15 15:11:37,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 6825 transitions. [2022-03-15 15:11:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-15 15:11:37,050 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:37,050 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:37,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 15:11:37,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:37,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1931076000, now seen corresponding path program 2 times [2022-03-15 15:11:37,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:37,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130891691] [2022-03-15 15:11:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:37,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:37,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130891691] [2022-03-15 15:11:37,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130891691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:37,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104341763] [2022-03-15 15:11:37,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:11:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:37,391 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-15 15:11:37,392 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-15 15:11:37,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:11:37,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:11:37,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 15:11:37,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:37,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:11:37,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,585 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-15 15:11:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:11:37,616 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-15 15:11:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:37,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:11:37,656 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-15 15:11:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 15:11:37,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:11:37,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104341763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:37,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:11:37,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-15 15:11:37,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174609151] [2022-03-15 15:11:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:37,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 15:11:37,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 15:11:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:11:37,680 INFO L87 Difference]: Start difference. First operand 3687 states and 6825 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:38,141 INFO L93 Difference]: Finished difference Result 3681 states and 6819 transitions. [2022-03-15 15:11:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:11:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-03-15 15:11:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:38,152 INFO L225 Difference]: With dead ends: 3681 [2022-03-15 15:11:38,152 INFO L226 Difference]: Without dead ends: 3681 [2022-03-15 15:11:38,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 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-15 15:11:38,153 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 450 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:38,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 1386 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:11:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2022-03-15 15:11:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3681. [2022-03-15 15:11:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3627 states have (on average 1.8800661703887511) internal successors, (6819), 3680 states have internal predecessors, (6819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6819 transitions. [2022-03-15 15:11:38,235 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6819 transitions. Word has length 71 [2022-03-15 15:11:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:38,235 INFO L470 AbstractCegarLoop]: Abstraction has 3681 states and 6819 transitions. [2022-03-15 15:11:38,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6819 transitions. [2022-03-15 15:11:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-15 15:11:38,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:38,236 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:38,260 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-15 15:11:38,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 15:11:38,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash -68153791, now seen corresponding path program 1 times [2022-03-15 15:11:38,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:38,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996890624] [2022-03-15 15:11:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:38,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:38,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996890624] [2022-03-15 15:11:38,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996890624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:38,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032076185] [2022-03-15 15:11:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:38,544 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-15 15:11:38,545 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-15 15:11:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:38,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 15:11:38,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:38,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:11:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:38,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032076185] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:38,885 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:38,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 15:11:38,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272081985] [2022-03-15 15:11:38,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:38,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:11:38,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:11:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:11:38,887 INFO L87 Difference]: Start difference. First operand 3681 states and 6819 transitions. Second operand has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:39,030 INFO L93 Difference]: Finished difference Result 3701 states and 6839 transitions. [2022-03-15 15:11:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:11:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-03-15 15:11:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:39,040 INFO L225 Difference]: With dead ends: 3701 [2022-03-15 15:11:39,040 INFO L226 Difference]: Without dead ends: 3701 [2022-03-15 15:11:39,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 149 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-15 15:11:39,041 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 30 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:39,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 2629 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:11:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2022-03-15 15:11:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3701. [2022-03-15 15:11:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3647 states have (on average 1.8752399232245682) internal successors, (6839), 3700 states have internal predecessors, (6839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 6839 transitions. [2022-03-15 15:11:39,097 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 6839 transitions. Word has length 79 [2022-03-15 15:11:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:39,097 INFO L470 AbstractCegarLoop]: Abstraction has 3701 states and 6839 transitions. [2022-03-15 15:11:39,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 6839 transitions. [2022-03-15 15:11:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-15 15:11:39,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:39,098 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:39,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 15:11:39,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:39,314 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1626800321, now seen corresponding path program 2 times [2022-03-15 15:11:39,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:39,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609202825] [2022-03-15 15:11:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:39,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:39,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609202825] [2022-03-15 15:11:39,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609202825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:39,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561841262] [2022-03-15 15:11:39,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:11:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:39,491 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-15 15:11:39,495 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-15 15:11:39,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:11:39,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:11:39,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 15:11:39,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:39,688 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-15 15:11:39,709 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 15:11:39,709 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-15 15:11:39,749 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-15 15:11:39,749 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-15 15:11:39,785 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-15 15:11:39,785 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-15 15:11:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-15 15:11:39,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:11:39,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561841262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:39,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:11:39,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-15 15:11:39,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128113983] [2022-03-15 15:11:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:39,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:39,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:11:39,805 INFO L87 Difference]: Start difference. First operand 3701 states and 6839 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:40,141 INFO L93 Difference]: Finished difference Result 3695 states and 6833 transitions. [2022-03-15 15:11:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-03-15 15:11:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:40,153 INFO L225 Difference]: With dead ends: 3695 [2022-03-15 15:11:40,153 INFO L226 Difference]: Without dead ends: 3695 [2022-03-15 15:11:40,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 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-15 15:11:40,154 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 18 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:40,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1023 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2022-03-15 15:11:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3695. [2022-03-15 15:11:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 3647 states have (on average 1.8735947353989582) internal successors, (6833), 3694 states have internal predecessors, (6833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 6833 transitions. [2022-03-15 15:11:40,207 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 6833 transitions. Word has length 99 [2022-03-15 15:11:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:40,208 INFO L470 AbstractCegarLoop]: Abstraction has 3695 states and 6833 transitions. [2022-03-15 15:11:40,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 6833 transitions. [2022-03-15 15:11:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 15:11:40,210 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:40,210 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:40,237 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-15 15:11:40,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:40,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1669580051, now seen corresponding path program 1 times [2022-03-15 15:11:40,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:40,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10257946] [2022-03-15 15:11:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:40,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:40,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10257946] [2022-03-15 15:11:40,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10257946] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:40,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761957573] [2022-03-15 15:11:40,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:40,563 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-15 15:11:40,564 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-15 15:11:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:40,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 15:11:40,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:40,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:11:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:11:41,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761957573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:41,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:41,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-15 15:11:41,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283425925] [2022-03-15 15:11:41,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:41,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:11:41,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:11:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:11:41,081 INFO L87 Difference]: Start difference. First operand 3695 states and 6833 transitions. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:41,323 INFO L93 Difference]: Finished difference Result 3710 states and 6848 transitions. [2022-03-15 15:11:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:11:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-03-15 15:11:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:41,334 INFO L225 Difference]: With dead ends: 3710 [2022-03-15 15:11:41,334 INFO L226 Difference]: Without dead ends: 3710 [2022-03-15 15:11:41,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:11:41,335 INFO L933 BasicCegarLoop]: 521 mSDtfsCounter, 49 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:41,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 4160 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:11:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2022-03-15 15:11:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2022-03-15 15:11:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3662 states have (on average 1.87001638448935) internal successors, (6848), 3709 states have internal predecessors, (6848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 6848 transitions. [2022-03-15 15:11:41,384 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 6848 transitions. Word has length 110 [2022-03-15 15:11:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:41,384 INFO L470 AbstractCegarLoop]: Abstraction has 3710 states and 6848 transitions. [2022-03-15 15:11:41,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 6848 transitions. [2022-03-15 15:11:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-03-15 15:11:41,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:41,385 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:41,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 15:11:41,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:41,605 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1015990933, now seen corresponding path program 2 times [2022-03-15 15:11:41,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:41,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075945799] [2022-03-15 15:11:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:41,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:41,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075945799] [2022-03-15 15:11:41,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075945799] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:41,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:41,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:41,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111898660] [2022-03-15 15:11:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:41,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:41,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:41,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:41,686 INFO L87 Difference]: Start difference. First operand 3710 states and 6848 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:42,054 INFO L93 Difference]: Finished difference Result 3709 states and 6847 transitions. [2022-03-15 15:11:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:42,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-03-15 15:11:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:42,064 INFO L225 Difference]: With dead ends: 3709 [2022-03-15 15:11:42,065 INFO L226 Difference]: Without dead ends: 3709 [2022-03-15 15:11:42,065 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-15 15:11:42,065 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 4 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:42,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1375 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-03-15 15:11:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-03-15 15:11:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 3662 states have (on average 1.8697433096668488) internal successors, (6847), 3708 states have internal predecessors, (6847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 6847 transitions. [2022-03-15 15:11:42,113 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 6847 transitions. Word has length 125 [2022-03-15 15:11:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:42,113 INFO L470 AbstractCegarLoop]: Abstraction has 3709 states and 6847 transitions. [2022-03-15 15:11:42,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 6847 transitions. [2022-03-15 15:11:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-15 15:11:42,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:42,114 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:42,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 15:11:42,114 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1549401803, now seen corresponding path program 1 times [2022-03-15 15:11:42,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:42,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531111025] [2022-03-15 15:11:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:42,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:42,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531111025] [2022-03-15 15:11:42,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531111025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:42,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:42,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:42,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166939543] [2022-03-15 15:11:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:42,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:42,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:42,244 INFO L87 Difference]: Start difference. First operand 3709 states and 6847 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 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-15 15:11:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:42,768 INFO L93 Difference]: Finished difference Result 5595 states and 10526 transitions. [2022-03-15 15:11:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 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 160 [2022-03-15 15:11:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:42,781 INFO L225 Difference]: With dead ends: 5595 [2022-03-15 15:11:42,781 INFO L226 Difference]: Without dead ends: 5595 [2022-03-15 15:11:42,781 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-15 15:11:42,782 INFO L933 BasicCegarLoop]: 683 mSDtfsCounter, 387 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:42,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 1369 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:11:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2022-03-15 15:11:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 3939. [2022-03-15 15:11:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3895 states have (on average 1.8754813863928113) internal successors, (7305), 3938 states have internal predecessors, (7305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 7305 transitions. [2022-03-15 15:11:42,843 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 7305 transitions. Word has length 160 [2022-03-15 15:11:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:42,843 INFO L470 AbstractCegarLoop]: Abstraction has 3939 states and 7305 transitions. [2022-03-15 15:11:42,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 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-15 15:11:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 7305 transitions. [2022-03-15 15:11:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-03-15 15:11:42,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:42,844 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:42,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:11:42,844 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -636306673, now seen corresponding path program 1 times [2022-03-15 15:11:42,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:42,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179020513] [2022-03-15 15:11:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:42,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:42,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179020513] [2022-03-15 15:11:42,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179020513] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:42,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:42,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:42,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215444776] [2022-03-15 15:11:42,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:42,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:42,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:42,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:42,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:42,924 INFO L87 Difference]: Start difference. First operand 3939 states and 7305 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:43,292 INFO L93 Difference]: Finished difference Result 3935 states and 7301 transitions. [2022-03-15 15:11:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-03-15 15:11:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:43,298 INFO L225 Difference]: With dead ends: 3935 [2022-03-15 15:11:43,298 INFO L226 Difference]: Without dead ends: 3935 [2022-03-15 15:11:43,298 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-15 15:11:43,298 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 20 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:43,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1319 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2022-03-15 15:11:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3935. [2022-03-15 15:11:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3895 states have (on average 1.874454428754814) internal successors, (7301), 3934 states have internal predecessors, (7301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 7301 transitions. [2022-03-15 15:11:43,344 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 7301 transitions. Word has length 171 [2022-03-15 15:11:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:43,344 INFO L470 AbstractCegarLoop]: Abstraction has 3935 states and 7301 transitions. [2022-03-15 15:11:43,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 7301 transitions. [2022-03-15 15:11:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-15 15:11:43,345 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:43,345 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:43,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:11:43,346 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1020979992, now seen corresponding path program 1 times [2022-03-15 15:11:43,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:43,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103425421] [2022-03-15 15:11:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:43,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:43,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103425421] [2022-03-15 15:11:43,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103425421] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:43,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:43,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:43,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202871030] [2022-03-15 15:11:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:43,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:43,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:43,461 INFO L87 Difference]: Start difference. First operand 3935 states and 7301 transitions. Second operand has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:43,740 INFO L93 Difference]: Finished difference Result 3931 states and 7297 transitions. [2022-03-15 15:11:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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-15 15:11:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:43,747 INFO L225 Difference]: With dead ends: 3931 [2022-03-15 15:11:43,747 INFO L226 Difference]: Without dead ends: 3931 [2022-03-15 15:11:43,747 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-15 15:11:43,748 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 8 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:43,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1056 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2022-03-15 15:11:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3931. [2022-03-15 15:11:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3895 states have (on average 1.8734274711168164) internal successors, (7297), 3930 states have internal predecessors, (7297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 7297 transitions. [2022-03-15 15:11:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 7297 transitions. Word has length 180 [2022-03-15 15:11:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:43,796 INFO L470 AbstractCegarLoop]: Abstraction has 3931 states and 7297 transitions. [2022-03-15 15:11:43,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 7297 transitions. [2022-03-15 15:11:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-03-15 15:11:43,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:43,798 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:43,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 15:11:43,798 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2093019947, now seen corresponding path program 1 times [2022-03-15 15:11:43,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:43,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276681103] [2022-03-15 15:11:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:43,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:43,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276681103] [2022-03-15 15:11:43,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276681103] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:43,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:43,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:43,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809268883] [2022-03-15 15:11:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:43,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:43,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:43,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:43,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:43,910 INFO L87 Difference]: Start difference. First operand 3931 states and 7297 transitions. Second operand has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:44,269 INFO L93 Difference]: Finished difference Result 3927 states and 7293 transitions. [2022-03-15 15:11:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-03-15 15:11:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:44,276 INFO L225 Difference]: With dead ends: 3927 [2022-03-15 15:11:44,276 INFO L226 Difference]: Without dead ends: 3927 [2022-03-15 15:11:44,276 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-15 15:11:44,277 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 8 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:44,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1331 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2022-03-15 15:11:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3927. [2022-03-15 15:11:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3895 states have (on average 1.872400513478819) internal successors, (7293), 3926 states have internal predecessors, (7293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 7293 transitions. [2022-03-15 15:11:44,326 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 7293 transitions. Word has length 188 [2022-03-15 15:11:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:44,326 INFO L470 AbstractCegarLoop]: Abstraction has 3927 states and 7293 transitions. [2022-03-15 15:11:44,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 7293 transitions. [2022-03-15 15:11:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-03-15 15:11:44,328 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:44,328 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:44,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 15:11:44,328 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 633636591, now seen corresponding path program 1 times [2022-03-15 15:11:44,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:44,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495000433] [2022-03-15 15:11:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:44,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:44,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495000433] [2022-03-15 15:11:44,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495000433] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:44,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:44,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:44,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670193153] [2022-03-15 15:11:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:44,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:44,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:44,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:44,448 INFO L87 Difference]: Start difference. First operand 3927 states and 7293 transitions. Second operand has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:44,703 INFO L93 Difference]: Finished difference Result 3926 states and 7292 transitions. [2022-03-15 15:11:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2022-03-15 15:11:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:44,709 INFO L225 Difference]: With dead ends: 3926 [2022-03-15 15:11:44,710 INFO L226 Difference]: Without dead ends: 3926 [2022-03-15 15:11:44,710 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-15 15:11:44,710 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 6 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:44,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 1079 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:11:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2022-03-15 15:11:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3926. [2022-03-15 15:11:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3895 states have (on average 1.8721437740693196) internal successors, (7292), 3925 states have internal predecessors, (7292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 7292 transitions. [2022-03-15 15:11:44,778 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 7292 transitions. Word has length 226 [2022-03-15 15:11:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:44,779 INFO L470 AbstractCegarLoop]: Abstraction has 3926 states and 7292 transitions. [2022-03-15 15:11:44,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 7292 transitions. [2022-03-15 15:11:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-03-15 15:11:44,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:44,780 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:44,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 15:11:44,781 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -348415598, now seen corresponding path program 1 times [2022-03-15 15:11:44,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:44,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199129706] [2022-03-15 15:11:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:44,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:44,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199129706] [2022-03-15 15:11:44,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199129706] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:44,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:44,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:44,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277943542] [2022-03-15 15:11:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:44,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:44,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:44,898 INFO L87 Difference]: Start difference. First operand 3926 states and 7292 transitions. Second operand has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:45,236 INFO L93 Difference]: Finished difference Result 3924 states and 7290 transitions. [2022-03-15 15:11:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2022-03-15 15:11:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:45,242 INFO L225 Difference]: With dead ends: 3924 [2022-03-15 15:11:45,243 INFO L226 Difference]: Without dead ends: 3924 [2022-03-15 15:11:45,243 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-15 15:11:45,243 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 24 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:45,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1297 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-03-15 15:11:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3924. [2022-03-15 15:11:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3895 states have (on average 1.871630295250321) internal successors, (7290), 3923 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 7290 transitions. [2022-03-15 15:11:45,287 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 7290 transitions. Word has length 261 [2022-03-15 15:11:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:45,287 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 7290 transitions. [2022-03-15 15:11:45,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 7290 transitions. [2022-03-15 15:11:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2022-03-15 15:11:45,291 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:45,291 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:45,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 15:11:45,291 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -432432847, now seen corresponding path program 1 times [2022-03-15 15:11:45,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:45,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699107674] [2022-03-15 15:11:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:45,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:45,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699107674] [2022-03-15 15:11:45,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699107674] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:45,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:45,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:45,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635639447] [2022-03-15 15:11:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:45,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:45,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:45,502 INFO L87 Difference]: Start difference. First operand 3924 states and 7290 transitions. Second operand has 6 states, 5 states have (on average 80.0) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:45,854 INFO L93 Difference]: Finished difference Result 4284 states and 8004 transitions. [2022-03-15 15:11:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 80.0) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2022-03-15 15:11:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:45,862 INFO L225 Difference]: With dead ends: 4284 [2022-03-15 15:11:45,862 INFO L226 Difference]: Without dead ends: 4284 [2022-03-15 15:11:45,863 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-15 15:11:45,864 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 260 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:45,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1159 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:11:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-03-15 15:11:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4156. [2022-03-15 15:11:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 4128 states have (on average 1.877422480620155) internal successors, (7750), 4155 states have internal predecessors, (7750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 7750 transitions. [2022-03-15 15:11:45,911 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 7750 transitions. Word has length 445 [2022-03-15 15:11:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:45,911 INFO L470 AbstractCegarLoop]: Abstraction has 4156 states and 7750 transitions. [2022-03-15 15:11:45,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 80.0) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 7750 transitions. [2022-03-15 15:11:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2022-03-15 15:11:45,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:45,916 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:45,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 15:11:45,916 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1733883780, now seen corresponding path program 1 times [2022-03-15 15:11:45,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:45,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140189168] [2022-03-15 15:11:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:46,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:46,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140189168] [2022-03-15 15:11:46,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140189168] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:46,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:46,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:46,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102809005] [2022-03-15 15:11:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:46,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:46,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:46,097 INFO L87 Difference]: Start difference. First operand 4156 states and 7750 transitions. Second operand has 6 states, 5 states have (on average 82.0) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:46,526 INFO L93 Difference]: Finished difference Result 4892 states and 9145 transitions. [2022-03-15 15:11:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 82.0) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 455 [2022-03-15 15:11:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:46,534 INFO L225 Difference]: With dead ends: 4892 [2022-03-15 15:11:46,534 INFO L226 Difference]: Without dead ends: 4658 [2022-03-15 15:11:46,534 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-15 15:11:46,534 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 279 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:46,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 1450 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:11:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2022-03-15 15:11:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 4154. [2022-03-15 15:11:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 4127 states have (on average 1.8723043372910104) internal successors, (7727), 4153 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 7727 transitions. [2022-03-15 15:11:46,601 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 7727 transitions. Word has length 455 [2022-03-15 15:11:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:46,601 INFO L470 AbstractCegarLoop]: Abstraction has 4154 states and 7727 transitions. [2022-03-15 15:11:46,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 82.0) internal successors, (410), 6 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 7727 transitions. [2022-03-15 15:11:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2022-03-15 15:11:46,605 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:46,605 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:46,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 15:11:46,605 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1297242102, now seen corresponding path program 1 times [2022-03-15 15:11:46,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:46,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791570148] [2022-03-15 15:11:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:46,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:46,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791570148] [2022-03-15 15:11:46,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791570148] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:46,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:46,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:11:46,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717641700] [2022-03-15 15:11:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:46,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:11:46,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:11:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:11:46,771 INFO L87 Difference]: Start difference. First operand 4154 states and 7727 transitions. Second operand has 6 states, 5 states have (on average 82.2) internal successors, (411), 6 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:47,281 INFO L93 Difference]: Finished difference Result 4314 states and 8042 transitions. [2022-03-15 15:11:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:11:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 82.2) internal successors, (411), 6 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 456 [2022-03-15 15:11:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:47,291 INFO L225 Difference]: With dead ends: 4314 [2022-03-15 15:11:47,291 INFO L226 Difference]: Without dead ends: 4314 [2022-03-15 15:11:47,291 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-15 15:11:47,292 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 101 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:47,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 1575 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:11:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-03-15 15:11:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4273. [2022-03-15 15:11:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 4246 states have (on average 1.8749411210551108) internal successors, (7961), 4272 states have internal predecessors, (7961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 7961 transitions. [2022-03-15 15:11:47,341 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 7961 transitions. Word has length 456 [2022-03-15 15:11:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:47,341 INFO L470 AbstractCegarLoop]: Abstraction has 4273 states and 7961 transitions. [2022-03-15 15:11:47,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 82.2) internal successors, (411), 6 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 7961 transitions. [2022-03-15 15:11:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:11:47,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:47,344 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:47,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 15:11:47,344 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1209677241, now seen corresponding path program 1 times [2022-03-15 15:11:47,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:47,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302597639] [2022-03-15 15:11:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:48,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:48,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302597639] [2022-03-15 15:11:48,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302597639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:48,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:48,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-15 15:11:48,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222873176] [2022-03-15 15:11:48,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:48,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:11:48,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:11:48,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:11:48,231 INFO L87 Difference]: Start difference. First operand 4273 states and 7961 transitions. Second operand has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:49,948 INFO L93 Difference]: Finished difference Result 7416 states and 14115 transitions. [2022-03-15 15:11:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:11:49,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:11:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:49,965 INFO L225 Difference]: With dead ends: 7416 [2022-03-15 15:11:49,966 INFO L226 Difference]: Without dead ends: 7416 [2022-03-15 15:11:49,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2022-03-15 15:11:49,966 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 2323 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:49,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2323 Valid, 2723 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:11:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7416 states. [2022-03-15 15:11:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7416 to 4289. [2022-03-15 15:11:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 4262 states have (on average 1.8754106053496011) internal successors, (7993), 4288 states have internal predecessors, (7993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 7993 transitions. [2022-03-15 15:11:50,042 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 7993 transitions. Word has length 462 [2022-03-15 15:11:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:50,042 INFO L470 AbstractCegarLoop]: Abstraction has 4289 states and 7993 transitions. [2022-03-15 15:11:50,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 7993 transitions. [2022-03-15 15:11:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:11:50,045 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:50,045 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:50,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 15:11:50,045 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2103902397, now seen corresponding path program 2 times [2022-03-15 15:11:50,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:50,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547438929] [2022-03-15 15:11:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:50,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:50,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547438929] [2022-03-15 15:11:50,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547438929] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:50,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:50,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 15:11:50,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005768212] [2022-03-15 15:11:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:50,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 15:11:50,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 15:11:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:11:50,792 INFO L87 Difference]: Start difference. First operand 4289 states and 7993 transitions. Second operand has 13 states, 12 states have (on average 34.75) internal successors, (417), 13 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:52,340 INFO L93 Difference]: Finished difference Result 7523 states and 14329 transitions. [2022-03-15 15:11:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:11:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 34.75) internal successors, (417), 13 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:11:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:52,353 INFO L225 Difference]: With dead ends: 7523 [2022-03-15 15:11:52,354 INFO L226 Difference]: Without dead ends: 7523 [2022-03-15 15:11:52,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:11:52,354 INFO L933 BasicCegarLoop]: 594 mSDtfsCounter, 2001 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:52,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2001 Valid, 3034 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:11:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2022-03-15 15:11:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 4309. [2022-03-15 15:11:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4309 states, 4282 states have (on average 1.876226062587576) internal successors, (8034), 4308 states have internal predecessors, (8034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 8034 transitions. [2022-03-15 15:11:52,417 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 8034 transitions. Word has length 462 [2022-03-15 15:11:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:52,418 INFO L470 AbstractCegarLoop]: Abstraction has 4309 states and 8034 transitions. [2022-03-15 15:11:52,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 34.75) internal successors, (417), 13 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 8034 transitions. [2022-03-15 15:11:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:11:52,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:52,420 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:52,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 15:11:52,421 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -521677755, now seen corresponding path program 3 times [2022-03-15 15:11:52,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:52,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500312918] [2022-03-15 15:11:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:53,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:53,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500312918] [2022-03-15 15:11:53,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500312918] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:53,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:53,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 15:11:53,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260358770] [2022-03-15 15:11:53,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:53,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 15:11:53,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 15:11:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:11:53,029 INFO L87 Difference]: Start difference. First operand 4309 states and 8034 transitions. Second operand has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:54,875 INFO L93 Difference]: Finished difference Result 7606 states and 14494 transitions. [2022-03-15 15:11:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:11:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:11:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:54,888 INFO L225 Difference]: With dead ends: 7606 [2022-03-15 15:11:54,888 INFO L226 Difference]: Without dead ends: 7606 [2022-03-15 15:11:54,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:11:54,890 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 2694 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:54,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2694 Valid, 3268 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:11:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2022-03-15 15:11:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 4310. [2022-03-15 15:11:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4283 states have (on average 1.8762549614756012) internal successors, (8036), 4309 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 8036 transitions. [2022-03-15 15:11:54,965 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 8036 transitions. Word has length 462 [2022-03-15 15:11:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:54,966 INFO L470 AbstractCegarLoop]: Abstraction has 4310 states and 8036 transitions. [2022-03-15 15:11:54,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 8036 transitions. [2022-03-15 15:11:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:11:54,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:54,968 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:54,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 15:11:54,969 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1535549185, now seen corresponding path program 4 times [2022-03-15 15:11:54,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:54,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507720863] [2022-03-15 15:11:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:55,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:55,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507720863] [2022-03-15 15:11:55,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507720863] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:55,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:55,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 15:11:55,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593255846] [2022-03-15 15:11:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:55,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 15:11:55,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 15:11:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:11:55,601 INFO L87 Difference]: Start difference. First operand 4310 states and 8036 transitions. Second operand has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:57,418 INFO L93 Difference]: Finished difference Result 7623 states and 14529 transitions. [2022-03-15 15:11:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:11:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:11:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:57,428 INFO L225 Difference]: With dead ends: 7623 [2022-03-15 15:11:57,428 INFO L226 Difference]: Without dead ends: 7623 [2022-03-15 15:11:57,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 15:11:57,429 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1879 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:57,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1879 Valid, 3387 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:11:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2022-03-15 15:11:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 4329. [2022-03-15 15:11:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4329 states, 4302 states have (on average 1.8770339377033938) internal successors, (8075), 4328 states have internal predecessors, (8075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 8075 transitions. [2022-03-15 15:11:57,488 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 8075 transitions. Word has length 462 [2022-03-15 15:11:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:57,488 INFO L470 AbstractCegarLoop]: Abstraction has 4329 states and 8075 transitions. [2022-03-15 15:11:57,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 8075 transitions. [2022-03-15 15:11:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:11:57,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:57,491 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:57,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 15:11:57,491 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:11:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1403015747, now seen corresponding path program 5 times [2022-03-15 15:11:57,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:57,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965424302] [2022-03-15 15:11:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:58,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:58,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965424302] [2022-03-15 15:11:58,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965424302] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:58,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:58,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-15 15:11:58,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283251720] [2022-03-15 15:11:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:58,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 15:11:58,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 15:11:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:11:58,320 INFO L87 Difference]: Start difference. First operand 4329 states and 8075 transitions. Second operand has 27 states, 26 states have (on average 16.03846153846154) internal successors, (417), 27 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:01,437 INFO L93 Difference]: Finished difference Result 7659 states and 14600 transitions. [2022-03-15 15:12:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 15:12:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 16.03846153846154) internal successors, (417), 27 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:01,447 INFO L225 Difference]: With dead ends: 7659 [2022-03-15 15:12:01,447 INFO L226 Difference]: Without dead ends: 7659 [2022-03-15 15:12:01,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=932, Invalid=3100, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:12:01,448 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 3915 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 4610 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3915 SdHoareTripleChecker+Valid, 4649 SdHoareTripleChecker+Invalid, 5318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 4610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:01,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3915 Valid, 4649 Invalid, 5318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 4610 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 15:12:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2022-03-15 15:12:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 4331. [2022-03-15 15:12:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 4304 states have (on average 1.8770910780669146) internal successors, (8079), 4330 states have internal predecessors, (8079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 8079 transitions. [2022-03-15 15:12:01,508 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 8079 transitions. Word has length 462 [2022-03-15 15:12:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:01,509 INFO L470 AbstractCegarLoop]: Abstraction has 4331 states and 8079 transitions. [2022-03-15 15:12:01,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 16.03846153846154) internal successors, (417), 27 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 8079 transitions. [2022-03-15 15:12:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:01,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:01,512 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:01,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 15:12:01,512 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1878080119, now seen corresponding path program 6 times [2022-03-15 15:12:01,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:01,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735206342] [2022-03-15 15:12:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:02,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:02,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735206342] [2022-03-15 15:12:02,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735206342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:02,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:02,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 15:12:02,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561695963] [2022-03-15 15:12:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:02,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 15:12:02,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 15:12:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:12:02,102 INFO L87 Difference]: Start difference. First operand 4331 states and 8079 transitions. Second operand has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:03,621 INFO L93 Difference]: Finished difference Result 7801 states and 14884 transitions. [2022-03-15 15:12:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:12:03,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:03,631 INFO L225 Difference]: With dead ends: 7801 [2022-03-15 15:12:03,631 INFO L226 Difference]: Without dead ends: 7801 [2022-03-15 15:12:03,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=810, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 15:12:03,632 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 3109 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3109 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:03,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3109 Valid, 2971 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:12:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7801 states. [2022-03-15 15:12:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7801 to 4330. [2022-03-15 15:12:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4303 states have (on average 1.8770625145247501) internal successors, (8077), 4329 states have internal predecessors, (8077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 8077 transitions. [2022-03-15 15:12:03,697 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 8077 transitions. Word has length 462 [2022-03-15 15:12:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:03,697 INFO L470 AbstractCegarLoop]: Abstraction has 4330 states and 8077 transitions. [2022-03-15 15:12:03,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 23.166666666666668) internal successors, (417), 19 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 8077 transitions. [2022-03-15 15:12:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:03,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:03,700 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:03,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 15:12:03,700 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1635959675, now seen corresponding path program 7 times [2022-03-15 15:12:03,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:03,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865939768] [2022-03-15 15:12:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:04,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:04,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865939768] [2022-03-15 15:12:04,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865939768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:04,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:04,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-15 15:12:04,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164350908] [2022-03-15 15:12:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:04,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 15:12:04,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 15:12:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:12:04,242 INFO L87 Difference]: Start difference. First operand 4330 states and 8077 transitions. Second operand has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:05,983 INFO L93 Difference]: Finished difference Result 7724 states and 14731 transitions. [2022-03-15 15:12:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 15:12:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:05,993 INFO L225 Difference]: With dead ends: 7724 [2022-03-15 15:12:05,993 INFO L226 Difference]: Without dead ends: 7724 [2022-03-15 15:12:05,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2022-03-15 15:12:05,994 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 2491 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:05,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2491 Valid, 3319 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:12:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2022-03-15 15:12:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 4349. [2022-03-15 15:12:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4349 states, 4322 states have (on average 1.877834335955576) internal successors, (8116), 4348 states have internal predecessors, (8116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 8116 transitions. [2022-03-15 15:12:06,081 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 8116 transitions. Word has length 462 [2022-03-15 15:12:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:06,082 INFO L470 AbstractCegarLoop]: Abstraction has 4349 states and 8116 transitions. [2022-03-15 15:12:06,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 8116 transitions. [2022-03-15 15:12:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:06,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:06,086 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:06,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 15:12:06,086 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash -886141883, now seen corresponding path program 8 times [2022-03-15 15:12:06,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:06,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003855888] [2022-03-15 15:12:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:06,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:06,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003855888] [2022-03-15 15:12:06,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003855888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:06,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:06,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-15 15:12:06,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764077568] [2022-03-15 15:12:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:06,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 15:12:06,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 15:12:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:12:06,569 INFO L87 Difference]: Start difference. First operand 4349 states and 8116 transitions. Second operand has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:07,578 INFO L93 Difference]: Finished difference Result 7529 states and 14345 transitions. [2022-03-15 15:12:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:12:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:07,603 INFO L225 Difference]: With dead ends: 7529 [2022-03-15 15:12:07,604 INFO L226 Difference]: Without dead ends: 7529 [2022-03-15 15:12:07,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2022-03-15 15:12:07,604 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1797 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:07,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 2318 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:12:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2022-03-15 15:12:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 4347. [2022-03-15 15:12:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 4320 states have (on average 1.8777777777777778) internal successors, (8112), 4346 states have internal predecessors, (8112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 8112 transitions. [2022-03-15 15:12:07,691 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 8112 transitions. Word has length 462 [2022-03-15 15:12:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:07,691 INFO L470 AbstractCegarLoop]: Abstraction has 4347 states and 8112 transitions. [2022-03-15 15:12:07,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 29.785714285714285) internal successors, (417), 15 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 8112 transitions. [2022-03-15 15:12:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:07,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:07,694 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:07,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 15:12:07,695 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1900013313, now seen corresponding path program 9 times [2022-03-15 15:12:07,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:07,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453184465] [2022-03-15 15:12:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:08,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:08,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453184465] [2022-03-15 15:12:08,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453184465] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:08,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:08,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-15 15:12:08,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412943787] [2022-03-15 15:12:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:08,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 15:12:08,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 15:12:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:12:08,163 INFO L87 Difference]: Start difference. First operand 4347 states and 8112 transitions. Second operand has 17 states, 16 states have (on average 26.0625) internal successors, (417), 17 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:09,489 INFO L93 Difference]: Finished difference Result 7671 states and 14629 transitions. [2022-03-15 15:12:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:12:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 26.0625) internal successors, (417), 17 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:09,514 INFO L225 Difference]: With dead ends: 7671 [2022-03-15 15:12:09,515 INFO L226 Difference]: Without dead ends: 7671 [2022-03-15 15:12:09,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=729, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:12:09,516 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 2484 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2484 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:09,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2484 Valid, 2984 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states. [2022-03-15 15:12:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7671 to 4346. [2022-03-15 15:12:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 4319 states have (on average 1.8777494790460756) internal successors, (8110), 4345 states have internal predecessors, (8110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 8110 transitions. [2022-03-15 15:12:09,577 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 8110 transitions. Word has length 462 [2022-03-15 15:12:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:09,578 INFO L470 AbstractCegarLoop]: Abstraction has 4346 states and 8110 transitions. [2022-03-15 15:12:09,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 26.0625) internal successors, (417), 17 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 8110 transitions. [2022-03-15 15:12:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:09,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:09,581 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:09,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 15:12:09,581 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1119085811, now seen corresponding path program 10 times [2022-03-15 15:12:09,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:09,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525357427] [2022-03-15 15:12:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:10,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:10,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525357427] [2022-03-15 15:12:10,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525357427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:10,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:10,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-15 15:12:10,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605793403] [2022-03-15 15:12:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:10,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 15:12:10,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 15:12:10,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:12:10,128 INFO L87 Difference]: Start difference. First operand 4346 states and 8110 transitions. Second operand has 16 states, 15 states have (on average 27.8) internal successors, (417), 16 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:11,639 INFO L93 Difference]: Finished difference Result 7771 states and 14829 transitions. [2022-03-15 15:12:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:12:11,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 27.8) internal successors, (417), 16 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:11,648 INFO L225 Difference]: With dead ends: 7771 [2022-03-15 15:12:11,649 INFO L226 Difference]: Without dead ends: 7771 [2022-03-15 15:12:11,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 15:12:11,649 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 1450 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:11,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1450 Valid, 2565 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2022-03-15 15:12:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 4345. [2022-03-15 15:12:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4318 states have (on average 1.8777211672070402) internal successors, (8108), 4344 states have internal predecessors, (8108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 8108 transitions. [2022-03-15 15:12:11,701 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 8108 transitions. Word has length 462 [2022-03-15 15:12:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:11,702 INFO L470 AbstractCegarLoop]: Abstraction has 4345 states and 8108 transitions. [2022-03-15 15:12:11,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 27.8) internal successors, (417), 16 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 8108 transitions. [2022-03-15 15:12:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:11,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:11,705 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:11,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 15:12:11,705 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1019306323, now seen corresponding path program 11 times [2022-03-15 15:12:11,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:11,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115655900] [2022-03-15 15:12:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:12,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:12,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115655900] [2022-03-15 15:12:12,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115655900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:12,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:12,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-15 15:12:12,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828984215] [2022-03-15 15:12:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:12,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:12:12,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:12:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:12:12,340 INFO L87 Difference]: Start difference. First operand 4345 states and 8108 transitions. Second operand has 23 states, 22 states have (on average 18.954545454545453) internal successors, (417), 23 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:14,016 INFO L93 Difference]: Finished difference Result 4772 states and 8920 transitions. [2022-03-15 15:12:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:12:14,016 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 18.954545454545453) internal successors, (417), 23 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:14,022 INFO L225 Difference]: With dead ends: 4772 [2022-03-15 15:12:14,022 INFO L226 Difference]: Without dead ends: 4772 [2022-03-15 15:12:14,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=448, Invalid=1192, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:12:14,023 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 3540 mSDsluCounter, 3631 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3540 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:14,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3540 Valid, 4155 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:12:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2022-03-15 15:12:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4060. [2022-03-15 15:12:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4037 states have (on average 1.8664850136239781) internal successors, (7535), 4059 states have internal predecessors, (7535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 7535 transitions. [2022-03-15 15:12:14,064 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 7535 transitions. Word has length 462 [2022-03-15 15:12:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:14,064 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 7535 transitions. [2022-03-15 15:12:14,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 18.954545454545453) internal successors, (417), 23 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 7535 transitions. [2022-03-15 15:12:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2022-03-15 15:12:14,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:14,067 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:14,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 15:12:14,067 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:14,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -449768391, now seen corresponding path program 1 times [2022-03-15 15:12:14,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:14,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302543691] [2022-03-15 15:12:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:14,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:14,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302543691] [2022-03-15 15:12:14,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302543691] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:14,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:14,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-15 15:12:14,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388172356] [2022-03-15 15:12:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:14,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:12:14,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:12:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:12:14,615 INFO L87 Difference]: Start difference. First operand 4060 states and 7535 transitions. Second operand has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:15,315 INFO L93 Difference]: Finished difference Result 4085 states and 7584 transitions. [2022-03-15 15:12:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:12:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462 [2022-03-15 15:12:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:15,320 INFO L225 Difference]: With dead ends: 4085 [2022-03-15 15:12:15,320 INFO L226 Difference]: Without dead ends: 4085 [2022-03-15 15:12:15,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:12:15,321 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 1580 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:15,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1580 Valid, 2729 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:12:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2022-03-15 15:12:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4030. [2022-03-15 15:12:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4007 states have (on average 1.865485400549039) internal successors, (7475), 4029 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 7475 transitions. [2022-03-15 15:12:15,357 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 7475 transitions. Word has length 462 [2022-03-15 15:12:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:15,357 INFO L470 AbstractCegarLoop]: Abstraction has 4030 states and 7475 transitions. [2022-03-15 15:12:15,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 24.529411764705884) internal successors, (417), 18 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 7475 transitions. [2022-03-15 15:12:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2022-03-15 15:12:15,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:15,360 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:15,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 15:12:15,360 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1160222095, now seen corresponding path program 1 times [2022-03-15 15:12:15,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:15,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253080925] [2022-03-15 15:12:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:15,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:15,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253080925] [2022-03-15 15:12:15,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253080925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:15,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:15,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:12:15,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53048460] [2022-03-15 15:12:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:15,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:12:15,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:12:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:12:15,509 INFO L87 Difference]: Start difference. First operand 4030 states and 7475 transitions. Second operand has 6 states, 5 states have (on average 83.8) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:15,911 INFO L93 Difference]: Finished difference Result 4183 states and 7776 transitions. [2022-03-15 15:12:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:12:15,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 83.8) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 464 [2022-03-15 15:12:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:15,916 INFO L225 Difference]: With dead ends: 4183 [2022-03-15 15:12:15,916 INFO L226 Difference]: Without dead ends: 4183 [2022-03-15 15:12:15,916 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-15 15:12:15,916 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 98 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:15,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 1539 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:12:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2022-03-15 15:12:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4146. [2022-03-15 15:12:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4146 states, 4123 states have (on average 1.8682997817123455) internal successors, (7703), 4145 states have internal predecessors, (7703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 7703 transitions. [2022-03-15 15:12:15,980 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 7703 transitions. Word has length 464 [2022-03-15 15:12:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:15,981 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 7703 transitions. [2022-03-15 15:12:15,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 83.8) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 7703 transitions. [2022-03-15 15:12:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:12:15,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:15,984 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:15,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 15:12:15,984 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -947779244, now seen corresponding path program 1 times [2022-03-15 15:12:15,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:15,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712292456] [2022-03-15 15:12:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:20,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:20,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712292456] [2022-03-15 15:12:20,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712292456] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:20,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:20,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-03-15 15:12:20,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214470730] [2022-03-15 15:12:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:20,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 15:12:20,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 15:12:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3728, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 15:12:20,515 INFO L87 Difference]: Start difference. First operand 4146 states and 7703 transitions. Second operand has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:41,083 INFO L93 Difference]: Finished difference Result 5687 states and 10742 transitions. [2022-03-15 15:12:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 15:12:41,083 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:12:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:41,090 INFO L225 Difference]: With dead ends: 5687 [2022-03-15 15:12:41,090 INFO L226 Difference]: Without dead ends: 5687 [2022-03-15 15:12:41,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6266 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4118, Invalid=20062, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 15:12:41,094 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 7307 mSDsluCounter, 10322 mSDsCounter, 0 mSdLazyCounter, 10982 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7307 SdHoareTripleChecker+Valid, 10785 SdHoareTripleChecker+Invalid, 11757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 10982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:41,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7307 Valid, 10785 Invalid, 11757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 10982 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 15:12:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2022-03-15 15:12:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 4152. [2022-03-15 15:12:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4129 states have (on average 1.868491160087188) internal successors, (7715), 4151 states have internal predecessors, (7715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 7715 transitions. [2022-03-15 15:12:41,156 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 7715 transitions. Word has length 468 [2022-03-15 15:12:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:41,156 INFO L470 AbstractCegarLoop]: Abstraction has 4152 states and 7715 transitions. [2022-03-15 15:12:41,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 7715 transitions. [2022-03-15 15:12:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:12:41,159 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:41,159 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:41,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 15:12:41,159 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash -955966964, now seen corresponding path program 2 times [2022-03-15 15:12:41,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:41,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018624569] [2022-03-15 15:12:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:44,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:44,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018624569] [2022-03-15 15:12:44,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018624569] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:44,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:44,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:12:44,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465867107] [2022-03-15 15:12:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:44,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:12:44,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:12:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3437, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:12:44,578 INFO L87 Difference]: Start difference. First operand 4152 states and 7715 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:53,488 INFO L93 Difference]: Finished difference Result 5562 states and 10494 transitions. [2022-03-15 15:12:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 15:12:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:12:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:53,494 INFO L225 Difference]: With dead ends: 5562 [2022-03-15 15:12:53,494 INFO L226 Difference]: Without dead ends: 5562 [2022-03-15 15:12:53,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4544 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3162, Invalid=14394, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 15:12:53,496 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 7378 mSDsluCounter, 9200 mSDsCounter, 0 mSdLazyCounter, 9743 mSolverCounterSat, 808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7378 SdHoareTripleChecker+Valid, 9669 SdHoareTripleChecker+Invalid, 10551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 9743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:53,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7378 Valid, 9669 Invalid, 10551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 9743 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 15:12:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2022-03-15 15:12:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4158. [2022-03-15 15:12:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4135 states have (on average 1.8686819830713421) internal successors, (7727), 4157 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 7727 transitions. [2022-03-15 15:12:53,544 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 7727 transitions. Word has length 468 [2022-03-15 15:12:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:53,545 INFO L470 AbstractCegarLoop]: Abstraction has 4158 states and 7727 transitions. [2022-03-15 15:12:53,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 7727 transitions. [2022-03-15 15:12:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:12:53,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:53,548 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:53,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 15:12:53,548 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:12:53,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -956306414, now seen corresponding path program 3 times [2022-03-15 15:12:53,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:53,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076259078] [2022-03-15 15:12:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:56,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:56,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076259078] [2022-03-15 15:12:56,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076259078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:56,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:56,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:12:56,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022030445] [2022-03-15 15:12:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:56,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:12:56,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:12:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3436, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:12:56,938 INFO L87 Difference]: Start difference. First operand 4158 states and 7727 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:04,481 INFO L93 Difference]: Finished difference Result 5570 states and 10510 transitions. [2022-03-15 15:13:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-15 15:13:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:13:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:04,488 INFO L225 Difference]: With dead ends: 5570 [2022-03-15 15:13:04,488 INFO L226 Difference]: Without dead ends: 5570 [2022-03-15 15:13:04,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2987, Invalid=13783, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 15:13:04,490 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 7695 mSDsluCounter, 6645 mSDsCounter, 0 mSdLazyCounter, 7134 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7695 SdHoareTripleChecker+Valid, 7078 SdHoareTripleChecker+Invalid, 7997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 7134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:04,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7695 Valid, 7078 Invalid, 7997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 7134 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 15:13:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2022-03-15 15:13:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 4167. [2022-03-15 15:13:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4167 states, 4144 states have (on average 1.8689671814671815) internal successors, (7745), 4166 states have internal predecessors, (7745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 7745 transitions. [2022-03-15 15:13:04,537 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 7745 transitions. Word has length 468 [2022-03-15 15:13:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:04,537 INFO L470 AbstractCegarLoop]: Abstraction has 4167 states and 7745 transitions. [2022-03-15 15:13:04,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 7745 transitions. [2022-03-15 15:13:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:13:04,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:04,540 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:04,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 15:13:04,541 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:13:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -225553970, now seen corresponding path program 4 times [2022-03-15 15:13:04,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:04,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837574239] [2022-03-15 15:13:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:07,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:07,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837574239] [2022-03-15 15:13:07,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837574239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:07,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:07,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:13:07,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307134047] [2022-03-15 15:13:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:07,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:13:07,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:07,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:13:07,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=3433, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:13:07,500 INFO L87 Difference]: Start difference. First operand 4167 states and 7745 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:16,150 INFO L93 Difference]: Finished difference Result 5581 states and 10532 transitions. [2022-03-15 15:13:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 15:13:16,151 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:13:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:16,157 INFO L225 Difference]: With dead ends: 5581 [2022-03-15 15:13:16,157 INFO L226 Difference]: Without dead ends: 5581 [2022-03-15 15:13:16,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4822 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3145, Invalid=15215, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 15:13:16,159 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 5223 mSDsluCounter, 6740 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 7177 SdHoareTripleChecker+Invalid, 7759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:16,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5223 Valid, 7177 Invalid, 7759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 15:13:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5581 states. [2022-03-15 15:13:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5581 to 4169. [2022-03-15 15:13:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4146 states have (on average 1.8690303907380608) internal successors, (7749), 4168 states have internal predecessors, (7749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 7749 transitions. [2022-03-15 15:13:16,207 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 7749 transitions. Word has length 468 [2022-03-15 15:13:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:16,207 INFO L470 AbstractCegarLoop]: Abstraction has 4169 states and 7749 transitions. [2022-03-15 15:13:16,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 7749 transitions. [2022-03-15 15:13:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:13:16,210 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:16,210 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:16,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 15:13:16,210 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:13:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1839120704, now seen corresponding path program 5 times [2022-03-15 15:13:16,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:16,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281618876] [2022-03-15 15:13:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:20,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:20,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281618876] [2022-03-15 15:13:20,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281618876] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:20,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:20,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:13:20,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258034178] [2022-03-15 15:13:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:20,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:13:20,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:13:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3684, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:13:20,303 INFO L87 Difference]: Start difference. First operand 4169 states and 7749 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:35,384 INFO L93 Difference]: Finished difference Result 5695 states and 10758 transitions. [2022-03-15 15:13:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:13:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:13:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:35,391 INFO L225 Difference]: With dead ends: 5695 [2022-03-15 15:13:35,391 INFO L226 Difference]: Without dead ends: 5695 [2022-03-15 15:13:35,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=3558, Invalid=17612, Unknown=0, NotChecked=0, Total=21170 [2022-03-15 15:13:35,392 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 6570 mSDsluCounter, 10066 mSDsCounter, 0 mSdLazyCounter, 10420 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6570 SdHoareTripleChecker+Valid, 10539 SdHoareTripleChecker+Invalid, 11142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 10420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:35,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6570 Valid, 10539 Invalid, 11142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 10420 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 15:13:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2022-03-15 15:13:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 4164. [2022-03-15 15:13:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4141 states have (on average 1.8688722530789665) internal successors, (7739), 4163 states have internal predecessors, (7739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 7739 transitions. [2022-03-15 15:13:35,433 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 7739 transitions. Word has length 468 [2022-03-15 15:13:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:35,433 INFO L470 AbstractCegarLoop]: Abstraction has 4164 states and 7739 transitions. [2022-03-15 15:13:35,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 7739 transitions. [2022-03-15 15:13:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:13:35,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:35,436 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:35,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 15:13:35,436 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:13:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -310942004, now seen corresponding path program 6 times [2022-03-15 15:13:35,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:35,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528153187] [2022-03-15 15:13:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:38,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:38,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528153187] [2022-03-15 15:13:38,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528153187] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:38,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:38,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:13:38,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496258371] [2022-03-15 15:13:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:38,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:13:38,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:13:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3440, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:13:38,326 INFO L87 Difference]: Start difference. First operand 4164 states and 7739 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:46,857 INFO L93 Difference]: Finished difference Result 5591 states and 10552 transitions. [2022-03-15 15:13:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:13:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:13:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:46,864 INFO L225 Difference]: With dead ends: 5591 [2022-03-15 15:13:46,864 INFO L226 Difference]: Without dead ends: 5591 [2022-03-15 15:13:46,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4553 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3225, Invalid=14597, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 15:13:46,865 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 7222 mSDsluCounter, 8608 mSDsCounter, 0 mSdLazyCounter, 8903 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7222 SdHoareTripleChecker+Valid, 9078 SdHoareTripleChecker+Invalid, 9702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 8903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:46,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7222 Valid, 9078 Invalid, 9702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 8903 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:13:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2022-03-15 15:13:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 4170. [2022-03-15 15:13:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4147 states have (on average 1.8690619725102484) internal successors, (7751), 4169 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 7751 transitions. [2022-03-15 15:13:46,914 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 7751 transitions. Word has length 468 [2022-03-15 15:13:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:46,914 INFO L470 AbstractCegarLoop]: Abstraction has 4170 states and 7751 transitions. [2022-03-15 15:13:46,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 7751 transitions. [2022-03-15 15:13:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:13:46,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:46,917 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:46,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 15:13:46,917 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:13:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash -319129724, now seen corresponding path program 7 times [2022-03-15 15:13:46,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:46,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427454798] [2022-03-15 15:13:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:49,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:49,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427454798] [2022-03-15 15:13:49,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427454798] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:49,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:49,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:13:49,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267307428] [2022-03-15 15:13:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:49,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:13:49,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:13:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=3426, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:13:49,903 INFO L87 Difference]: Start difference. First operand 4170 states and 7751 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:59,285 INFO L93 Difference]: Finished difference Result 5595 states and 10560 transitions. [2022-03-15 15:13:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 15:13:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:13:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:59,292 INFO L225 Difference]: With dead ends: 5595 [2022-03-15 15:13:59,292 INFO L226 Difference]: Without dead ends: 5595 [2022-03-15 15:13:59,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3367, Invalid=16093, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 15:13:59,293 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 6051 mSDsluCounter, 6424 mSDsCounter, 0 mSdLazyCounter, 6835 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6051 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 7510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 6835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:59,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6051 Valid, 6821 Invalid, 7510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 6835 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 15:13:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2022-03-15 15:13:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 4175. [2022-03-15 15:13:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 4152 states have (on average 1.8692196531791907) internal successors, (7761), 4174 states have internal predecessors, (7761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 7761 transitions. [2022-03-15 15:13:59,337 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 7761 transitions. Word has length 468 [2022-03-15 15:13:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:59,337 INFO L470 AbstractCegarLoop]: Abstraction has 4175 states and 7761 transitions. [2022-03-15 15:13:59,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 7761 transitions. [2022-03-15 15:13:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:13:59,340 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:59,340 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:59,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 15:13:59,340 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:13:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash -319469174, now seen corresponding path program 8 times [2022-03-15 15:13:59,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:59,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455283335] [2022-03-15 15:13:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:02,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:02,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455283335] [2022-03-15 15:14:02,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455283335] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:02,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:02,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:14:02,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131755080] [2022-03-15 15:14:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:02,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:14:02,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:14:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3912, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:14:02,942 INFO L87 Difference]: Start difference. First operand 4175 states and 7761 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:15,813 INFO L93 Difference]: Finished difference Result 5721 states and 10810 transitions. [2022-03-15 15:14:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 15:14:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:14:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:15,820 INFO L225 Difference]: With dead ends: 5721 [2022-03-15 15:14:15,820 INFO L226 Difference]: Without dead ends: 5721 [2022-03-15 15:14:15,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5241 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3457, Invalid=17135, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 15:14:15,821 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 7543 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 12289 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7543 SdHoareTripleChecker+Valid, 12349 SdHoareTripleChecker+Invalid, 13104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 12289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:15,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7543 Valid, 12349 Invalid, 13104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 12289 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-03-15 15:14:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2022-03-15 15:14:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 4171. [2022-03-15 15:14:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4148 states have (on average 1.8690935390549663) internal successors, (7753), 4170 states have internal predecessors, (7753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 7753 transitions. [2022-03-15 15:14:15,866 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 7753 transitions. Word has length 468 [2022-03-15 15:14:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:15,866 INFO L470 AbstractCegarLoop]: Abstraction has 4171 states and 7753 transitions. [2022-03-15 15:14:15,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 7753 transitions. [2022-03-15 15:14:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:14:15,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:15,869 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:15,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 15:14:15,870 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:14:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 411283270, now seen corresponding path program 9 times [2022-03-15 15:14:15,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:15,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609562211] [2022-03-15 15:14:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:18,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:18,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609562211] [2022-03-15 15:14:18,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609562211] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:18,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:18,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:14:18,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474628221] [2022-03-15 15:14:18,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:18,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:14:18,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:14:18,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3440, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:14:18,788 INFO L87 Difference]: Start difference. First operand 4171 states and 7753 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:26,275 INFO L93 Difference]: Finished difference Result 5588 states and 10546 transitions. [2022-03-15 15:14:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 15:14:26,276 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:14:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:26,281 INFO L225 Difference]: With dead ends: 5588 [2022-03-15 15:14:26,281 INFO L226 Difference]: Without dead ends: 5588 [2022-03-15 15:14:26,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4052 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2809, Invalid=13447, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 15:14:26,282 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 6561 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 6618 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6561 SdHoareTripleChecker+Valid, 6470 SdHoareTripleChecker+Invalid, 7330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 6618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:26,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6561 Valid, 6470 Invalid, 7330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [712 Valid, 6618 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 15:14:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2022-03-15 15:14:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 4165. [2022-03-15 15:14:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4142 states have (on average 1.8689039111540318) internal successors, (7741), 4164 states have internal predecessors, (7741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 7741 transitions. [2022-03-15 15:14:26,318 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 7741 transitions. Word has length 468 [2022-03-15 15:14:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:26,319 INFO L470 AbstractCegarLoop]: Abstraction has 4165 states and 7741 transitions. [2022-03-15 15:14:26,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 7741 transitions. [2022-03-15 15:14:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:14:26,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:26,322 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:26,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 15:14:26,322 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:14:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1259865646, now seen corresponding path program 10 times [2022-03-15 15:14:26,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:26,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039652212] [2022-03-15 15:14:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:30,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:30,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039652212] [2022-03-15 15:14:30,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039652212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:30,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:30,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:14:30,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824471686] [2022-03-15 15:14:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:30,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:14:30,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:14:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3932, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:14:30,294 INFO L87 Difference]: Start difference. First operand 4165 states and 7741 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:48,283 INFO L93 Difference]: Finished difference Result 5712 states and 10792 transitions. [2022-03-15 15:14:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-15 15:14:48,284 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:14:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:48,290 INFO L225 Difference]: With dead ends: 5712 [2022-03-15 15:14:48,290 INFO L226 Difference]: Without dead ends: 5712 [2022-03-15 15:14:48,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6443 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4211, Invalid=21229, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 15:14:48,291 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 6577 mSDsluCounter, 13967 mSDsCounter, 0 mSdLazyCounter, 14875 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6577 SdHoareTripleChecker+Valid, 14425 SdHoareTripleChecker+Invalid, 15614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 14875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:48,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6577 Valid, 14425 Invalid, 15614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 14875 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-03-15 15:14:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2022-03-15 15:14:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 4174. [2022-03-15 15:14:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 4151 states have (on average 1.8691881474343532) internal successors, (7759), 4173 states have internal predecessors, (7759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 7759 transitions. [2022-03-15 15:14:48,338 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 7759 transitions. Word has length 468 [2022-03-15 15:14:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:48,338 INFO L470 AbstractCegarLoop]: Abstraction has 4174 states and 7759 transitions. [2022-03-15 15:14:48,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 7759 transitions. [2022-03-15 15:14:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:14:48,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:48,341 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:48,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 15:14:48,341 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:14:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1268053366, now seen corresponding path program 11 times [2022-03-15 15:14:48,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:48,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516986416] [2022-03-15 15:14:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:51,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:51,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516986416] [2022-03-15 15:14:51,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516986416] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:51,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:51,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:14:51,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299592559] [2022-03-15 15:14:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:51,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:14:51,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:51,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:14:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3440, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:14:51,446 INFO L87 Difference]: Start difference. First operand 4174 states and 7759 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:02,030 INFO L93 Difference]: Finished difference Result 5710 states and 10788 transitions. [2022-03-15 15:15:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 15:15:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:15:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:02,038 INFO L225 Difference]: With dead ends: 5710 [2022-03-15 15:15:02,038 INFO L226 Difference]: Without dead ends: 5710 [2022-03-15 15:15:02,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4727 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3210, Invalid=15422, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 15:15:02,039 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 6808 mSDsluCounter, 10897 mSDsCounter, 0 mSdLazyCounter, 10896 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6808 SdHoareTripleChecker+Valid, 11287 SdHoareTripleChecker+Invalid, 11665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 10896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:02,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6808 Valid, 11287 Invalid, 11665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 10896 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-15 15:15:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2022-03-15 15:15:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4178. [2022-03-15 15:15:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4155 states have (on average 1.8693140794223826) internal successors, (7767), 4177 states have internal predecessors, (7767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 7767 transitions. [2022-03-15 15:15:02,086 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 7767 transitions. Word has length 468 [2022-03-15 15:15:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:02,087 INFO L470 AbstractCegarLoop]: Abstraction has 4178 states and 7767 transitions. [2022-03-15 15:15:02,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 7767 transitions. [2022-03-15 15:15:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:15:02,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:02,090 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:02,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 15:15:02,090 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:15:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1268392816, now seen corresponding path program 12 times [2022-03-15 15:15:02,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:02,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164244776] [2022-03-15 15:15:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:06,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:06,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164244776] [2022-03-15 15:15:06,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164244776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:06,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:06,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:15:06,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527850770] [2022-03-15 15:15:06,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:06,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:15:06,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:15:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3572, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:15:06,406 INFO L87 Difference]: Start difference. First operand 4178 states and 7767 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:20,084 INFO L93 Difference]: Finished difference Result 5706 states and 10780 transitions. [2022-03-15 15:15:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 15:15:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:15:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:20,091 INFO L225 Difference]: With dead ends: 5706 [2022-03-15 15:15:20,091 INFO L226 Difference]: Without dead ends: 5706 [2022-03-15 15:15:20,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3220, Invalid=16240, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 15:15:20,092 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 6360 mSDsluCounter, 7906 mSDsCounter, 0 mSdLazyCounter, 8832 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6360 SdHoareTripleChecker+Valid, 8297 SdHoareTripleChecker+Invalid, 9528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 8832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:20,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6360 Valid, 8297 Invalid, 9528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 8832 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 15:15:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2022-03-15 15:15:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 4170. [2022-03-15 15:15:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4147 states have (on average 1.8690619725102484) internal successors, (7751), 4169 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 7751 transitions. [2022-03-15 15:15:20,138 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 7751 transitions. Word has length 468 [2022-03-15 15:15:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:20,138 INFO L470 AbstractCegarLoop]: Abstraction has 4170 states and 7751 transitions. [2022-03-15 15:15:20,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 7751 transitions. [2022-03-15 15:15:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:15:20,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:20,141 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:20,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 15:15:20,141 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:15:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -958984308, now seen corresponding path program 1 times [2022-03-15 15:15:20,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:20,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735942027] [2022-03-15 15:15:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:23,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:23,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735942027] [2022-03-15 15:15:23,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735942027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:23,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:23,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:15:23,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403199567] [2022-03-15 15:15:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:23,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:15:23,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:15:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:15:23,180 INFO L87 Difference]: Start difference. First operand 4170 states and 7751 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:31,949 INFO L93 Difference]: Finished difference Result 6804 states and 12941 transitions. [2022-03-15 15:15:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 15:15:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:15:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:31,957 INFO L225 Difference]: With dead ends: 6804 [2022-03-15 15:15:31,958 INFO L226 Difference]: Without dead ends: 6804 [2022-03-15 15:15:31,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3964 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2570, Invalid=13432, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 15:15:31,959 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 7085 mSDsluCounter, 9377 mSDsCounter, 0 mSdLazyCounter, 10374 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7085 SdHoareTripleChecker+Valid, 9686 SdHoareTripleChecker+Invalid, 11036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 10374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:31,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7085 Valid, 9686 Invalid, 11036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 10374 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:15:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6804 states. [2022-03-15 15:15:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6804 to 4266. [2022-03-15 15:15:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4266 states, 4243 states have (on average 1.8727315578600048) internal successors, (7946), 4265 states have internal predecessors, (7946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4266 states to 4266 states and 7946 transitions. [2022-03-15 15:15:32,009 INFO L78 Accepts]: Start accepts. Automaton has 4266 states and 7946 transitions. Word has length 468 [2022-03-15 15:15:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:32,010 INFO L470 AbstractCegarLoop]: Abstraction has 4266 states and 7946 transitions. [2022-03-15 15:15:32,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 7946 transitions. [2022-03-15 15:15:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:15:32,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:32,012 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:32,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 15:15:32,013 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:15:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1616316628, now seen corresponding path program 13 times [2022-03-15 15:15:32,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:32,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137568851] [2022-03-15 15:15:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:35,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:35,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137568851] [2022-03-15 15:15:35,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137568851] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:35,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:35,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:15:35,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937702580] [2022-03-15 15:15:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:35,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:15:35,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:35,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:15:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=3664, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:15:35,696 INFO L87 Difference]: Start difference. First operand 4266 states and 7946 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:48,617 INFO L93 Difference]: Finished difference Result 7217 states and 13764 transitions. [2022-03-15 15:15:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 15:15:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:15:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:48,625 INFO L225 Difference]: With dead ends: 7217 [2022-03-15 15:15:48,625 INFO L226 Difference]: Without dead ends: 7217 [2022-03-15 15:15:48,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6108 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3775, Invalid=18875, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 15:15:48,626 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 6792 mSDsluCounter, 11297 mSDsCounter, 0 mSdLazyCounter, 14082 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6792 SdHoareTripleChecker+Valid, 11691 SdHoareTripleChecker+Invalid, 14775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 14082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:48,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6792 Valid, 11691 Invalid, 14775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 14082 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-03-15 15:15:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2022-03-15 15:15:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 4444. [2022-03-15 15:15:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4421 states have (on average 1.8787604614340647) internal successors, (8306), 4443 states have internal predecessors, (8306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 8306 transitions. [2022-03-15 15:15:48,675 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 8306 transitions. Word has length 468 [2022-03-15 15:15:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:48,675 INFO L470 AbstractCegarLoop]: Abstraction has 4444 states and 8306 transitions. [2022-03-15 15:15:48,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 8306 transitions. [2022-03-15 15:15:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:15:48,678 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:48,678 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:48,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 15:15:48,678 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:15:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1742757460, now seen corresponding path program 14 times [2022-03-15 15:15:48,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:48,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691605056] [2022-03-15 15:15:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:52,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:52,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691605056] [2022-03-15 15:15:52,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691605056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:52,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:52,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-03-15 15:15:52,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583345196] [2022-03-15 15:15:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:52,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 15:15:52,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 15:15:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3809, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 15:15:52,544 INFO L87 Difference]: Start difference. First operand 4444 states and 8306 transitions. Second operand has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:07,421 INFO L93 Difference]: Finished difference Result 6007 states and 11390 transitions. [2022-03-15 15:16:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 15:16:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:16:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:07,428 INFO L225 Difference]: With dead ends: 6007 [2022-03-15 15:16:07,428 INFO L226 Difference]: Without dead ends: 6007 [2022-03-15 15:16:07,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6048 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4116, Invalid=20376, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 15:16:07,430 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 8393 mSDsluCounter, 7763 mSDsCounter, 0 mSdLazyCounter, 8987 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8393 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 9763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 8987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:07,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8393 Valid, 8119 Invalid, 9763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 8987 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:16:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2022-03-15 15:16:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 4448. [2022-03-15 15:16:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4448 states, 4425 states have (on average 1.8788700564971752) internal successors, (8314), 4447 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 8314 transitions. [2022-03-15 15:16:07,477 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 8314 transitions. Word has length 468 [2022-03-15 15:16:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:07,478 INFO L470 AbstractCegarLoop]: Abstraction has 4448 states and 8314 transitions. [2022-03-15 15:16:07,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 8314 transitions. [2022-03-15 15:16:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:16:07,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:07,481 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:07,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 15:16:07,481 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:16:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1734569740, now seen corresponding path program 15 times [2022-03-15 15:16:07,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:07,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916259510] [2022-03-15 15:16:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:11,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:11,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916259510] [2022-03-15 15:16:11,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916259510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:11,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:11,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:16:11,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127950448] [2022-03-15 15:16:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:11,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:16:11,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:11,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:16:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=3914, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:16:11,517 INFO L87 Difference]: Start difference. First operand 4448 states and 8314 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:27,083 INFO L93 Difference]: Finished difference Result 6001 states and 11377 transitions. [2022-03-15 15:16:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 15:16:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:16:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:27,090 INFO L225 Difference]: With dead ends: 6001 [2022-03-15 15:16:27,090 INFO L226 Difference]: Without dead ends: 6001 [2022-03-15 15:16:27,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5378 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3447, Invalid=18015, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 15:16:27,091 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 6945 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 9363 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6945 SdHoareTripleChecker+Valid, 9028 SdHoareTripleChecker+Invalid, 10016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 9363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:27,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6945 Valid, 9028 Invalid, 10016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 9363 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:16:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2022-03-15 15:16:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 4452. [2022-03-15 15:16:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4429 states have (on average 1.8789794536012645) internal successors, (8322), 4451 states have internal predecessors, (8322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 8322 transitions. [2022-03-15 15:16:27,139 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 8322 transitions. Word has length 468 [2022-03-15 15:16:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:27,139 INFO L470 AbstractCegarLoop]: Abstraction has 4452 states and 8322 transitions. [2022-03-15 15:16:27,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 8322 transitions. [2022-03-15 15:16:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:16:27,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:27,142 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:27,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 15:16:27,142 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:16:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1734230290, now seen corresponding path program 16 times [2022-03-15 15:16:27,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:27,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648623036] [2022-03-15 15:16:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:31,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:31,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648623036] [2022-03-15 15:16:31,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648623036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:31,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:31,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:16:31,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290941307] [2022-03-15 15:16:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:31,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:16:31,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:16:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=3931, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:16:31,193 INFO L87 Difference]: Start difference. First operand 4452 states and 8322 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:46,493 INFO L93 Difference]: Finished difference Result 5996 states and 11367 transitions. [2022-03-15 15:16:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 15:16:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:16:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:46,500 INFO L225 Difference]: With dead ends: 5996 [2022-03-15 15:16:46,500 INFO L226 Difference]: Without dead ends: 5996 [2022-03-15 15:16:46,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3535, Invalid=18815, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 15:16:46,501 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 7237 mSDsluCounter, 11260 mSDsCounter, 0 mSdLazyCounter, 11119 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7237 SdHoareTripleChecker+Valid, 11612 SdHoareTripleChecker+Invalid, 11801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 11119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:46,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7237 Valid, 11612 Invalid, 11801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 11119 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 15:16:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2022-03-15 15:16:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 4448. [2022-03-15 15:16:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4448 states, 4425 states have (on average 1.8788700564971752) internal successors, (8314), 4447 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 8314 transitions. [2022-03-15 15:16:46,547 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 8314 transitions. Word has length 468 [2022-03-15 15:16:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:46,547 INFO L470 AbstractCegarLoop]: Abstraction has 4448 states and 8314 transitions. [2022-03-15 15:16:46,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 8314 transitions. [2022-03-15 15:16:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:16:46,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:46,550 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:46,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 15:16:46,551 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:16:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1829984562, now seen corresponding path program 17 times [2022-03-15 15:16:46,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:46,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188853329] [2022-03-15 15:16:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:50,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:50,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188853329] [2022-03-15 15:16:50,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188853329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:50,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:50,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-03-15 15:16:50,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662131233] [2022-03-15 15:16:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:50,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 15:16:50,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 15:16:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3802, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 15:16:50,539 INFO L87 Difference]: Start difference. First operand 4448 states and 8314 transitions. Second operand has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:01,357 INFO L93 Difference]: Finished difference Result 5991 states and 11357 transitions. [2022-03-15 15:17:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 15:17:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:17:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:01,364 INFO L225 Difference]: With dead ends: 5991 [2022-03-15 15:17:01,364 INFO L226 Difference]: Without dead ends: 5991 [2022-03-15 15:17:01,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3133, Invalid=15227, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 15:17:01,365 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 7597 mSDsluCounter, 9014 mSDsCounter, 0 mSdLazyCounter, 9487 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7597 SdHoareTripleChecker+Valid, 9370 SdHoareTripleChecker+Invalid, 10195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 9487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:01,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7597 Valid, 9370 Invalid, 10195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 9487 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:17:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2022-03-15 15:17:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4442. [2022-03-15 15:17:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4442 states, 4419 states have (on average 1.8787055894998868) internal successors, (8302), 4441 states have internal predecessors, (8302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 8302 transitions. [2022-03-15 15:17:01,413 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 8302 transitions. Word has length 468 [2022-03-15 15:17:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:01,413 INFO L470 AbstractCegarLoop]: Abstraction has 4442 states and 8302 transitions. [2022-03-15 15:17:01,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 8302 transitions. [2022-03-15 15:17:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:17:01,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:01,416 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:01,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 15:17:01,417 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:17:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 793833818, now seen corresponding path program 18 times [2022-03-15 15:17:01,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:01,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494889265] [2022-03-15 15:17:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:04,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:04,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494889265] [2022-03-15 15:17:04,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494889265] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:04,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:04,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:17:04,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767273385] [2022-03-15 15:17:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:04,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:17:04,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:17:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3446, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:17:04,087 INFO L87 Difference]: Start difference. First operand 4442 states and 8302 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:12,340 INFO L93 Difference]: Finished difference Result 5880 states and 11137 transitions. [2022-03-15 15:17:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 15:17:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:17:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:12,347 INFO L225 Difference]: With dead ends: 5880 [2022-03-15 15:17:12,347 INFO L226 Difference]: Without dead ends: 5880 [2022-03-15 15:17:12,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3286, Invalid=15346, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 15:17:12,348 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 7566 mSDsluCounter, 6597 mSDsCounter, 0 mSdLazyCounter, 7186 mSolverCounterSat, 733 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7566 SdHoareTripleChecker+Valid, 6961 SdHoareTripleChecker+Invalid, 7919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 7186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:12,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7566 Valid, 6961 Invalid, 7919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 7186 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 15:17:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2022-03-15 15:17:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 4440. [2022-03-15 15:17:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4417 states have (on average 1.8786506678741226) internal successors, (8298), 4439 states have internal predecessors, (8298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 8298 transitions. [2022-03-15 15:17:12,394 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 8298 transitions. Word has length 468 [2022-03-15 15:17:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:12,394 INFO L470 AbstractCegarLoop]: Abstraction has 4440 states and 8298 transitions. [2022-03-15 15:17:12,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 8298 transitions. [2022-03-15 15:17:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:17:12,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:12,397 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:12,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-15 15:17:12,397 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:17:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 785646098, now seen corresponding path program 19 times [2022-03-15 15:17:12,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:12,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73515581] [2022-03-15 15:17:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:15,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:15,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73515581] [2022-03-15 15:17:15,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73515581] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:15,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:15,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:17:15,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81065698] [2022-03-15 15:17:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:15,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:17:15,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:17:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3571, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:17:15,686 INFO L87 Difference]: Start difference. First operand 4440 states and 8298 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:27,543 INFO L93 Difference]: Finished difference Result 6428 states and 12232 transitions. [2022-03-15 15:17:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:17:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:17:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:27,550 INFO L225 Difference]: With dead ends: 6428 [2022-03-15 15:17:27,550 INFO L226 Difference]: Without dead ends: 6428 [2022-03-15 15:17:27,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5124 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3247, Invalid=17633, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 15:17:27,551 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 7026 mSDsluCounter, 10621 mSDsCounter, 0 mSdLazyCounter, 12253 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7026 SdHoareTripleChecker+Valid, 11017 SdHoareTripleChecker+Invalid, 12994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 12253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:27,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7026 Valid, 11017 Invalid, 12994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 12253 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 15:17:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2022-03-15 15:17:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 4426. [2022-03-15 15:17:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4403 states have (on average 1.8780377015671132) internal successors, (8269), 4425 states have internal predecessors, (8269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 8269 transitions. [2022-03-15 15:17:27,595 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 8269 transitions. Word has length 468 [2022-03-15 15:17:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:27,595 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 8269 transitions. [2022-03-15 15:17:27,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 8269 transitions. [2022-03-15 15:17:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:17:27,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:27,598 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:27,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-15 15:17:27,598 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:17:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 242447524, now seen corresponding path program 2 times [2022-03-15 15:17:27,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:27,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738273719] [2022-03-15 15:17:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:31,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:31,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738273719] [2022-03-15 15:17:31,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738273719] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:31,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:31,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:17:31,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12733233] [2022-03-15 15:17:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:31,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:17:31,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:17:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=3875, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:17:31,461 INFO L87 Difference]: Start difference. First operand 4426 states and 8269 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:44,505 INFO L93 Difference]: Finished difference Result 7600 states and 14534 transitions. [2022-03-15 15:17:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 15:17:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:17:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:44,514 INFO L225 Difference]: With dead ends: 7600 [2022-03-15 15:17:44,514 INFO L226 Difference]: Without dead ends: 7600 [2022-03-15 15:17:44,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3537, Invalid=17055, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 15:17:44,515 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 7690 mSDsluCounter, 9775 mSDsCounter, 0 mSdLazyCounter, 10773 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7690 SdHoareTripleChecker+Valid, 10096 SdHoareTripleChecker+Invalid, 11492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 10773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:44,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7690 Valid, 10096 Invalid, 11492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 10773 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 15:17:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7600 states. [2022-03-15 15:17:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7600 to 4398. [2022-03-15 15:17:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 4375 states have (on average 1.876342857142857) internal successors, (8209), 4397 states have internal predecessors, (8209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 8209 transitions. [2022-03-15 15:17:44,572 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 8209 transitions. Word has length 468 [2022-03-15 15:17:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:44,572 INFO L470 AbstractCegarLoop]: Abstraction has 4398 states and 8209 transitions. [2022-03-15 15:17:44,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 8209 transitions. [2022-03-15 15:17:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:17:44,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:44,575 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:44,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 15:17:44,576 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:17:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -128887172, now seen corresponding path program 3 times [2022-03-15 15:17:44,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:44,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745239060] [2022-03-15 15:17:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:47,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:47,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745239060] [2022-03-15 15:17:47,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745239060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:47,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:47,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:17:47,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310618495] [2022-03-15 15:17:47,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:47,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:17:47,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:17:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3568, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:17:47,952 INFO L87 Difference]: Start difference. First operand 4398 states and 8209 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:57,175 INFO L93 Difference]: Finished difference Result 4480 states and 8370 transitions. [2022-03-15 15:17:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:17:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:17:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:57,180 INFO L225 Difference]: With dead ends: 4480 [2022-03-15 15:17:57,180 INFO L226 Difference]: Without dead ends: 4480 [2022-03-15 15:17:57,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2975, Invalid=15115, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:17:57,181 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 6563 mSDsluCounter, 8080 mSDsCounter, 0 mSdLazyCounter, 9744 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6563 SdHoareTripleChecker+Valid, 8416 SdHoareTripleChecker+Invalid, 10396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 9744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:57,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6563 Valid, 8416 Invalid, 10396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 9744 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 15:17:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2022-03-15 15:17:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 4406. [2022-03-15 15:17:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4383 states have (on average 1.8765685603467945) internal successors, (8225), 4405 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 8225 transitions. [2022-03-15 15:17:57,219 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 8225 transitions. Word has length 468 [2022-03-15 15:17:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:57,219 INFO L470 AbstractCegarLoop]: Abstraction has 4406 states and 8225 transitions. [2022-03-15 15:17:57,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 8225 transitions. [2022-03-15 15:17:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:17:57,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:57,222 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:57,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 15:17:57,222 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:17:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1938580546, now seen corresponding path program 4 times [2022-03-15 15:17:57,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:57,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996429606] [2022-03-15 15:17:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:00,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:00,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996429606] [2022-03-15 15:18:00,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996429606] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:00,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:00,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:18:00,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468621293] [2022-03-15 15:18:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:00,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:18:00,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:18:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3548, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:18:00,290 INFO L87 Difference]: Start difference. First operand 4406 states and 8225 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:08,983 INFO L93 Difference]: Finished difference Result 4529 states and 8468 transitions. [2022-03-15 15:18:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 15:18:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:18:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:09,006 INFO L225 Difference]: With dead ends: 4529 [2022-03-15 15:18:09,006 INFO L226 Difference]: Without dead ends: 4529 [2022-03-15 15:18:09,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4520 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3108, Invalid=14982, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:18:09,007 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 7698 mSDsluCounter, 7390 mSDsCounter, 0 mSdLazyCounter, 9943 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7698 SdHoareTripleChecker+Valid, 7732 SdHoareTripleChecker+Invalid, 10709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 9943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:09,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7698 Valid, 7732 Invalid, 10709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 9943 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 15:18:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2022-03-15 15:18:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4420. [2022-03-15 15:18:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4397 states have (on average 1.8769615647032067) internal successors, (8253), 4419 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 8253 transitions. [2022-03-15 15:18:09,041 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 8253 transitions. Word has length 468 [2022-03-15 15:18:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:09,041 INFO L470 AbstractCegarLoop]: Abstraction has 4420 states and 8253 transitions. [2022-03-15 15:18:09,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 8253 transitions. [2022-03-15 15:18:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:18:09,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:09,044 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:09,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-15 15:18:09,045 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:18:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash 293485854, now seen corresponding path program 5 times [2022-03-15 15:18:09,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:09,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865946726] [2022-03-15 15:18:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:14,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:14,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865946726] [2022-03-15 15:18:14,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865946726] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:14,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:14,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-03-15 15:18:14,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775109721] [2022-03-15 15:18:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:14,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-15 15:18:14,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-15 15:18:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4165, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 15:18:14,106 INFO L87 Difference]: Start difference. First operand 4420 states and 8253 transitions. Second operand has 68 states, 67 states have (on average 6.313432835820896) internal successors, (423), 68 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:36,447 INFO L93 Difference]: Finished difference Result 4797 states and 8961 transitions. [2022-03-15 15:18:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 15:18:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 6.313432835820896) internal successors, (423), 68 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:18:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:36,452 INFO L225 Difference]: With dead ends: 4797 [2022-03-15 15:18:36,452 INFO L226 Difference]: Without dead ends: 4797 [2022-03-15 15:18:36,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6252 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=4017, Invalid=21423, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 15:18:36,454 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 8615 mSDsluCounter, 10440 mSDsCounter, 0 mSdLazyCounter, 12131 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8615 SdHoareTripleChecker+Valid, 10763 SdHoareTripleChecker+Invalid, 12976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 12131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:36,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8615 Valid, 10763 Invalid, 12976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 12131 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-03-15 15:18:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2022-03-15 15:18:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4442. [2022-03-15 15:18:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4442 states, 4419 states have (on average 1.8775741117899978) internal successors, (8297), 4441 states have internal predecessors, (8297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 8297 transitions. [2022-03-15 15:18:36,492 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 8297 transitions. Word has length 468 [2022-03-15 15:18:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:36,492 INFO L470 AbstractCegarLoop]: Abstraction has 4442 states and 8297 transitions. [2022-03-15 15:18:36,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.313432835820896) internal successors, (423), 68 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 8297 transitions. [2022-03-15 15:18:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:18:36,495 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:36,495 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:36,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-15 15:18:36,495 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:18:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 896226716, now seen corresponding path program 6 times [2022-03-15 15:18:36,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:36,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890547920] [2022-03-15 15:18:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:40,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:40,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890547920] [2022-03-15 15:18:40,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890547920] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:40,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:40,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:18:40,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40004216] [2022-03-15 15:18:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:40,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:18:40,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:18:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3544, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:18:40,100 INFO L87 Difference]: Start difference. First operand 4442 states and 8297 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:49,242 INFO L93 Difference]: Finished difference Result 4560 states and 8530 transitions. [2022-03-15 15:18:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 15:18:49,242 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:18:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:49,247 INFO L225 Difference]: With dead ends: 4560 [2022-03-15 15:18:49,247 INFO L226 Difference]: Without dead ends: 4560 [2022-03-15 15:18:49,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4436 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2900, Invalid=14392, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 15:18:49,248 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 6869 mSDsluCounter, 8372 mSDsCounter, 0 mSdLazyCounter, 9753 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6869 SdHoareTripleChecker+Valid, 8680 SdHoareTripleChecker+Invalid, 10449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 9753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:49,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6869 Valid, 8680 Invalid, 10449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 9753 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:18:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2022-03-15 15:18:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 4474. [2022-03-15 15:18:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4451 states have (on average 1.8784542799370927) internal successors, (8361), 4473 states have internal predecessors, (8361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 8361 transitions. [2022-03-15 15:18:49,292 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 8361 transitions. Word has length 468 [2022-03-15 15:18:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:49,292 INFO L470 AbstractCegarLoop]: Abstraction has 4474 states and 8361 transitions. [2022-03-15 15:18:49,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 8361 transitions. [2022-03-15 15:18:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:18:49,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:49,296 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:49,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-15 15:18:49,296 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:18:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2079292096, now seen corresponding path program 7 times [2022-03-15 15:18:49,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:49,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020958881] [2022-03-15 15:18:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:53,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:53,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020958881] [2022-03-15 15:18:53,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020958881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:53,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:53,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:18:53,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003465397] [2022-03-15 15:18:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:53,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:18:53,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:53,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:18:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3902, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:18:53,101 INFO L87 Difference]: Start difference. First operand 4474 states and 8361 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:04,167 INFO L93 Difference]: Finished difference Result 6063 states and 11456 transitions. [2022-03-15 15:19:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:19:04,168 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:19:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:04,174 INFO L225 Difference]: With dead ends: 6063 [2022-03-15 15:19:04,174 INFO L226 Difference]: Without dead ends: 6063 [2022-03-15 15:19:04,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6331 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3498, Invalid=18554, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 15:19:04,175 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 7672 mSDsluCounter, 9829 mSDsCounter, 0 mSdLazyCounter, 11329 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7672 SdHoareTripleChecker+Valid, 10171 SdHoareTripleChecker+Invalid, 12009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 11329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:04,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7672 Valid, 10171 Invalid, 12009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 11329 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-15 15:19:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2022-03-15 15:19:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 4525. [2022-03-15 15:19:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 4502 states have (on average 1.88005330964016) internal successors, (8464), 4524 states have internal predecessors, (8464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 8464 transitions. [2022-03-15 15:19:04,219 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 8464 transitions. Word has length 468 [2022-03-15 15:19:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:04,219 INFO L470 AbstractCegarLoop]: Abstraction has 4525 states and 8464 transitions. [2022-03-15 15:19:04,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 8464 transitions. [2022-03-15 15:19:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:19:04,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:04,222 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:04,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-15 15:19:04,223 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:19:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 359625736, now seen corresponding path program 20 times [2022-03-15 15:19:04,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:04,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455458153] [2022-03-15 15:19:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:07,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:07,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455458153] [2022-03-15 15:19:07,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455458153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:07,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:07,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:19:07,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113023313] [2022-03-15 15:19:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:07,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:19:07,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:19:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=3556, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:19:07,361 INFO L87 Difference]: Start difference. First operand 4525 states and 8464 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:17,972 INFO L93 Difference]: Finished difference Result 6419 states and 12210 transitions. [2022-03-15 15:19:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 15:19:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:19:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:17,980 INFO L225 Difference]: With dead ends: 6419 [2022-03-15 15:19:17,980 INFO L226 Difference]: Without dead ends: 6419 [2022-03-15 15:19:17,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4996 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3367, Invalid=15815, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 15:19:17,981 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 8549 mSDsluCounter, 9450 mSDsCounter, 0 mSdLazyCounter, 12024 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8549 SdHoareTripleChecker+Valid, 9847 SdHoareTripleChecker+Invalid, 13074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 12024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:17,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8549 Valid, 9847 Invalid, 13074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 12024 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 15:19:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2022-03-15 15:19:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 4613. [2022-03-15 15:19:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4590 states have (on average 1.8821350762527234) internal successors, (8639), 4612 states have internal predecessors, (8639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 8639 transitions. [2022-03-15 15:19:18,038 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 8639 transitions. Word has length 468 [2022-03-15 15:19:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:18,039 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 8639 transitions. [2022-03-15 15:19:18,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 8639 transitions. [2022-03-15 15:19:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:19:18,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:18,042 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:18,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-15 15:19:18,042 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:19:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash 811352578, now seen corresponding path program 8 times [2022-03-15 15:19:18,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:18,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874486167] [2022-03-15 15:19:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:21,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:21,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874486167] [2022-03-15 15:19:21,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874486167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:21,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:21,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:19:21,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199553563] [2022-03-15 15:19:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:21,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:19:21,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:21,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:19:21,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=3566, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:19:21,967 INFO L87 Difference]: Start difference. First operand 4613 states and 8639 transitions. Second operand has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:34,012 INFO L93 Difference]: Finished difference Result 5804 states and 10979 transitions. [2022-03-15 15:19:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 15:19:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:19:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:34,020 INFO L225 Difference]: With dead ends: 5804 [2022-03-15 15:19:34,020 INFO L226 Difference]: Without dead ends: 5804 [2022-03-15 15:19:34,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5369 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2975, Invalid=17905, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 15:19:34,021 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 5726 mSDsluCounter, 7554 mSDsCounter, 0 mSdLazyCounter, 9195 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5726 SdHoareTripleChecker+Valid, 7889 SdHoareTripleChecker+Invalid, 9708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 9195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:34,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5726 Valid, 7889 Invalid, 9708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 9195 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 15:19:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2022-03-15 15:19:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 4628. [2022-03-15 15:19:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4628 states, 4605 states have (on average 1.8825190010857764) internal successors, (8669), 4627 states have internal predecessors, (8669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 8669 transitions. [2022-03-15 15:19:34,071 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 8669 transitions. Word has length 468 [2022-03-15 15:19:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:34,072 INFO L470 AbstractCegarLoop]: Abstraction has 4628 states and 8669 transitions. [2022-03-15 15:19:34,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.82258064516129) internal successors, (423), 63 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 8669 transitions. [2022-03-15 15:19:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:19:34,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:34,075 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:34,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-15 15:19:34,075 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:19:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -908313782, now seen corresponding path program 21 times [2022-03-15 15:19:34,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:34,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794819222] [2022-03-15 15:19:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:37,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:37,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794819222] [2022-03-15 15:19:37,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794819222] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:37,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:37,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:19:37,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591529397] [2022-03-15 15:19:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:37,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:19:37,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:19:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=3648, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:19:37,275 INFO L87 Difference]: Start difference. First operand 4628 states and 8669 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:51,539 INFO L93 Difference]: Finished difference Result 5868 states and 11108 transitions. [2022-03-15 15:19:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 15:19:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:19:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:51,546 INFO L225 Difference]: With dead ends: 5868 [2022-03-15 15:19:51,546 INFO L226 Difference]: Without dead ends: 5868 [2022-03-15 15:19:51,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5097 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3409, Invalid=17471, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 15:19:51,547 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 6800 mSDsluCounter, 9495 mSDsCounter, 0 mSdLazyCounter, 12414 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6800 SdHoareTripleChecker+Valid, 9892 SdHoareTripleChecker+Invalid, 13078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 12414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:51,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6800 Valid, 9892 Invalid, 13078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 12414 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 15:19:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2022-03-15 15:19:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 4637. [2022-03-15 15:19:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 4614 states have (on average 1.8827481577806675) internal successors, (8687), 4636 states have internal predecessors, (8687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 8687 transitions. [2022-03-15 15:19:51,592 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 8687 transitions. Word has length 468 [2022-03-15 15:19:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:51,593 INFO L470 AbstractCegarLoop]: Abstraction has 4637 states and 8687 transitions. [2022-03-15 15:19:51,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 8687 transitions. [2022-03-15 15:19:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:19:51,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:51,596 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:51,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-15 15:19:51,596 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:19:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash -916501502, now seen corresponding path program 22 times [2022-03-15 15:19:51,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:51,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057670370] [2022-03-15 15:19:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:54,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:54,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057670370] [2022-03-15 15:19:54,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057670370] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:54,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:54,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:19:54,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415946452] [2022-03-15 15:19:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:54,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:19:54,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:19:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3698, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:19:54,738 INFO L87 Difference]: Start difference. First operand 4637 states and 8687 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:04,484 INFO L93 Difference]: Finished difference Result 5863 states and 11098 transitions. [2022-03-15 15:20:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 15:20:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:20:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:04,492 INFO L225 Difference]: With dead ends: 5863 [2022-03-15 15:20:04,493 INFO L226 Difference]: Without dead ends: 5863 [2022-03-15 15:20:04,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4323 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3183, Invalid=14907, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:20:04,494 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 7370 mSDsluCounter, 8709 mSDsCounter, 0 mSdLazyCounter, 11672 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7370 SdHoareTripleChecker+Valid, 9109 SdHoareTripleChecker+Invalid, 12409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 11672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:04,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7370 Valid, 9109 Invalid, 12409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 11672 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 15:20:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5863 states. [2022-03-15 15:20:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5863 to 4642. [2022-03-15 15:20:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4642 states, 4619 states have (on average 1.882875081186404) internal successors, (8697), 4641 states have internal predecessors, (8697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 8697 transitions. [2022-03-15 15:20:04,546 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 8697 transitions. Word has length 468 [2022-03-15 15:20:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:04,546 INFO L470 AbstractCegarLoop]: Abstraction has 4642 states and 8697 transitions. [2022-03-15 15:20:04,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 8697 transitions. [2022-03-15 15:20:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:20:04,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:04,550 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:04,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-15 15:20:04,550 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:20:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -916840952, now seen corresponding path program 23 times [2022-03-15 15:20:04,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:04,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189981209] [2022-03-15 15:20:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:07,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:07,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189981209] [2022-03-15 15:20:07,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189981209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:07,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:07,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:20:07,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132947740] [2022-03-15 15:20:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:07,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:20:07,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:20:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3897, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:20:07,932 INFO L87 Difference]: Start difference. First operand 4642 states and 8697 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:19,199 INFO L93 Difference]: Finished difference Result 5981 states and 11332 transitions. [2022-03-15 15:20:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:20:19,200 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:20:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:19,207 INFO L225 Difference]: With dead ends: 5981 [2022-03-15 15:20:19,207 INFO L226 Difference]: Without dead ends: 5981 [2022-03-15 15:20:19,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5825 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3819, Invalid=18831, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 15:20:19,208 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 6591 mSDsluCounter, 9124 mSDsCounter, 0 mSdLazyCounter, 11749 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6591 SdHoareTripleChecker+Valid, 9539 SdHoareTripleChecker+Invalid, 12401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 11749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:19,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6591 Valid, 9539 Invalid, 12401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 11749 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-03-15 15:20:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2022-03-15 15:20:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 4642. [2022-03-15 15:20:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4642 states, 4619 states have (on average 1.882875081186404) internal successors, (8697), 4641 states have internal predecessors, (8697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 8697 transitions. [2022-03-15 15:20:19,253 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 8697 transitions. Word has length 468 [2022-03-15 15:20:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:19,253 INFO L470 AbstractCegarLoop]: Abstraction has 4642 states and 8697 transitions. [2022-03-15 15:20:19,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 8697 transitions. [2022-03-15 15:20:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:20:19,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:19,256 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:19,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-15 15:20:19,257 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:20:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -946021724, now seen corresponding path program 9 times [2022-03-15 15:20:19,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:19,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894478921] [2022-03-15 15:20:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:23,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:23,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894478921] [2022-03-15 15:20:23,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894478921] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:23,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:23,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:20:23,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526377496] [2022-03-15 15:20:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:23,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:20:23,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:20:23,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=3612, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:20:23,165 INFO L87 Difference]: Start difference. First operand 4642 states and 8697 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:33,172 INFO L93 Difference]: Finished difference Result 6802 states and 12928 transitions. [2022-03-15 15:20:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 15:20:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:20:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:33,180 INFO L225 Difference]: With dead ends: 6802 [2022-03-15 15:20:33,180 INFO L226 Difference]: Without dead ends: 6802 [2022-03-15 15:20:33,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4394 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2992, Invalid=14564, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 15:20:33,181 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 6882 mSDsluCounter, 7557 mSDsCounter, 0 mSdLazyCounter, 9013 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6882 SdHoareTripleChecker+Valid, 7887 SdHoareTripleChecker+Invalid, 9669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 9013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:33,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6882 Valid, 7887 Invalid, 9669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 9013 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 15:20:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2022-03-15 15:20:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 4621. [2022-03-15 15:20:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 4598 states have (on average 1.8823401478903872) internal successors, (8655), 4620 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 8655 transitions. [2022-03-15 15:20:33,230 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 8655 transitions. Word has length 468 [2022-03-15 15:20:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:33,230 INFO L470 AbstractCegarLoop]: Abstraction has 4621 states and 8655 transitions. [2022-03-15 15:20:33,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 8655 transitions. [2022-03-15 15:20:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:20:33,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:33,233 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:33,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-15 15:20:33,234 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:20:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1021195828, now seen corresponding path program 24 times [2022-03-15 15:20:33,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:33,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33909054] [2022-03-15 15:20:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:37,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:37,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33909054] [2022-03-15 15:20:37,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33909054] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:37,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:37,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-03-15 15:20:37,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916753158] [2022-03-15 15:20:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:37,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 15:20:37,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 15:20:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=3801, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 15:20:37,072 INFO L87 Difference]: Start difference. First operand 4621 states and 8655 transitions. Second operand has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:49,864 INFO L93 Difference]: Finished difference Result 4825 states and 9059 transitions. [2022-03-15 15:20:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-15 15:20:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:20:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:49,870 INFO L225 Difference]: With dead ends: 4825 [2022-03-15 15:20:49,870 INFO L226 Difference]: Without dead ends: 4825 [2022-03-15 15:20:49,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6004 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3907, Invalid=19655, Unknown=0, NotChecked=0, Total=23562 [2022-03-15 15:20:49,871 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 6994 mSDsluCounter, 5835 mSDsCounter, 0 mSdLazyCounter, 6935 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6994 SdHoareTripleChecker+Valid, 6157 SdHoareTripleChecker+Invalid, 7610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 6935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:49,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6994 Valid, 6157 Invalid, 7610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 6935 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 15:20:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2022-03-15 15:20:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4625. [2022-03-15 15:20:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4602 states have (on average 1.8824424163407214) internal successors, (8663), 4624 states have internal predecessors, (8663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 8663 transitions. [2022-03-15 15:20:49,928 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 8663 transitions. Word has length 468 [2022-03-15 15:20:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:49,928 INFO L470 AbstractCegarLoop]: Abstraction has 4625 states and 8663 transitions. [2022-03-15 15:20:49,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 6.609375) internal successors, (423), 65 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 8663 transitions. [2022-03-15 15:20:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:20:49,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:49,931 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:49,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-15 15:20:49,931 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:20:49,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1029383548, now seen corresponding path program 25 times [2022-03-15 15:20:49,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:49,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476234669] [2022-03-15 15:20:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:52,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:52,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476234669] [2022-03-15 15:20:52,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476234669] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:52,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:52,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:20:52,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95788246] [2022-03-15 15:20:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:52,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:20:52,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:52,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:20:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3451, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:20:52,916 INFO L87 Difference]: Start difference. First operand 4625 states and 8663 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:00,870 INFO L93 Difference]: Finished difference Result 4683 states and 8779 transitions. [2022-03-15 15:21:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:21:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:21:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:00,875 INFO L225 Difference]: With dead ends: 4683 [2022-03-15 15:21:00,875 INFO L226 Difference]: Without dead ends: 4683 [2022-03-15 15:21:00,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4307 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3042, Invalid=14514, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 15:21:00,876 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 6719 mSDsluCounter, 6354 mSDsCounter, 0 mSdLazyCounter, 6903 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6719 SdHoareTripleChecker+Valid, 6642 SdHoareTripleChecker+Invalid, 7570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 6903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:00,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6719 Valid, 6642 Invalid, 7570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [667 Valid, 6903 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 15:21:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2022-03-15 15:21:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4629. [2022-03-15 15:21:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4606 states have (on average 1.882544507164568) internal successors, (8671), 4628 states have internal predecessors, (8671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 8671 transitions. [2022-03-15 15:21:00,919 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 8671 transitions. Word has length 468 [2022-03-15 15:21:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:00,919 INFO L470 AbstractCegarLoop]: Abstraction has 4629 states and 8671 transitions. [2022-03-15 15:21:00,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 8671 transitions. [2022-03-15 15:21:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:21:00,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:00,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:00,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-15 15:21:00,922 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:21:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1029722998, now seen corresponding path program 26 times [2022-03-15 15:21:00,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:00,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993702367] [2022-03-15 15:21:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:04,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:04,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993702367] [2022-03-15 15:21:04,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993702367] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:04,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:04,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:21:04,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828989767] [2022-03-15 15:21:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:04,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:21:04,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:04,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:21:04,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3882, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:21:04,995 INFO L87 Difference]: Start difference. First operand 4629 states and 8671 transitions. Second operand has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:19,368 INFO L93 Difference]: Finished difference Result 4673 states and 8759 transitions. [2022-03-15 15:21:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 15:21:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:21:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:19,373 INFO L225 Difference]: With dead ends: 4673 [2022-03-15 15:21:19,373 INFO L226 Difference]: Without dead ends: 4673 [2022-03-15 15:21:19,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5751 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=3914, Invalid=19342, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 15:21:19,374 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 6350 mSDsluCounter, 7965 mSDsCounter, 0 mSdLazyCounter, 8739 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6350 SdHoareTripleChecker+Valid, 8244 SdHoareTripleChecker+Invalid, 9344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 8739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:19,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6350 Valid, 8244 Invalid, 9344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 8739 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 15:21:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2022-03-15 15:21:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4625. [2022-03-15 15:21:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4602 states have (on average 1.8824424163407214) internal successors, (8663), 4624 states have internal predecessors, (8663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 8663 transitions. [2022-03-15 15:21:19,417 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 8663 transitions. Word has length 468 [2022-03-15 15:21:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:19,417 INFO L470 AbstractCegarLoop]: Abstraction has 4625 states and 8663 transitions. [2022-03-15 15:21:19,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 6.507692307692308) internal successors, (423), 66 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 8663 transitions. [2022-03-15 15:21:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:21:19,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:19,420 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:19,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-15 15:21:19,420 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:21:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -298970554, now seen corresponding path program 27 times [2022-03-15 15:21:19,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:19,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508588083] [2022-03-15 15:21:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:22,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:22,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508588083] [2022-03-15 15:21:22,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508588083] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:22,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:22,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:21:22,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476289875] [2022-03-15 15:21:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:22,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:21:22,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:22,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:21:22,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3372, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:21:22,528 INFO L87 Difference]: Start difference. First operand 4625 states and 8663 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:30,402 INFO L93 Difference]: Finished difference Result 4664 states and 8741 transitions. [2022-03-15 15:21:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:21:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:21:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:30,408 INFO L225 Difference]: With dead ends: 4664 [2022-03-15 15:21:30,408 INFO L226 Difference]: Without dead ends: 4664 [2022-03-15 15:21:30,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4192 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3055, Invalid=14501, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 15:21:30,409 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 5451 mSDsluCounter, 6079 mSDsCounter, 0 mSdLazyCounter, 6809 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5451 SdHoareTripleChecker+Valid, 6363 SdHoareTripleChecker+Invalid, 7342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 6809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:30,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5451 Valid, 6363 Invalid, 7342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 6809 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 15:21:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2022-03-15 15:21:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 4620. [2022-03-15 15:21:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4620 states, 4597 states have (on average 1.882314552969328) internal successors, (8653), 4619 states have internal predecessors, (8653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 8653 transitions. [2022-03-15 15:21:30,469 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 8653 transitions. Word has length 468 [2022-03-15 15:21:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:30,469 INFO L470 AbstractCegarLoop]: Abstraction has 4620 states and 8653 transitions. [2022-03-15 15:21:30,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 8653 transitions. [2022-03-15 15:21:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:21:30,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:30,472 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:30,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-15 15:21:30,472 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:21:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1970119470, now seen corresponding path program 28 times [2022-03-15 15:21:30,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:30,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597220186] [2022-03-15 15:21:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:33,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:33,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597220186] [2022-03-15 15:21:33,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597220186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:33,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:33,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:21:33,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393927376] [2022-03-15 15:21:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:33,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:21:33,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:21:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3448, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:21:33,395 INFO L87 Difference]: Start difference. First operand 4620 states and 8653 transitions. Second operand has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:43,163 INFO L93 Difference]: Finished difference Result 4683 states and 8779 transitions. [2022-03-15 15:21:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 15:21:43,163 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:21:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:43,168 INFO L225 Difference]: With dead ends: 4683 [2022-03-15 15:21:43,168 INFO L226 Difference]: Without dead ends: 4683 [2022-03-15 15:21:43,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5695 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3716, Invalid=18336, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 15:21:43,170 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 6877 mSDsluCounter, 6515 mSDsCounter, 0 mSdLazyCounter, 8187 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6877 SdHoareTripleChecker+Valid, 6802 SdHoareTripleChecker+Invalid, 8838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 8187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:43,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6877 Valid, 6802 Invalid, 8838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 8187 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 15:21:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2022-03-15 15:21:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4616. [2022-03-15 15:21:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4616 states, 4593 states have (on average 1.8822120618332245) internal successors, (8645), 4615 states have internal predecessors, (8645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 8645 transitions. [2022-03-15 15:21:43,212 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 8645 transitions. Word has length 468 [2022-03-15 15:21:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:43,213 INFO L470 AbstractCegarLoop]: Abstraction has 4616 states and 8645 transitions. [2022-03-15 15:21:43,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.934426229508197) internal successors, (423), 62 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 8645 transitions. [2022-03-15 15:21:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:21:43,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:43,216 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:43,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-15 15:21:43,216 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:21:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1978307190, now seen corresponding path program 29 times [2022-03-15 15:21:43,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:43,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066963760] [2022-03-15 15:21:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:46,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:46,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066963760] [2022-03-15 15:21:46,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066963760] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:46,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:46,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:21:46,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738055710] [2022-03-15 15:21:46,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:46,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:21:46,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:21:46,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3677, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:21:46,735 INFO L87 Difference]: Start difference. First operand 4616 states and 8645 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:59,402 INFO L93 Difference]: Finished difference Result 4663 states and 8739 transitions. [2022-03-15 15:21:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 15:21:59,402 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:21:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:59,407 INFO L225 Difference]: With dead ends: 4663 [2022-03-15 15:21:59,407 INFO L226 Difference]: Without dead ends: 4663 [2022-03-15 15:21:59,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5301 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3733, Invalid=18617, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 15:21:59,408 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 6440 mSDsluCounter, 7465 mSDsCounter, 0 mSdLazyCounter, 8727 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6440 SdHoareTripleChecker+Valid, 7743 SdHoareTripleChecker+Invalid, 9347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 8727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:59,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6440 Valid, 7743 Invalid, 9347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 8727 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 15:21:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2022-03-15 15:21:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4613. [2022-03-15 15:21:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4590 states have (on average 1.8821350762527234) internal successors, (8639), 4612 states have internal predecessors, (8639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 8639 transitions. [2022-03-15 15:21:59,451 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 8639 transitions. Word has length 468 [2022-03-15 15:21:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:59,452 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 8639 transitions. [2022-03-15 15:21:59,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 8639 transitions. [2022-03-15 15:21:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-03-15 15:21:59,454 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:59,455 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:59,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-15 15:21:59,455 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:21:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1978646640, now seen corresponding path program 30 times [2022-03-15 15:21:59,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:59,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536187150] [2022-03-15 15:21:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:22:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:22:03,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:22:03,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536187150] [2022-03-15 15:22:03,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536187150] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:22:03,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:22:03,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:22:03,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403663519] [2022-03-15 15:22:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:22:03,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:22:03,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:22:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:22:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3700, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:22:03,179 INFO L87 Difference]: Start difference. First operand 4613 states and 8639 transitions. Second operand has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:22:15,689 INFO L93 Difference]: Finished difference Result 4659 states and 8731 transitions. [2022-03-15 15:22:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 15:22:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2022-03-15 15:22:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:22:15,695 INFO L225 Difference]: With dead ends: 4659 [2022-03-15 15:22:15,695 INFO L226 Difference]: Without dead ends: 4659 [2022-03-15 15:22:15,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5403 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3737, Invalid=18613, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 15:22:15,696 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 6967 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 8111 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6967 SdHoareTripleChecker+Valid, 7732 SdHoareTripleChecker+Invalid, 8801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 8111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:22:15,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6967 Valid, 7732 Invalid, 8801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 8111 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:22:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2022-03-15 15:22:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4595. [2022-03-15 15:22:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4595 states, 4572 states have (on average 1.88167104111986) internal successors, (8603), 4594 states have internal predecessors, (8603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 8603 transitions. [2022-03-15 15:22:15,737 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 8603 transitions. Word has length 468 [2022-03-15 15:22:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:22:15,738 INFO L470 AbstractCegarLoop]: Abstraction has 4595 states and 8603 transitions. [2022-03-15 15:22:15,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.714285714285714) internal successors, (423), 64 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 8603 transitions. [2022-03-15 15:22:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-03-15 15:22:15,740 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:22:15,740 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:15,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-15 15:22:15,741 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:22:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:22:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 692176816, now seen corresponding path program 1 times [2022-03-15 15:22:15,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:22:15,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322576637] [2022-03-15 15:22:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:22:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:22:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:22:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:22:18,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:22:18,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322576637] [2022-03-15 15:22:18,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322576637] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:22:18,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:22:18,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:22:18,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579864923] [2022-03-15 15:22:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:22:18,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:22:18,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:22:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:22:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3316, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:22:18,539 INFO L87 Difference]: Start difference. First operand 4595 states and 8603 transitions. Second operand has 61 states, 60 states have (on average 7.066666666666666) internal successors, (424), 61 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:22:28,162 INFO L93 Difference]: Finished difference Result 6202 states and 11776 transitions. [2022-03-15 15:22:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 15:22:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 7.066666666666666) internal successors, (424), 61 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2022-03-15 15:22:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:22:28,170 INFO L225 Difference]: With dead ends: 6202 [2022-03-15 15:22:28,170 INFO L226 Difference]: Without dead ends: 6202 [2022-03-15 15:22:28,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4520 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3269, Invalid=15091, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 15:22:28,171 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 7416 mSDsluCounter, 10139 mSDsCounter, 0 mSdLazyCounter, 10581 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7416 SdHoareTripleChecker+Valid, 10607 SdHoareTripleChecker+Invalid, 11398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 10581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:22:28,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7416 Valid, 10607 Invalid, 11398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 10581 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 15:22:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2022-03-15 15:22:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 4598. [2022-03-15 15:22:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4598 states, 4575 states have (on average 1.8817486338797815) internal successors, (8609), 4597 states have internal predecessors, (8609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 8609 transitions. [2022-03-15 15:22:28,216 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 8609 transitions. Word has length 469 [2022-03-15 15:22:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:22:28,216 INFO L470 AbstractCegarLoop]: Abstraction has 4598 states and 8609 transitions. [2022-03-15 15:22:28,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 7.066666666666666) internal successors, (424), 61 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 8609 transitions. [2022-03-15 15:22:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-03-15 15:22:28,219 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:22:28,219 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:28,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-15 15:22:28,219 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:22:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:22:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1040705224, now seen corresponding path program 2 times [2022-03-15 15:22:28,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:22:28,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336782489] [2022-03-15 15:22:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:22:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:22:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:22:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:22:32,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:22:32,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336782489] [2022-03-15 15:22:32,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336782489] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:22:32,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:22:32,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-03-15 15:22:32,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155072678] [2022-03-15 15:22:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:22:32,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 15:22:32,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:22:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 15:22:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=4036, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 15:22:32,455 INFO L87 Difference]: Start difference. First operand 4598 states and 8609 transitions. Second operand has 67 states, 66 states have (on average 6.424242424242424) internal successors, (424), 67 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:22:54,249 INFO L93 Difference]: Finished difference Result 6377 states and 12124 transitions. [2022-03-15 15:22:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 15:22:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 6.424242424242424) internal successors, (424), 67 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2022-03-15 15:22:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:22:54,256 INFO L225 Difference]: With dead ends: 6377 [2022-03-15 15:22:54,256 INFO L226 Difference]: Without dead ends: 6377 [2022-03-15 15:22:54,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6801 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=3648, Invalid=21158, Unknown=0, NotChecked=0, Total=24806 [2022-03-15 15:22:54,257 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 7273 mSDsluCounter, 11292 mSDsCounter, 0 mSdLazyCounter, 11356 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7273 SdHoareTripleChecker+Valid, 11748 SdHoareTripleChecker+Invalid, 12118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 11356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:22:54,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7273 Valid, 11748 Invalid, 12118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 11356 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 15:22:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2022-03-15 15:22:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 4598. [2022-03-15 15:22:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4598 states, 4575 states have (on average 1.8817486338797815) internal successors, (8609), 4597 states have internal predecessors, (8609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 8609 transitions. [2022-03-15 15:22:54,301 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 8609 transitions. Word has length 469 [2022-03-15 15:22:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:22:54,302 INFO L470 AbstractCegarLoop]: Abstraction has 4598 states and 8609 transitions. [2022-03-15 15:22:54,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 6.424242424242424) internal successors, (424), 67 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 8609 transitions. [2022-03-15 15:22:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-03-15 15:22:54,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:22:54,304 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:54,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-15 15:22:54,305 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:22:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:22:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -392567054, now seen corresponding path program 3 times [2022-03-15 15:22:54,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:22:54,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026169037] [2022-03-15 15:22:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:22:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:22:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:22:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:22:57,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:22:57,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026169037] [2022-03-15 15:22:57,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026169037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:22:57,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:22:57,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:22:57,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239586237] [2022-03-15 15:22:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:22:57,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:22:57,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:22:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:22:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3447, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:22:57,161 INFO L87 Difference]: Start difference. First operand 4598 states and 8609 transitions. Second operand has 62 states, 61 states have (on average 6.950819672131147) internal successors, (424), 62 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:23:08,046 INFO L93 Difference]: Finished difference Result 6245 states and 11862 transitions. [2022-03-15 15:23:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 15:23:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.950819672131147) internal successors, (424), 62 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2022-03-15 15:23:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:23:08,052 INFO L225 Difference]: With dead ends: 6245 [2022-03-15 15:23:08,052 INFO L226 Difference]: Without dead ends: 6245 [2022-03-15 15:23:08,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5074 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3598, Invalid=16994, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 15:23:08,053 INFO L933 BasicCegarLoop]: 482 mSDtfsCounter, 6580 mSDsluCounter, 11437 mSDsCounter, 0 mSdLazyCounter, 11772 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6580 SdHoareTripleChecker+Valid, 11899 SdHoareTripleChecker+Invalid, 12554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 11772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:23:08,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6580 Valid, 11899 Invalid, 12554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 11772 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 15:23:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6245 states. [2022-03-15 15:23:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6245 to 4590. [2022-03-15 15:23:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 4567 states have (on average 1.8815414933216554) internal successors, (8593), 4589 states have internal predecessors, (8593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 8593 transitions. [2022-03-15 15:23:08,095 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 8593 transitions. Word has length 469 [2022-03-15 15:23:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:23:08,095 INFO L470 AbstractCegarLoop]: Abstraction has 4590 states and 8593 transitions. [2022-03-15 15:23:08,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.950819672131147) internal successors, (424), 62 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 8593 transitions. [2022-03-15 15:23:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-03-15 15:23:08,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:23:08,098 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:23:08,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-15 15:23:08,098 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:23:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:23:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1800531280, now seen corresponding path program 4 times [2022-03-15 15:23:08,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:23:08,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152061463] [2022-03-15 15:23:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:23:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:23:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:23:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:23:12,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:23:12,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152061463] [2022-03-15 15:23:12,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152061463] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:23:12,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:23:12,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-03-15 15:23:12,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30010503] [2022-03-15 15:23:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:23:12,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 15:23:12,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:23:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 15:23:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3687, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 15:23:12,020 INFO L87 Difference]: Start difference. First operand 4590 states and 8593 transitions. Second operand has 64 states, 63 states have (on average 6.73015873015873) internal successors, (424), 64 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:23:27,298 INFO L93 Difference]: Finished difference Result 6112 states and 11592 transitions. [2022-03-15 15:23:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 15:23:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 6.73015873015873) internal successors, (424), 64 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2022-03-15 15:23:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:23:27,306 INFO L225 Difference]: With dead ends: 6112 [2022-03-15 15:23:27,306 INFO L226 Difference]: Without dead ends: 6112 [2022-03-15 15:23:27,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5942 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=3888, Invalid=19982, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 15:23:27,307 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 6055 mSDsluCounter, 9693 mSDsCounter, 0 mSdLazyCounter, 10131 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6055 SdHoareTripleChecker+Valid, 10052 SdHoareTripleChecker+Invalid, 10733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 10131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:23:27,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6055 Valid, 10052 Invalid, 10733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 10131 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 15:23:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6112 states. [2022-03-15 15:23:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6112 to 4569. [2022-03-15 15:23:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4569 states, 4546 states have (on average 1.8805543334799824) internal successors, (8549), 4568 states have internal predecessors, (8549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 8549 transitions. [2022-03-15 15:23:27,360 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 8549 transitions. Word has length 469 [2022-03-15 15:23:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:23:27,361 INFO L470 AbstractCegarLoop]: Abstraction has 4569 states and 8549 transitions. [2022-03-15 15:23:27,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 6.73015873015873) internal successors, (424), 64 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:23:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 8549 transitions. [2022-03-15 15:23:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-03-15 15:23:27,363 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:23:27,364 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:23:27,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-15 15:23:27,364 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-03-15 15:23:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:23:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2013214814, now seen corresponding path program 1 times [2022-03-15 15:23:27,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:23:27,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993940213] [2022-03-15 15:23:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:23:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:23:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:23:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:23:31,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:23:31,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993940213] [2022-03-15 15:23:31,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993940213] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:23:31,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:23:31,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-03-15 15:23:31,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179695168] [2022-03-15 15:23:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:23:31,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 15:23:31,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:23:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 15:23:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3907, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 15:23:31,451 INFO L87 Difference]: Start difference. First operand 4569 states and 8549 transitions. Second operand has 66 states, 65 states have (on average 6.523076923076923) internal successors, (424), 66 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 15:23:40,730 WARN L244 SmtUtils]: Removed 26 from assertion stack [2022-03-15 15:23:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 15:23:40,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4377 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2213, Invalid=13287, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 15:23:40,731 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 5321 mSDsluCounter, 5691 mSDsCounter, 0 mSdLazyCounter, 7787 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5321 SdHoareTripleChecker+Valid, 5880 SdHoareTripleChecker+Invalid, 8371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 7787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:23:40,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5321 Valid, 5880 Invalid, 8371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 7787 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 15:23:40,732 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-03-15 15:23:40,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-15 15:23:40,732 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. [2022-03-15 15:23:40,733 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-03-15 15:23:40,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-03-15 15:23:40,735 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-03-15 15:23:40,735 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-03-15 15:23:40,735 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-03-15 15:23:40,735 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2022-03-15 15:23:40,735 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2022-03-15 15:23:40,739 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-03-15 15:23:40,739 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-03-15 15:23:40,740 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-03-15 15:23:40,741 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-03-15 15:23:40,741 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (11 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-03-15 15:23:40,746 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-03-15 15:23:40,747 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-03-15 15:23:40,749 INFO L732 BasicCegarLoop]: Path program histogram: [30, 11, 9, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:23:40,755 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 15:23:40,756 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 15:23:40,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:23:40 BasicIcfg [2022-03-15 15:23:40,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 15:23:40,757 INFO L158 Benchmark]: Toolchain (without parser) took 726686.10ms. Allocated memory was 174.1MB in the beginning and 791.7MB in the end (delta: 617.6MB). Free memory was 121.0MB in the beginning and 181.9MB in the end (delta: -60.9MB). Peak memory consumption was 558.0MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 174.1MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.07ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 120.3MB in the end (delta: 640.5kB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 114.1MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: Boogie Preprocessor took 45.65ms. Allocated memory is still 174.1MB. Free memory was 114.1MB in the beginning and 108.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: RCFGBuilder took 844.23ms. Allocated memory was 174.1MB in the beginning and 219.2MB in the end (delta: 45.1MB). Free memory was 108.9MB in the beginning and 171.6MB in the end (delta: -62.7MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 INFO L158 Benchmark]: TraceAbstraction took 725267.69ms. Allocated memory was 219.2MB in the beginning and 791.7MB in the end (delta: 572.5MB). Free memory was 171.1MB in the beginning and 181.9MB in the end (delta: -10.9MB). Peak memory consumption was 561.6MB. Max. memory is 8.0GB. [2022-03-15 15:23:40,758 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.33ms. Allocated memory is still 174.1MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.07ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 120.3MB in the end (delta: 640.5kB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 174.1MB. Free memory was 120.3MB in the beginning and 114.1MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.65ms. Allocated memory is still 174.1MB. Free memory was 114.1MB in the beginning and 108.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 844.23ms. Allocated memory was 174.1MB in the beginning and 219.2MB in the end (delta: 45.1MB). Free memory was 108.9MB in the beginning and 171.6MB in the end (delta: -62.7MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * TraceAbstraction took 725267.69ms. Allocated memory was 219.2MB in the beginning and 791.7MB in the end (delta: 572.5MB). Free memory was 171.1MB in the beginning and 181.9MB in the end (delta: -10.9MB). Peak memory consumption was 561.6MB. 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: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1263]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1271]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1271]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1272]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1269]: 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 (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (4569states) and FLOYD_HOARE automaton (currently 67 states, 66 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 18ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 630 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 725.1s, OverallIterations: 74, TraceHistogramMax: 10, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.2s, AutomataDifference: 551.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336422 SdHoareTripleChecker+Valid, 219.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336422 mSDsluCounter, 468519 SdHoareTripleChecker+Invalid, 185.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436192 mSDsCounter, 36389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 472042 IncrementalHoareTripleChecker+Invalid, 508431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36389 mSolverCounterUnsat, 33248 mSDtfsCounter, 472042 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8594 GetRequests, 1805 SyntacticMatches, 43 SemanticMatches, 6745 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230052 ImplicationChecksByTransitivity, 400.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4642occurred in iteration=60, InterpolantAutomatonStates: 4130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 73 MinimizatonAttempts, 90263 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 155.5s InterpolantComputationTime, 30224 NumberOfCodeBlocks, 30174 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 30392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011670 SizeOfPredicates, 23 NumberOfNonLiveVariables, 991 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 82 InterpolantComputations, 71 PerfectInterpolantSequences, 15875/16398 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