/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:12:00,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:12:00,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:12:00,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:12:00,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:12:00,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:12:00,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:12:00,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:12:00,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:12:00,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:12:00,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:12:00,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:12:00,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:12:00,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:12:00,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:12:00,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:12:00,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:12:00,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:12:00,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:12:00,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:12:00,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:12:00,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:12:00,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:12:00,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:12:00,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:12:00,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:12:00,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:12:00,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:12:00,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:12:00,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:12:00,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:12:00,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:12:00,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:12:00,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:12:00,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:12:00,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:12:00,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:12:00,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:12:00,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:12:00,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:12:00,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:12:00,709 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:12:00,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:12:00,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:12:00,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:12:00,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:12:00,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:12:00,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:12:00,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:12:00,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:12:00,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:12:00,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:12:00,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:12:00,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:12:00,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:12:00,738 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:12:00,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:12:00,738 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:12:00,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:12:00,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:12:00,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:12:00,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:12:00,940 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:12:00,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-15 15:12:00,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8608af/8c8ffbd17e4f41889cc66d251d2479f9/FLAGb312babe8 [2022-03-15 15:12:01,472 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:12:01,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-15 15:12:01,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8608af/8c8ffbd17e4f41889cc66d251d2479f9/FLAGb312babe8 [2022-03-15 15:12:01,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8608af/8c8ffbd17e4f41889cc66d251d2479f9 [2022-03-15 15:12:01,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:12:01,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:12:01,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:12:01,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:12:01,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:12:01,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:12:01" (1/1) ... [2022-03-15 15:12:01,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d987ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:01, skipping insertion in model container [2022-03-15 15:12:01,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:12:01" (1/1) ... [2022-03-15 15:12:01,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:12:01,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:12:02,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:12:02,112 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:12:02,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:12:02,207 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:12:02,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02 WrapperNode [2022-03-15 15:12:02,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:12:02,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:12:02,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:12:02,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:12:02,214 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:12:02" (1/1) ... [2022-03-15 15:12:02,232 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:12:02" (1/1) ... [2022-03-15 15:12:02,263 INFO L137 Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2022-03-15 15:12:02,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:12:02,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:12:02,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:12:02,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:12:02,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:12:02,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:12:02,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:12:02,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:12:02,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (1/1) ... [2022-03-15 15:12:02,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:12:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:02,364 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:12:02,381 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:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 15:12:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:12:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:12:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 15:12:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:12:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:12:02,401 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:12:02,565 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:12:02,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:12:02,937 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:12:02,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:12:02,953 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 15:12:02,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:12:02 BoogieIcfgContainer [2022-03-15 15:12:02,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:12:02,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:12:02,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:12:02,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:12:02,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:12:01" (1/3) ... [2022-03-15 15:12:02,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ecd224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:12:02, skipping insertion in model container [2022-03-15 15:12:02,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:12:02" (2/3) ... [2022-03-15 15:12:02,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ecd224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:12:02, skipping insertion in model container [2022-03-15 15:12:02,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:12:02" (3/3) ... [2022-03-15 15:12:02,965 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2022-03-15 15:12:02,970 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:12:02,970 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:12:02,970 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-15 15:12:02,970 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:12:03,032 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:12:03,032 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:12:03,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,033 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:12:03,033 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:12:03,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,037 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:12:03,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,037 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:12:03,038 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:12:03,038 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,039 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:12:03,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,040 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:12:03,040 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:12:03,040 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:12:03,040 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:12:03,040 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:12:03,040 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:12:03,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,040 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:12:03,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,041 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:12:03,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,041 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:12:03,041 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:12:03,041 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,042 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:12:03,043 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:12:03,043 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:12:03,043 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:12:03,043 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:12:03,043 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:12:03,043 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:12:03,044 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:12:03,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,044 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:12:03,045 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:12:03,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,045 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:12:03,045 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:12:03,045 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:12:03,045 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:12:03,046 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:12:03,046 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:12:03,046 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:12:03,046 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:12:03,046 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:12:03,046 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:12:03,047 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:12:03,047 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:12:03,047 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:12:03,047 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:12:03,047 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:12:03,047 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:12:03,048 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:12:03,049 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:12:03,051 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:12:03,051 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:12:03,051 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:12:03,056 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:12:03,056 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:12:03,056 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,057 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:12:03,058 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:12:03,058 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:12:03,058 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:12:03,058 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:12:03,058 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:12:03,058 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:12:03,058 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,059 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,060 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,061 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,062 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,063 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:12:03,064 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:12:03,064 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:12:03,064 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:12:03,064 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:12:03,066 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:12:03,066 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:12:03,066 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:12:03,066 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:12:03,066 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:12:03,066 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:12:03,066 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,067 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:12:03,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,068 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:12:03,068 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:12:03,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,068 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:12:03,068 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:12:03,068 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,069 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,080 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:12:03,080 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:12:03,080 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:12:03,080 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:12:03,080 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:12:03,080 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:12:03,080 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:12:03,080 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,081 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,082 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:12:03,083 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:12:03,083 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,087 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,088 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,089 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,090 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,091 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:12:03,092 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:12:03,092 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:12:03,092 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:12:03,092 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:12:03,092 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:12:03,092 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:12:03,092 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,093 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,094 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,095 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,096 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,097 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,098 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:12:03,099 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:12:03,099 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:12:03,102 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:12:03,102 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:12:03,102 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:12:03,102 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:12:03,102 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:12:03,102 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:12:03,102 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,103 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,104 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,105 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,106 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:12:03,107 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:12:03,107 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:12:03,107 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:12:03,107 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:12:03,107 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:12:03,108 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:12:03,108 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:12:03,108 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:12:03,108 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:12:03,108 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:12:03,108 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:12:03,108 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:12:03,109 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:12:03,109 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:12:03,109 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:12:03,109 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:12:03,109 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:12:03,110 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:12:03,110 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:12:03,110 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:12:03,110 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:12:03,110 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:12:03,110 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:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,116 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:12:03,117 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:12:03,117 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:12:03,117 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:12:03,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,117 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:12:03,117 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:12:03,117 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:12:03,117 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:12:03,118 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:12:03,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,118 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:12:03,118 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:12:03,118 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:12:03,118 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:12:03,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,119 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:12:03,119 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:12:03,119 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:12:03,119 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:12:03,119 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:12:03,119 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:12:03,119 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:12:03,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,120 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:12:03,120 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:12:03,120 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:12:03,120 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:12:03,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,120 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:12:03,120 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:12:03,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,121 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:12:03,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:12:03,123 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:12:03,167 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:12:03,173 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:12:03,173 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-15 15:12:03,193 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow [2022-03-15 15:12:03,472 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 15:12:03,509 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:03,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:03,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times [2022-03-15 15:12:03,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:03,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37536182] [2022-03-15 15:12:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:03,887 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:12:03,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:03,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37536182] [2022-03-15 15:12:03,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37536182] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:03,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:03,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:12:03,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327800880] [2022-03-15 15:12:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:03,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:12:03,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:12:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:12:03,960 INFO L87 Difference]: Start difference. First operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:04,617 INFO L93 Difference]: Finished difference Result 10027 states and 19985 transitions. [2022-03-15 15:12:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:12:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-03-15 15:12:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:04,678 INFO L225 Difference]: With dead ends: 10027 [2022-03-15 15:12:04,678 INFO L226 Difference]: Without dead ends: 10027 [2022-03-15 15:12:04,680 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:04,684 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 246 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:04,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 890 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:12:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-03-15 15:12:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946. [2022-03-15 15:12:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9946 states, 9875 states have (on average 2.007392405063291) internal successors, (19823), 9945 states have internal predecessors, (19823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions. [2022-03-15 15:12:05,069 INFO L78 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40 [2022-03-15 15:12:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:05,069 INFO L470 AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions. [2022-03-15 15:12:05,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions. [2022-03-15 15:12:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 15:12:05,073 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:05,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:05,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:12:05,073 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times [2022-03-15 15:12:05,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:05,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597028186] [2022-03-15 15:12:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:05,197 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:12:05,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:05,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597028186] [2022-03-15 15:12:05,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597028186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:05,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:05,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:12:05,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119026671] [2022-03-15 15:12:05,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:05,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:12:05,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:12:05,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:12:05,200 INFO L87 Difference]: Start difference. First operand 9946 states and 19823 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:05,797 INFO L93 Difference]: Finished difference Result 10347 states and 20626 transitions. [2022-03-15 15:12:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:12:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-03-15 15:12:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:05,841 INFO L225 Difference]: With dead ends: 10347 [2022-03-15 15:12:05,842 INFO L226 Difference]: Without dead ends: 10347 [2022-03-15 15:12:05,842 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:05,843 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:05,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 937 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:12:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-15 15:12:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266. [2022-03-15 15:12:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10266 states, 10196 states have (on average 2.0070615927814828) internal successors, (20464), 10265 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions. [2022-03-15 15:12:06,145 INFO L78 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48 [2022-03-15 15:12:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:06,145 INFO L470 AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions. [2022-03-15 15:12:06,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions. [2022-03-15 15:12:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-15 15:12:06,148 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:06,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:06,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:12:06,148 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:06,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times [2022-03-15 15:12:06,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:06,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747664023] [2022-03-15 15:12:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:06,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:06,187 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:12:06,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:06,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747664023] [2022-03-15 15:12:06,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747664023] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:06,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:06,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:12:06,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586354364] [2022-03-15 15:12:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:06,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:12:06,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:12:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:12:06,189 INFO L87 Difference]: Start difference. First operand 10266 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:06,366 INFO L93 Difference]: Finished difference Result 19601 states and 39093 transitions. [2022-03-15 15:12:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:12:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-15 15:12:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:06,414 INFO L225 Difference]: With dead ends: 19601 [2022-03-15 15:12:06,415 INFO L226 Difference]: Without dead ends: 19601 [2022-03-15 15:12:06,415 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:12:06,416 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:06,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 550 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:12:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2022-03-15 15:12:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348. [2022-03-15 15:12:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10278 states have (on average 2.0070052539404553) internal successors, (20628), 10347 states have internal predecessors, (20628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions. [2022-03-15 15:12:06,712 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49 [2022-03-15 15:12:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:06,712 INFO L470 AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions. [2022-03-15 15:12:06,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions. [2022-03-15 15:12:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-15 15:12:06,713 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:06,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:06,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 15:12:06,714 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times [2022-03-15 15:12:06,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:06,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104971680] [2022-03-15 15:12:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:06,832 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:12:06,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:06,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104971680] [2022-03-15 15:12:06,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104971680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:06,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:06,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:12:06,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260018126] [2022-03-15 15:12:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:06,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:12:06,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:12:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:12:06,834 INFO L87 Difference]: Start difference. First operand 10348 states and 20628 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:07,011 INFO L93 Difference]: Finished difference Result 10347 states and 20627 transitions. [2022-03-15 15:12:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:12:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-03-15 15:12:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:07,046 INFO L225 Difference]: With dead ends: 10347 [2022-03-15 15:12:07,046 INFO L226 Difference]: Without dead ends: 10347 [2022-03-15 15:12:07,046 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:07,047 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:07,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 397 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:12:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-15 15:12:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347. [2022-03-15 15:12:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10347 states, 10278 states have (on average 2.006907958746838) internal successors, (20627), 10346 states have internal predecessors, (20627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions. [2022-03-15 15:12:07,343 INFO L78 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59 [2022-03-15 15:12:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:07,343 INFO L470 AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions. [2022-03-15 15:12:07,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions. [2022-03-15 15:12:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 15:12:07,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:07,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:07,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 15:12:07,350 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:07,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times [2022-03-15 15:12:07,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:07,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299319578] [2022-03-15 15:12:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:07,495 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:12:07,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:07,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299319578] [2022-03-15 15:12:07,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299319578] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:07,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841213380] [2022-03-15 15:12:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:07,503 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:12:07,533 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:12:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:07,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:12:07,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:07,877 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:12:07,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:08,053 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:12:08,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841213380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:12:08,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:12:08,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:12:08,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210717680] [2022-03-15 15:12:08,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:12:08,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:12:08,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:12:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:12:08,056 INFO L87 Difference]: Start difference. First operand 10347 states and 20627 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:08,279 INFO L93 Difference]: Finished difference Result 19642 states and 39134 transitions. [2022-03-15 15:12:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:12:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-03-15 15:12:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:08,401 INFO L225 Difference]: With dead ends: 19642 [2022-03-15 15:12:08,401 INFO L226 Difference]: Without dead ends: 19642 [2022-03-15 15:12:08,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:12:08,403 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 489 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:08,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1608 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:12:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2022-03-15 15:12:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429. [2022-03-15 15:12:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10429 states, 10360 states have (on average 1.9989382239382238) internal successors, (20709), 10428 states have internal predecessors, (20709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions. [2022-03-15 15:12:08,686 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90 [2022-03-15 15:12:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:08,686 INFO L470 AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions. [2022-03-15 15:12:08,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions. [2022-03-15 15:12:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-15 15:12:08,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:08,693 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:08,720 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:12:08,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:08,908 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times [2022-03-15 15:12:08,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:08,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447399926] [2022-03-15 15:12:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:09,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:09,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447399926] [2022-03-15 15:12:09,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447399926] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:09,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670963467] [2022-03-15 15:12:09,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:12:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:09,129 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:12:09,157 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:12:09,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:12:09,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:12:09,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 15:12:09,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:09,535 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:12:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,562 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:12:09,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:12:09,594 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:12:09,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:09,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:12:09,643 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:12:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-03-15 15:12:09,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:12:09,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670963467] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:09,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:12:09,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-15 15:12:09,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378454421] [2022-03-15 15:12:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:09,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 15:12:09,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 15:12:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:12:09,671 INFO L87 Difference]: Start difference. First operand 10429 states and 20709 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:10,679 INFO L93 Difference]: Finished difference Result 12090 states and 24032 transitions. [2022-03-15 15:12:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:12:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2022-03-15 15:12:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:10,705 INFO L225 Difference]: With dead ends: 12090 [2022-03-15 15:12:10,706 INFO L226 Difference]: Without dead ends: 12090 [2022-03-15 15:12:10,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:12:10,707 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:10,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2448 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:12:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2022-03-15 15:12:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867. [2022-03-15 15:12:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10867 states, 10798 states have (on average 1.9989812928320059) internal successors, (21585), 10866 states have internal predecessors, (21585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions. [2022-03-15 15:12:11,020 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172 [2022-03-15 15:12:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:11,020 INFO L470 AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions. [2022-03-15 15:12:11,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions. [2022-03-15 15:12:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-15 15:12:11,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:11,024 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:11,047 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:12:11,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 15:12:11,244 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times [2022-03-15 15:12:11,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:11,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748854977] [2022-03-15 15:12:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:11,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:11,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748854977] [2022-03-15 15:12:11,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748854977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:11,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288187069] [2022-03-15 15:12:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:11,414 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:12:11,415 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:12:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:11,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 15:12:11,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:11,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:12,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288187069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:12:12,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:12:12,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 15:12:12,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211637495] [2022-03-15 15:12:12,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:12:12,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:12:12,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:12:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:12:12,419 INFO L87 Difference]: Start difference. First operand 10867 states and 21585 transitions. Second operand has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:12,800 INFO L93 Difference]: Finished difference Result 20585 states and 40856 transitions. [2022-03-15 15:12:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:12:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2022-03-15 15:12:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:12,894 INFO L225 Difference]: With dead ends: 20585 [2022-03-15 15:12:12,894 INFO L226 Difference]: Without dead ends: 20585 [2022-03-15 15:12:12,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:12:12,895 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 805 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:12,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2497 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:12:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2022-03-15 15:12:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031. [2022-03-15 15:12:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11031 states, 10962 states have (on average 1.9840357598978289) internal successors, (21749), 11030 states have internal predecessors, (21749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions. [2022-03-15 15:12:13,124 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180 [2022-03-15 15:12:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:13,125 INFO L470 AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions. [2022-03-15 15:12:13,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions. [2022-03-15 15:12:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-03-15 15:12:13,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:13,130 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:13,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 15:12:13,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:13,352 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times [2022-03-15 15:12:13,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:13,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048862067] [2022-03-15 15:12:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:13,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:13,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048862067] [2022-03-15 15:12:13,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048862067] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:13,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583070956] [2022-03-15 15:12:13,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:12:13,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:13,680 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:12:13,682 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:12:14,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:12:14,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:12:14,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 15:12:14,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:14,467 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:12:14,495 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 15:12:14,496 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:12:14,539 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-15 15:12:14,540 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:12:14,596 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-15 15:12:14,596 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:12:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-03-15 15:12:14,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:12:14,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583070956] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:14,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:12:14,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-15 15:12:14,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670684687] [2022-03-15 15:12:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:14,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:12:14,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:12:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:14,624 INFO L87 Difference]: Start difference. First operand 11031 states and 21749 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:15,232 INFO L93 Difference]: Finished difference Result 11586 states and 22859 transitions. [2022-03-15 15:12:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:12:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-03-15 15:12:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:15,246 INFO L225 Difference]: With dead ends: 11586 [2022-03-15 15:12:15,246 INFO L226 Difference]: Without dead ends: 11586 [2022-03-15 15:12:15,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:15,247 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:15,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1050 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:12:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-03-15 15:12:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469. [2022-03-15 15:12:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11469 states, 11400 states have (on average 1.9846491228070176) internal successors, (22625), 11468 states have internal predecessors, (22625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions. [2022-03-15 15:12:15,432 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344 [2022-03-15 15:12:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:15,433 INFO L470 AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions. [2022-03-15 15:12:15,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions. [2022-03-15 15:12:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-03-15 15:12:15,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:15,438 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:15,463 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:12:15,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:15,661 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times [2022-03-15 15:12:15,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:15,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511800332] [2022-03-15 15:12:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:16,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:16,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511800332] [2022-03-15 15:12:16,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511800332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:16,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667166860] [2022-03-15 15:12:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:16,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:16,006 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:12:16,036 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:12:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:16,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 15:12:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:17,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:12:17,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667166860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:12:17,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:12:17,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-15 15:12:17,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367895294] [2022-03-15 15:12:17,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:12:17,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:12:17,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:17,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:12:17,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:12:17,712 INFO L87 Difference]: Start difference. First operand 11469 states and 22625 transitions. Second operand has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:18,205 INFO L93 Difference]: Finished difference Result 21487 states and 42537 transitions. [2022-03-15 15:12:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:12:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2022-03-15 15:12:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:18,243 INFO L225 Difference]: With dead ends: 21487 [2022-03-15 15:12:18,243 INFO L226 Difference]: Without dead ends: 21487 [2022-03-15 15:12:18,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 699 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:12:18,245 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1141 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:18,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 3468 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:12:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2022-03-15 15:12:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592. [2022-03-15 15:12:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11592 states, 11523 states have (on average 1.9741386791634123) internal successors, (22748), 11591 states have internal predecessors, (22748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions. [2022-03-15 15:12:18,572 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353 [2022-03-15 15:12:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:18,573 INFO L470 AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions. [2022-03-15 15:12:18,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions. [2022-03-15 15:12:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:18,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:18,583 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:18,607 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:12:18,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:18,800 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times [2022-03-15 15:12:18,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:18,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484129427] [2022-03-15 15:12:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:19,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:19,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484129427] [2022-03-15 15:12:19,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484129427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:19,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:19,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:19,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933056271] [2022-03-15 15:12:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:19,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:19,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:19,278 INFO L87 Difference]: Start difference. First operand 11592 states and 22748 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:20,543 INFO L93 Difference]: Finished difference Result 11725 states and 23014 transitions. [2022-03-15 15:12:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:12:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:20,565 INFO L225 Difference]: With dead ends: 11725 [2022-03-15 15:12:20,565 INFO L226 Difference]: Without dead ends: 11725 [2022-03-15 15:12:20,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:12:20,566 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:20,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2022-03-15 15:12:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609. [2022-03-15 15:12:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11540 states have (on average 1.9741767764298093) internal successors, (22782), 11608 states have internal predecessors, (22782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions. [2022-03-15 15:12:20,772 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476 [2022-03-15 15:12:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:20,773 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions. [2022-03-15 15:12:20,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions. [2022-03-15 15:12:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:20,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:20,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:20,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:12:20,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times [2022-03-15 15:12:20,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:20,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899907443] [2022-03-15 15:12:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:21,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:21,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899907443] [2022-03-15 15:12:21,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899907443] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:21,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:21,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:21,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932021168] [2022-03-15 15:12:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:21,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:21,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:21,264 INFO L87 Difference]: Start difference. First operand 11609 states and 22782 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:22,517 INFO L93 Difference]: Finished difference Result 11752 states and 23068 transitions. [2022-03-15 15:12:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 15:12:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:22,532 INFO L225 Difference]: With dead ends: 11752 [2022-03-15 15:12:22,532 INFO L226 Difference]: Without dead ends: 11752 [2022-03-15 15:12:22,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:12:22,533 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:22,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 2927 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2022-03-15 15:12:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610. [2022-03-15 15:12:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11610 states, 11541 states have (on average 1.9741790139502642) internal successors, (22784), 11609 states have internal predecessors, (22784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions. [2022-03-15 15:12:22,685 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476 [2022-03-15 15:12:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:22,686 INFO L470 AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions. [2022-03-15 15:12:22,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions. [2022-03-15 15:12:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:22,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:22,691 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:22,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 15:12:22,691 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times [2022-03-15 15:12:22,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:22,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615493379] [2022-03-15 15:12:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:23,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:23,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615493379] [2022-03-15 15:12:23,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615493379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:23,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:23,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:23,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915644026] [2022-03-15 15:12:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:23,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:23,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:23,059 INFO L87 Difference]: Start difference. First operand 11610 states and 22784 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:24,545 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-15 15:12:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:12:24,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:24,564 INFO L225 Difference]: With dead ends: 11790 [2022-03-15 15:12:24,564 INFO L226 Difference]: Without dead ends: 11790 [2022-03-15 15:12:24,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:12:24,565 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 590 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:24,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 3473 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:12:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-15 15:12:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633. [2022-03-15 15:12:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 11564 states have (on average 1.9743168453822206) internal successors, (22831), 11632 states have internal predecessors, (22831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions. [2022-03-15 15:12:24,734 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476 [2022-03-15 15:12:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:24,735 INFO L470 AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions. [2022-03-15 15:12:24,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions. [2022-03-15 15:12:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:24,739 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:24,739 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:24,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 15:12:24,739 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times [2022-03-15 15:12:24,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:24,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438065051] [2022-03-15 15:12:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:25,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:25,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438065051] [2022-03-15 15:12:25,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438065051] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:25,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:25,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:25,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164087610] [2022-03-15 15:12:25,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:25,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:25,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:25,161 INFO L87 Difference]: Start difference. First operand 11633 states and 22831 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:26,267 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-15 15:12:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 15:12:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:26,291 INFO L225 Difference]: With dead ends: 11790 [2022-03-15 15:12:26,291 INFO L226 Difference]: Without dead ends: 11790 [2022-03-15 15:12:26,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:12:26,293 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:26,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2610 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:12:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-15 15:12:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635. [2022-03-15 15:12:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 11566 states have (on average 1.974321286529483) internal successors, (22835), 11634 states have internal predecessors, (22835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions. [2022-03-15 15:12:26,478 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476 [2022-03-15 15:12:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:26,479 INFO L470 AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions. [2022-03-15 15:12:26,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions. [2022-03-15 15:12:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:26,484 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:26,485 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:26,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 15:12:26,485 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times [2022-03-15 15:12:26,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:26,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413472759] [2022-03-15 15:12:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:26,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:26,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413472759] [2022-03-15 15:12:26,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413472759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:26,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:26,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:26,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83961991] [2022-03-15 15:12:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:26,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:26,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:26,835 INFO L87 Difference]: Start difference. First operand 11635 states and 22835 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:28,129 INFO L93 Difference]: Finished difference Result 11854 states and 23272 transitions. [2022-03-15 15:12:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:12:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:28,143 INFO L225 Difference]: With dead ends: 11854 [2022-03-15 15:12:28,143 INFO L226 Difference]: Without dead ends: 11854 [2022-03-15 15:12:28,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:12:28,143 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 523 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:28,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 3135 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2022-03-15 15:12:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634. [2022-03-15 15:12:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11565 states have (on average 1.97431906614786) internal successors, (22833), 11633 states have internal predecessors, (22833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions. [2022-03-15 15:12:28,306 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476 [2022-03-15 15:12:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:28,307 INFO L470 AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions. [2022-03-15 15:12:28,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions. [2022-03-15 15:12:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:28,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:28,311 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:28,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 15:12:28,311 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times [2022-03-15 15:12:28,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:28,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129344339] [2022-03-15 15:12:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:28,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:28,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129344339] [2022-03-15 15:12:28,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129344339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:28,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:28,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:28,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302517993] [2022-03-15 15:12:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:28,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:28,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:28,705 INFO L87 Difference]: Start difference. First operand 11634 states and 22833 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:29,873 INFO L93 Difference]: Finished difference Result 11855 states and 23274 transitions. [2022-03-15 15:12:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:12:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:29,892 INFO L225 Difference]: With dead ends: 11855 [2022-03-15 15:12:29,892 INFO L226 Difference]: Without dead ends: 11855 [2022-03-15 15:12:29,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:29,893 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 548 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:29,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2649 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:12:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2022-03-15 15:12:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657. [2022-03-15 15:12:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11657 states, 11588 states have (on average 1.9744563341387642) internal successors, (22880), 11656 states have internal predecessors, (22880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions. [2022-03-15 15:12:30,032 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476 [2022-03-15 15:12:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:30,032 INFO L470 AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions. [2022-03-15 15:12:30,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions. [2022-03-15 15:12:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:30,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:30,037 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:30,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 15:12:30,037 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times [2022-03-15 15:12:30,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:30,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610512768] [2022-03-15 15:12:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:30,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:30,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610512768] [2022-03-15 15:12:30,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610512768] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:30,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:30,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:12:30,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469510646] [2022-03-15 15:12:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:30,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:12:30,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:12:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:12:30,454 INFO L87 Difference]: Start difference. First operand 11657 states and 22880 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:31,650 INFO L93 Difference]: Finished difference Result 11923 states and 23410 transitions. [2022-03-15 15:12:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 15:12:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:31,664 INFO L225 Difference]: With dead ends: 11923 [2022-03-15 15:12:31,664 INFO L226 Difference]: Without dead ends: 11923 [2022-03-15 15:12:31,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-03-15 15:12:31,665 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 950 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:31,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 2658 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:12:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-03-15 15:12:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681. [2022-03-15 15:12:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11681 states, 11612 states have (on average 1.9745952462969343) internal successors, (22929), 11680 states have internal predecessors, (22929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions. [2022-03-15 15:12:31,788 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476 [2022-03-15 15:12:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:31,788 INFO L470 AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions. [2022-03-15 15:12:31,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions. [2022-03-15 15:12:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:31,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:31,792 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:31,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 15:12:31,793 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times [2022-03-15 15:12:31,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:31,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044957575] [2022-03-15 15:12:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:32,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:32,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044957575] [2022-03-15 15:12:32,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044957575] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:32,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:32,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:12:32,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322979340] [2022-03-15 15:12:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:32,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:12:32,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:12:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:12:32,168 INFO L87 Difference]: Start difference. First operand 11681 states and 22929 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:33,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:33,499 INFO L93 Difference]: Finished difference Result 12163 states and 23890 transitions. [2022-03-15 15:12:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:12:33,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:33,513 INFO L225 Difference]: With dead ends: 12163 [2022-03-15 15:12:33,513 INFO L226 Difference]: Without dead ends: 12163 [2022-03-15 15:12:33,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:12:33,517 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1055 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:33,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3332 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:12:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2022-03-15 15:12:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685. [2022-03-15 15:12:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11685 states, 11616 states have (on average 1.9746039944903582) internal successors, (22937), 11684 states have internal predecessors, (22937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions. [2022-03-15 15:12:33,675 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476 [2022-03-15 15:12:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:33,675 INFO L470 AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions. [2022-03-15 15:12:33,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions. [2022-03-15 15:12:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:33,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:33,680 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:33,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 15:12:33,680 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times [2022-03-15 15:12:33,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:33,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20055448] [2022-03-15 15:12:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:34,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:34,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20055448] [2022-03-15 15:12:34,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20055448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:34,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:34,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:12:34,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973990858] [2022-03-15 15:12:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:34,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:12:34,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:12:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:12:34,023 INFO L87 Difference]: Start difference. First operand 11685 states and 22937 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:35,501 INFO L93 Difference]: Finished difference Result 21888 states and 43344 transitions. [2022-03-15 15:12:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:12:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:35,536 INFO L225 Difference]: With dead ends: 21888 [2022-03-15 15:12:35,536 INFO L226 Difference]: Without dead ends: 21888 [2022-03-15 15:12:35,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:12:35,537 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1716 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:35,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1716 Valid, 4143 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:12:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-03-15 15:12:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752. [2022-03-15 15:12:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11683 states have (on average 1.974835230677052) internal successors, (23072), 11751 states have internal predecessors, (23072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions. [2022-03-15 15:12:35,704 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476 [2022-03-15 15:12:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:35,705 INFO L470 AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions. [2022-03-15 15:12:35,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions. [2022-03-15 15:12:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:35,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:35,709 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 15:12:35,710 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times [2022-03-15 15:12:35,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:35,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660294576] [2022-03-15 15:12:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:35,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:35,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660294576] [2022-03-15 15:12:35,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660294576] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:35,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:35,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:35,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978426664] [2022-03-15 15:12:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:35,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:35,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:35,988 INFO L87 Difference]: Start difference. First operand 11752 states and 23072 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:37,818 INFO L93 Difference]: Finished difference Result 21740 states and 43045 transitions. [2022-03-15 15:12:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 15:12:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:37,845 INFO L225 Difference]: With dead ends: 21740 [2022-03-15 15:12:37,846 INFO L226 Difference]: Without dead ends: 21740 [2022-03-15 15:12:37,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:12:37,847 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:37,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 4516 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:12:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2022-03-15 15:12:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831. [2022-03-15 15:12:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11831 states, 11762 states have (on average 1.9750042509777248) internal successors, (23230), 11830 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions. [2022-03-15 15:12:38,019 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476 [2022-03-15 15:12:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:38,019 INFO L470 AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions. [2022-03-15 15:12:38,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions. [2022-03-15 15:12:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:38,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:38,023 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:38,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 15:12:38,023 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times [2022-03-15 15:12:38,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:38,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910094181] [2022-03-15 15:12:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:38,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:38,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910094181] [2022-03-15 15:12:38,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910094181] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:38,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:38,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:38,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412618104] [2022-03-15 15:12:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:38,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:38,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:38,327 INFO L87 Difference]: Start difference. First operand 11831 states and 23230 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:39,010 INFO L93 Difference]: Finished difference Result 12198 states and 23964 transitions. [2022-03-15 15:12:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:12:39,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:39,024 INFO L225 Difference]: With dead ends: 12198 [2022-03-15 15:12:39,024 INFO L226 Difference]: Without dead ends: 12198 [2022-03-15 15:12:39,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:39,025 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:39,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2224 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:12:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-03-15 15:12:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856. [2022-03-15 15:12:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11787 states have (on average 1.9750572664800203) internal successors, (23280), 11855 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions. [2022-03-15 15:12:39,183 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476 [2022-03-15 15:12:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:39,183 INFO L470 AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions. [2022-03-15 15:12:39,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions. [2022-03-15 15:12:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:39,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:39,186 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:39,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 15:12:39,187 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times [2022-03-15 15:12:39,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:39,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781207102] [2022-03-15 15:12:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:39,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:39,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781207102] [2022-03-15 15:12:39,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781207102] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:39,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:39,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:39,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843388701] [2022-03-15 15:12:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:39,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:39,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:39,494 INFO L87 Difference]: Start difference. First operand 11856 states and 23280 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:40,411 INFO L93 Difference]: Finished difference Result 12278 states and 24124 transitions. [2022-03-15 15:12:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:12:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:40,426 INFO L225 Difference]: With dead ends: 12278 [2022-03-15 15:12:40,427 INFO L226 Difference]: Without dead ends: 12278 [2022-03-15 15:12:40,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:40,427 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 358 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:40,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 2542 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:12:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2022-03-15 15:12:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864. [2022-03-15 15:12:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11864 states, 11795 states have (on average 1.975074183976261) internal successors, (23296), 11863 states have internal predecessors, (23296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions. [2022-03-15 15:12:40,554 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476 [2022-03-15 15:12:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:40,554 INFO L470 AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions. [2022-03-15 15:12:40,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions. [2022-03-15 15:12:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:40,557 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:40,557 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:40,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 15:12:40,557 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times [2022-03-15 15:12:40,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:40,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257966598] [2022-03-15 15:12:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:40,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:40,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257966598] [2022-03-15 15:12:40,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257966598] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:40,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:40,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:40,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368261052] [2022-03-15 15:12:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:40,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:40,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:40,880 INFO L87 Difference]: Start difference. First operand 11864 states and 23296 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:41,800 INFO L93 Difference]: Finished difference Result 12342 states and 24252 transitions. [2022-03-15 15:12:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:12:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:41,812 INFO L225 Difference]: With dead ends: 12342 [2022-03-15 15:12:41,812 INFO L226 Difference]: Without dead ends: 12342 [2022-03-15 15:12:41,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:41,813 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 372 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:41,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 2554 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:12:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-03-15 15:12:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872. [2022-03-15 15:12:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11872 states, 11803 states have (on average 1.9750910785393545) internal successors, (23312), 11871 states have internal predecessors, (23312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions. [2022-03-15 15:12:41,927 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476 [2022-03-15 15:12:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:41,928 INFO L470 AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions. [2022-03-15 15:12:41,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions. [2022-03-15 15:12:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:41,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:41,931 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:41,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 15:12:41,931 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times [2022-03-15 15:12:41,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:41,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495113094] [2022-03-15 15:12:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:42,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:42,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495113094] [2022-03-15 15:12:42,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495113094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:42,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:42,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:42,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053046762] [2022-03-15 15:12:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:42,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:42,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:42,208 INFO L87 Difference]: Start difference. First operand 11872 states and 23312 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:43,540 INFO L93 Difference]: Finished difference Result 22094 states and 43756 transitions. [2022-03-15 15:12:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:12:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:43,570 INFO L225 Difference]: With dead ends: 22094 [2022-03-15 15:12:43,570 INFO L226 Difference]: Without dead ends: 22094 [2022-03-15 15:12:43,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:12:43,571 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:43,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 3873 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:12:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-03-15 15:12:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904. [2022-03-15 15:12:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11904 states, 11835 states have (on average 1.9751584283903676) internal successors, (23376), 11903 states have internal predecessors, (23376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions. [2022-03-15 15:12:43,756 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476 [2022-03-15 15:12:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:43,756 INFO L470 AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions. [2022-03-15 15:12:43,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions. [2022-03-15 15:12:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:43,760 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:43,760 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:43,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 15:12:43,760 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times [2022-03-15 15:12:43,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:43,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060548267] [2022-03-15 15:12:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:44,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:44,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060548267] [2022-03-15 15:12:44,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060548267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:44,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:44,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:12:44,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900279319] [2022-03-15 15:12:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:44,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:12:44,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:12:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:12:44,096 INFO L87 Difference]: Start difference. First operand 11904 states and 23376 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:45,657 INFO L93 Difference]: Finished difference Result 21883 states and 43334 transitions. [2022-03-15 15:12:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:12:45,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:45,690 INFO L225 Difference]: With dead ends: 21883 [2022-03-15 15:12:45,690 INFO L226 Difference]: Without dead ends: 21883 [2022-03-15 15:12:45,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:12:45,692 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 1085 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:45,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 4816 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:12:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2022-03-15 15:12:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847. [2022-03-15 15:12:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-15 15:12:45,899 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-15 15:12:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:45,899 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-15 15:12:45,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-15 15:12:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:45,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:45,902 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:45,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 15:12:45,902 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:45,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times [2022-03-15 15:12:45,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:45,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354096930] [2022-03-15 15:12:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:46,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:46,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354096930] [2022-03-15 15:12:46,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354096930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:46,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:46,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:46,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066747395] [2022-03-15 15:12:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:46,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:46,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:46,200 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:47,700 INFO L93 Difference]: Finished difference Result 22050 states and 43668 transitions. [2022-03-15 15:12:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:12:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:47,734 INFO L225 Difference]: With dead ends: 22050 [2022-03-15 15:12:47,735 INFO L226 Difference]: Without dead ends: 22050 [2022-03-15 15:12:47,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:47,735 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 913 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:47,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4836 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:12:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22050 states. [2022-03-15 15:12:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919. [2022-03-15 15:12:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-15 15:12:48,002 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-15 15:12:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:48,003 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-15 15:12:48,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-15 15:12:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:48,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:48,007 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:48,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 15:12:48,007 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times [2022-03-15 15:12:48,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:48,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561434135] [2022-03-15 15:12:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:48,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:48,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561434135] [2022-03-15 15:12:48,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561434135] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:48,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:48,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:12:48,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756683505] [2022-03-15 15:12:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:48,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:12:48,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:12:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:12:48,318 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:49,942 INFO L93 Difference]: Finished difference Result 21957 states and 43482 transitions. [2022-03-15 15:12:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:12:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:49,973 INFO L225 Difference]: With dead ends: 21957 [2022-03-15 15:12:49,973 INFO L226 Difference]: Without dead ends: 21957 [2022-03-15 15:12:49,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 15:12:49,974 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:49,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 5469 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:12:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-03-15 15:12:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847. [2022-03-15 15:12:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-15 15:12:50,156 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-15 15:12:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:50,157 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-15 15:12:50,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-15 15:12:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:50,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:50,160 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:50,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 15:12:50,160 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times [2022-03-15 15:12:50,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:50,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060748221] [2022-03-15 15:12:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:50,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:50,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060748221] [2022-03-15 15:12:50,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060748221] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:50,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:50,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:50,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353808267] [2022-03-15 15:12:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:50,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:50,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:50,445 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:51,435 INFO L93 Difference]: Finished difference Result 13605 states and 26712 transitions. [2022-03-15 15:12:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:12:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:51,452 INFO L225 Difference]: With dead ends: 13605 [2022-03-15 15:12:51,453 INFO L226 Difference]: Without dead ends: 13605 [2022-03-15 15:12:51,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:51,453 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 603 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:51,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 2837 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:12:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2022-03-15 15:12:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867. [2022-03-15 15:12:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11798 states have (on average 1.9750805221223937) internal successors, (23302), 11866 states have internal predecessors, (23302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions. [2022-03-15 15:12:51,631 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476 [2022-03-15 15:12:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:51,631 INFO L470 AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions. [2022-03-15 15:12:51,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions. [2022-03-15 15:12:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:51,634 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:51,634 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:51,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 15:12:51,635 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times [2022-03-15 15:12:51,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:51,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443963543] [2022-03-15 15:12:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:51,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:51,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443963543] [2022-03-15 15:12:51,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443963543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:51,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:51,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:51,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991212975] [2022-03-15 15:12:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:51,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:51,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:51,914 INFO L87 Difference]: Start difference. First operand 11867 states and 23302 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:53,086 INFO L93 Difference]: Finished difference Result 13688 states and 26878 transitions. [2022-03-15 15:12:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:12:53,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:53,102 INFO L225 Difference]: With dead ends: 13688 [2022-03-15 15:12:53,102 INFO L226 Difference]: Without dead ends: 13688 [2022-03-15 15:12:53,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:12:53,103 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 612 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:53,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 3246 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:12:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2022-03-15 15:12:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875. [2022-03-15 15:12:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11806 states have (on average 1.9750974080975776) internal successors, (23318), 11874 states have internal predecessors, (23318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions. [2022-03-15 15:12:53,235 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476 [2022-03-15 15:12:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:53,235 INFO L470 AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions. [2022-03-15 15:12:53,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions. [2022-03-15 15:12:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:53,238 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:53,238 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:53,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 15:12:53,239 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times [2022-03-15 15:12:53,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:53,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483916060] [2022-03-15 15:12:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:53,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:53,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483916060] [2022-03-15 15:12:53,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483916060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:53,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:53,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:53,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8824753] [2022-03-15 15:12:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:53,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:53,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:53,525 INFO L87 Difference]: Start difference. First operand 11875 states and 23318 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:54,733 INFO L93 Difference]: Finished difference Result 13858 states and 27218 transitions. [2022-03-15 15:12:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:12:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:54,750 INFO L225 Difference]: With dead ends: 13858 [2022-03-15 15:12:54,750 INFO L226 Difference]: Without dead ends: 13858 [2022-03-15 15:12:54,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:12:54,751 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 640 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:54,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 3277 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:12:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2022-03-15 15:12:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883. [2022-03-15 15:12:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-15 15:12:54,888 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-15 15:12:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:54,888 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-15 15:12:54,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-15 15:12:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:54,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:54,891 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:54,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 15:12:54,891 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times [2022-03-15 15:12:54,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:54,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189039449] [2022-03-15 15:12:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:55,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:55,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189039449] [2022-03-15 15:12:55,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189039449] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:55,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:55,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:55,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347620722] [2022-03-15 15:12:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:55,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:55,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:55,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:55,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:55,200 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:56,524 INFO L93 Difference]: Finished difference Result 13640 states and 26782 transitions. [2022-03-15 15:12:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:12:56,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:56,538 INFO L225 Difference]: With dead ends: 13640 [2022-03-15 15:12:56,538 INFO L226 Difference]: Without dead ends: 13640 [2022-03-15 15:12:56,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:12:56,539 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 693 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:56,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3423 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:12:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2022-03-15 15:12:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884. [2022-03-15 15:12:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11815 states have (on average 1.9751163774862464) internal successors, (23336), 11883 states have internal predecessors, (23336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions. [2022-03-15 15:12:56,658 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476 [2022-03-15 15:12:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:56,659 INFO L470 AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions. [2022-03-15 15:12:56,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions. [2022-03-15 15:12:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:56,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:56,662 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:56,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 15:12:56,662 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times [2022-03-15 15:12:56,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:56,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002337309] [2022-03-15 15:12:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:56,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:56,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002337309] [2022-03-15 15:12:56,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002337309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:56,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:56,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:56,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873763546] [2022-03-15 15:12:56,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:56,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:56,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:56,965 INFO L87 Difference]: Start difference. First operand 11884 states and 23336 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:58,410 INFO L93 Difference]: Finished difference Result 13799 states and 27100 transitions. [2022-03-15 15:12:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:12:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:12:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:58,429 INFO L225 Difference]: With dead ends: 13799 [2022-03-15 15:12:58,429 INFO L226 Difference]: Without dead ends: 13799 [2022-03-15 15:12:58,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:12:58,430 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:58,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 3545 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:12:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-03-15 15:12:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883. [2022-03-15 15:12:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-15 15:12:58,563 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-15 15:12:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:58,563 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-15 15:12:58,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-15 15:12:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:12:58,566 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:58,567 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:58,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 15:12:58,567 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:12:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times [2022-03-15 15:12:58,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:58,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490535354] [2022-03-15 15:12:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:12:58,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:58,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490535354] [2022-03-15 15:12:58,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490535354] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:58,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:58,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:12:58,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138640146] [2022-03-15 15:12:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:58,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:12:58,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:12:58,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:12:58,864 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:00,362 INFO L93 Difference]: Finished difference Result 13633 states and 26767 transitions. [2022-03-15 15:13:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:13:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:00,382 INFO L225 Difference]: With dead ends: 13633 [2022-03-15 15:13:00,383 INFO L226 Difference]: Without dead ends: 13633 [2022-03-15 15:13:00,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:13:00,383 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 749 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:00,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3816 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:13:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2022-03-15 15:13:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883. [2022-03-15 15:13:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-15 15:13:00,524 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-15 15:13:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:00,525 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-15 15:13:00,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-15 15:13:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:00,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:00,528 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 15:13:00,528 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times [2022-03-15 15:13:00,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:00,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197450174] [2022-03-15 15:13:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:00,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:00,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197450174] [2022-03-15 15:13:00,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197450174] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:00,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:00,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:00,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799437534] [2022-03-15 15:13:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:00,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:00,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:00,816 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:01,785 INFO L93 Difference]: Finished difference Result 13686 states and 26874 transitions. [2022-03-15 15:13:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:13:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:01,803 INFO L225 Difference]: With dead ends: 13686 [2022-03-15 15:13:01,803 INFO L226 Difference]: Without dead ends: 13686 [2022-03-15 15:13:01,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:13:01,804 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 616 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:01,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 3077 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:13:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-03-15 15:13:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889. [2022-03-15 15:13:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11820 states have (on average 1.9751269035532995) internal successors, (23346), 11888 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions. [2022-03-15 15:13:01,940 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476 [2022-03-15 15:13:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:01,940 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions. [2022-03-15 15:13:01,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions. [2022-03-15 15:13:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:01,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:01,943 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:01,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 15:13:01,943 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times [2022-03-15 15:13:01,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:01,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135101647] [2022-03-15 15:13:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:02,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:02,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135101647] [2022-03-15 15:13:02,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135101647] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:02,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:02,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:02,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315014276] [2022-03-15 15:13:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:02,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:02,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:02,281 INFO L87 Difference]: Start difference. First operand 11889 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:03,093 INFO L93 Difference]: Finished difference Result 13769 states and 27040 transitions. [2022-03-15 15:13:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:13:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:03,110 INFO L225 Difference]: With dead ends: 13769 [2022-03-15 15:13:03,110 INFO L226 Difference]: Without dead ends: 13769 [2022-03-15 15:13:03,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:13:03,112 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 617 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:03,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2803 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2022-03-15 15:13:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888. [2022-03-15 15:13:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11819 states have (on average 1.9751247990523733) internal successors, (23344), 11887 states have internal predecessors, (23344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions. [2022-03-15 15:13:03,245 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476 [2022-03-15 15:13:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:03,245 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions. [2022-03-15 15:13:03,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions. [2022-03-15 15:13:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:03,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:03,249 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:03,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 15:13:03,249 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:03,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times [2022-03-15 15:13:03,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:03,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119465708] [2022-03-15 15:13:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:03,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:03,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119465708] [2022-03-15 15:13:03,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119465708] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:03,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:03,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:03,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210016447] [2022-03-15 15:13:03,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:03,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:03,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:03,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:03,533 INFO L87 Difference]: Start difference. First operand 11888 states and 23344 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:04,521 INFO L93 Difference]: Finished difference Result 13833 states and 27168 transitions. [2022-03-15 15:13:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:13:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:04,538 INFO L225 Difference]: With dead ends: 13833 [2022-03-15 15:13:04,538 INFO L226 Difference]: Without dead ends: 13833 [2022-03-15 15:13:04,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:13:04,539 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 630 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:04,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 3160 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:13:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-15 15:13:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887. [2022-03-15 15:13:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9751226941952953) internal successors, (23342), 11886 states have internal predecessors, (23342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions. [2022-03-15 15:13:04,669 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476 [2022-03-15 15:13:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:04,669 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions. [2022-03-15 15:13:04,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions. [2022-03-15 15:13:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:04,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:04,673 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:04,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 15:13:04,673 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times [2022-03-15 15:13:04,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:04,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333044497] [2022-03-15 15:13:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:04,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:04,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333044497] [2022-03-15 15:13:04,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333044497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:04,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:04,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:04,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204807804] [2022-03-15 15:13:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:04,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:04,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:04,930 INFO L87 Difference]: Start difference. First operand 11887 states and 23342 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:06,345 INFO L93 Difference]: Finished difference Result 23633 states and 46768 transitions. [2022-03-15 15:13:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:13:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:06,378 INFO L225 Difference]: With dead ends: 23633 [2022-03-15 15:13:06,378 INFO L226 Difference]: Without dead ends: 23633 [2022-03-15 15:13:06,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-15 15:13:06,379 INFO L933 BasicCegarLoop]: 917 mSDtfsCounter, 1277 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 4730 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:06,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 4730 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2022-03-15 15:13:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919. [2022-03-15 15:13:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-15 15:13:06,572 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-15 15:13:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:06,572 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-15 15:13:06,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-15 15:13:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:06,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:06,575 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:06,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 15:13:06,576 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times [2022-03-15 15:13:06,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:06,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780327681] [2022-03-15 15:13:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:06,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:06,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780327681] [2022-03-15 15:13:06,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780327681] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:06,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:06,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:13:06,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598584112] [2022-03-15 15:13:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:06,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:13:06,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:13:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:13:06,850 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:09,055 INFO L93 Difference]: Finished difference Result 23388 states and 46278 transitions. [2022-03-15 15:13:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 15:13:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:09,086 INFO L225 Difference]: With dead ends: 23388 [2022-03-15 15:13:09,086 INFO L226 Difference]: Without dead ends: 23388 [2022-03-15 15:13:09,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 15:13:09,087 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 1521 mSDsluCounter, 5294 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:09,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 6340 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 15:13:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2022-03-15 15:13:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863. [2022-03-15 15:13:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11863 states, 11794 states have (on average 1.9754112260471426) internal successors, (23298), 11862 states have internal predecessors, (23298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions. [2022-03-15 15:13:09,272 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476 [2022-03-15 15:13:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:09,272 INFO L470 AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions. [2022-03-15 15:13:09,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions. [2022-03-15 15:13:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:09,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:09,275 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:09,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 15:13:09,276 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times [2022-03-15 15:13:09,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:09,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48346081] [2022-03-15 15:13:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:09,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:09,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48346081] [2022-03-15 15:13:09,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48346081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:09,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:09,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:09,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075265820] [2022-03-15 15:13:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:09,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:09,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:09,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:09,524 INFO L87 Difference]: Start difference. First operand 11863 states and 23298 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:10,497 INFO L93 Difference]: Finished difference Result 12207 states and 23984 transitions. [2022-03-15 15:13:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:13:10,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:10,512 INFO L225 Difference]: With dead ends: 12207 [2022-03-15 15:13:10,512 INFO L226 Difference]: Without dead ends: 12207 [2022-03-15 15:13:10,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:13:10,513 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:10,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 3240 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:13:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2022-03-15 15:13:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879. [2022-03-15 15:13:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11810 states have (on average 1.9754445385266723) internal successors, (23330), 11878 states have internal predecessors, (23330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions. [2022-03-15 15:13:10,642 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476 [2022-03-15 15:13:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:10,642 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions. [2022-03-15 15:13:10,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions. [2022-03-15 15:13:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:10,645 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:10,645 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:10,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 15:13:10,645 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times [2022-03-15 15:13:10,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:10,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050384138] [2022-03-15 15:13:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:10,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:10,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050384138] [2022-03-15 15:13:10,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050384138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:10,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:10,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:10,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516661498] [2022-03-15 15:13:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:10,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:10,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:10,920 INFO L87 Difference]: Start difference. First operand 11879 states and 23330 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:11,764 INFO L93 Difference]: Finished difference Result 12290 states and 24150 transitions. [2022-03-15 15:13:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:13:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:11,781 INFO L225 Difference]: With dead ends: 12290 [2022-03-15 15:13:11,781 INFO L226 Difference]: Without dead ends: 12290 [2022-03-15 15:13:11,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:13:11,781 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 313 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:11,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 2725 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2022-03-15 15:13:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887. [2022-03-15 15:13:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9754611609409376) internal successors, (23346), 11886 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions. [2022-03-15 15:13:11,915 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476 [2022-03-15 15:13:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:11,915 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions. [2022-03-15 15:13:11,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions. [2022-03-15 15:13:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:11,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:11,918 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:11,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 15:13:11,919 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times [2022-03-15 15:13:11,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:11,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445013716] [2022-03-15 15:13:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:12,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:12,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445013716] [2022-03-15 15:13:12,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445013716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:12,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:12,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:12,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858684580] [2022-03-15 15:13:12,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:12,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:12,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:12,154 INFO L87 Difference]: Start difference. First operand 11887 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:12,858 INFO L93 Difference]: Finished difference Result 12354 states and 24278 transitions. [2022-03-15 15:13:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:13:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:12,874 INFO L225 Difference]: With dead ends: 12354 [2022-03-15 15:13:12,874 INFO L226 Difference]: Without dead ends: 12354 [2022-03-15 15:13:12,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:13:12,875 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 330 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:12,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 2482 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:13:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2022-03-15 15:13:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895. [2022-03-15 15:13:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11895 states, 11826 states have (on average 1.9754777608658887) internal successors, (23362), 11894 states have internal predecessors, (23362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions. [2022-03-15 15:13:13,004 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476 [2022-03-15 15:13:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:13,004 INFO L470 AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions. [2022-03-15 15:13:13,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions. [2022-03-15 15:13:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:13,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:13,008 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:13,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 15:13:13,008 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times [2022-03-15 15:13:13,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:13,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114396591] [2022-03-15 15:13:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:13,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:13,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114396591] [2022-03-15 15:13:13,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114396591] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:13,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:13,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:13,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017961831] [2022-03-15 15:13:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:13,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:13,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:13,290 INFO L87 Difference]: Start difference. First operand 11895 states and 23362 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:14,942 INFO L93 Difference]: Finished difference Result 22106 states and 43782 transitions. [2022-03-15 15:13:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:13:14,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:14,972 INFO L225 Difference]: With dead ends: 22106 [2022-03-15 15:13:14,972 INFO L226 Difference]: Without dead ends: 22106 [2022-03-15 15:13:14,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:14,972 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 972 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:14,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 5180 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:13:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22106 states. [2022-03-15 15:13:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927. [2022-03-15 15:13:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11858 states have (on average 1.9755439365828977) internal successors, (23426), 11926 states have internal predecessors, (23426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions. [2022-03-15 15:13:15,153 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476 [2022-03-15 15:13:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:15,153 INFO L470 AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions. [2022-03-15 15:13:15,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions. [2022-03-15 15:13:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:15,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:15,157 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:15,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 15:13:15,157 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times [2022-03-15 15:13:15,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:15,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438927553] [2022-03-15 15:13:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:15,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:15,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438927553] [2022-03-15 15:13:15,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438927553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:15,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:15,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:13:15,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13032024] [2022-03-15 15:13:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:15,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:13:15,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:13:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:13:15,407 INFO L87 Difference]: Start difference. First operand 11927 states and 23426 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:16,779 INFO L93 Difference]: Finished difference Result 21911 states and 43392 transitions. [2022-03-15 15:13:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:13:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:16,807 INFO L225 Difference]: With dead ends: 21911 [2022-03-15 15:13:16,808 INFO L226 Difference]: Without dead ends: 21911 [2022-03-15 15:13:16,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:13:16,808 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 1149 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:16,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 4839 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:13:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2022-03-15 15:13:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848. [2022-03-15 15:13:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11779 states have (on average 1.9753799134052126) internal successors, (23268), 11847 states have internal predecessors, (23268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions. [2022-03-15 15:13:16,977 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476 [2022-03-15 15:13:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:16,978 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions. [2022-03-15 15:13:16,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions. [2022-03-15 15:13:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:16,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:16,980 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:16,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 15:13:16,981 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times [2022-03-15 15:13:16,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:16,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830403352] [2022-03-15 15:13:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:17,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:17,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830403352] [2022-03-15 15:13:17,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830403352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:17,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:17,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:17,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739452329] [2022-03-15 15:13:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:17,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:17,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:17,209 INFO L87 Difference]: Start difference. First operand 11848 states and 23268 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:18,606 INFO L93 Difference]: Finished difference Result 21819 states and 43200 transitions. [2022-03-15 15:13:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:13:18,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:18,635 INFO L225 Difference]: With dead ends: 21819 [2022-03-15 15:13:18,635 INFO L226 Difference]: Without dead ends: 21819 [2022-03-15 15:13:18,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:13:18,636 INFO L933 BasicCegarLoop]: 842 mSDtfsCounter, 933 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:18,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 4801 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:13:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2022-03-15 15:13:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741. [2022-03-15 15:13:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 11673 states have (on average 1.9742996658956566) internal successors, (23046), 11740 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions. [2022-03-15 15:13:18,813 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476 [2022-03-15 15:13:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:18,813 INFO L470 AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions. [2022-03-15 15:13:18,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions. [2022-03-15 15:13:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-15 15:13:18,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:18,817 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:18,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 15:13:18,817 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times [2022-03-15 15:13:18,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:18,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635522078] [2022-03-15 15:13:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:19,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:19,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635522078] [2022-03-15 15:13:19,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635522078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:19,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:19,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 15:13:19,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161753731] [2022-03-15 15:13:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:19,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:13:19,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:19,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:13:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 15:13:19,111 INFO L87 Difference]: Start difference. First operand 11741 states and 23046 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:21,011 INFO L93 Difference]: Finished difference Result 21742 states and 43046 transitions. [2022-03-15 15:13:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 15:13:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2022-03-15 15:13:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:21,042 INFO L225 Difference]: With dead ends: 21742 [2022-03-15 15:13:21,042 INFO L226 Difference]: Without dead ends: 21742 [2022-03-15 15:13:21,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:13:21,043 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 1095 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:21,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 5795 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:13:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2022-03-15 15:13:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608. [2022-03-15 15:13:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11540 states have (on average 1.974003466204506) internal successors, (22780), 11607 states have internal predecessors, (22780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions. [2022-03-15 15:13:21,221 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476 [2022-03-15 15:13:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:21,222 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions. [2022-03-15 15:13:21,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions. [2022-03-15 15:13:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-15 15:13:21,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:21,225 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:21,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 15:13:21,225 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times [2022-03-15 15:13:21,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:21,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117753518] [2022-03-15 15:13:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:21,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:21,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117753518] [2022-03-15 15:13:21,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117753518] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:21,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:21,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:13:21,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407163187] [2022-03-15 15:13:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:21,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:13:21,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:13:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:13:21,403 INFO L87 Difference]: Start difference. First operand 11608 states and 22780 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:21,859 INFO L93 Difference]: Finished difference Result 15459 states and 30482 transitions. [2022-03-15 15:13:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:13:21,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2022-03-15 15:13:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:21,880 INFO L225 Difference]: With dead ends: 15459 [2022-03-15 15:13:21,880 INFO L226 Difference]: Without dead ends: 15459 [2022-03-15 15:13:21,880 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:13:21,880 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:21,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 888 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:13:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2022-03-15 15:13:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246. [2022-03-15 15:13:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12246 states, 12178 states have (on average 1.975365413039908) internal successors, (24056), 12245 states have internal predecessors, (24056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions. [2022-03-15 15:13:22,028 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477 [2022-03-15 15:13:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:22,028 INFO L470 AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions. [2022-03-15 15:13:22,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions. [2022-03-15 15:13:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-15 15:13:22,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:22,031 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:22,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 15:13:22,031 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times [2022-03-15 15:13:22,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:22,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583408593] [2022-03-15 15:13:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:22,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:22,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583408593] [2022-03-15 15:13:22,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583408593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:22,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:22,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:13:22,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4519595] [2022-03-15 15:13:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:22,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:13:22,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:13:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:13:22,230 INFO L87 Difference]: Start difference. First operand 12246 states and 24056 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:22,874 INFO L93 Difference]: Finished difference Result 14561 states and 28686 transitions. [2022-03-15 15:13:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:13:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2022-03-15 15:13:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:22,894 INFO L225 Difference]: With dead ends: 14561 [2022-03-15 15:13:22,894 INFO L226 Difference]: Without dead ends: 14561 [2022-03-15 15:13:22,894 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:13:22,894 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:22,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1220 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:13:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2022-03-15 15:13:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666. [2022-03-15 15:13:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12600 states have (on average 1.9758730158730158) internal successors, (24896), 12665 states have internal predecessors, (24896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions. [2022-03-15 15:13:23,051 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477 [2022-03-15 15:13:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:23,051 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions. [2022-03-15 15:13:23,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions. [2022-03-15 15:13:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:23,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:23,056 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:23,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 15:13:23,056 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times [2022-03-15 15:13:23,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:23,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136586343] [2022-03-15 15:13:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:23,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:23,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136586343] [2022-03-15 15:13:23,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136586343] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:23,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:23,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:23,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062301244] [2022-03-15 15:13:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:23,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:23,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:23,328 INFO L87 Difference]: Start difference. First operand 12666 states and 24896 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:24,338 INFO L93 Difference]: Finished difference Result 12802 states and 25168 transitions. [2022-03-15 15:13:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:13:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:24,354 INFO L225 Difference]: With dead ends: 12802 [2022-03-15 15:13:24,354 INFO L226 Difference]: Without dead ends: 12802 [2022-03-15 15:13:24,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:13:24,354 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 565 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:24,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 2745 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:13:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-03-15 15:13:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683. [2022-03-15 15:13:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12683 states, 12617 states have (on average 1.9759055242926211) internal successors, (24930), 12682 states have internal predecessors, (24930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions. [2022-03-15 15:13:24,541 INFO L78 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484 [2022-03-15 15:13:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:24,541 INFO L470 AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions. [2022-03-15 15:13:24,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions. [2022-03-15 15:13:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:24,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:24,545 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:24,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 15:13:24,545 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times [2022-03-15 15:13:24,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:24,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579899135] [2022-03-15 15:13:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:24,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:24,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579899135] [2022-03-15 15:13:24,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579899135] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:24,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:24,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:24,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272728885] [2022-03-15 15:13:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:24,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:24,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:24,831 INFO L87 Difference]: Start difference. First operand 12683 states and 24930 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:26,001 INFO L93 Difference]: Finished difference Result 12858 states and 25280 transitions. [2022-03-15 15:13:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:13:26,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:26,016 INFO L225 Difference]: With dead ends: 12858 [2022-03-15 15:13:26,016 INFO L226 Difference]: Without dead ends: 12858 [2022-03-15 15:13:26,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:13:26,017 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:26,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 3092 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:13:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-15 15:13:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703. [2022-03-15 15:13:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12703 states, 12637 states have (on average 1.9759436575136504) internal successors, (24970), 12702 states have internal predecessors, (24970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions. [2022-03-15 15:13:26,163 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484 [2022-03-15 15:13:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:26,164 INFO L470 AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions. [2022-03-15 15:13:26,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions. [2022-03-15 15:13:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:26,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:26,167 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:26,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 15:13:26,168 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times [2022-03-15 15:13:26,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:26,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434766298] [2022-03-15 15:13:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:26,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:26,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434766298] [2022-03-15 15:13:26,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434766298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:26,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:26,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:26,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169586546] [2022-03-15 15:13:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:26,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:26,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:26,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:26,448 INFO L87 Difference]: Start difference. First operand 12703 states and 24970 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:27,602 INFO L93 Difference]: Finished difference Result 12891 states and 25346 transitions. [2022-03-15 15:13:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:13:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:27,617 INFO L225 Difference]: With dead ends: 12891 [2022-03-15 15:13:27,618 INFO L226 Difference]: Without dead ends: 12891 [2022-03-15 15:13:27,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:27,618 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 578 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:27,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 2818 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:13:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2022-03-15 15:13:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704. [2022-03-15 15:13:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12704 states, 12638 states have (on average 1.9759455610064884) internal successors, (24972), 12703 states have internal predecessors, (24972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions. [2022-03-15 15:13:27,775 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484 [2022-03-15 15:13:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:27,775 INFO L470 AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions. [2022-03-15 15:13:27,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions. [2022-03-15 15:13:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:27,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:27,778 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:27,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-15 15:13:27,778 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times [2022-03-15 15:13:27,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:27,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167333590] [2022-03-15 15:13:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:28,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:28,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167333590] [2022-03-15 15:13:28,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167333590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:28,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:28,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:28,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823722357] [2022-03-15 15:13:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:28,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:28,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:28,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:28,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:28,032 INFO L87 Difference]: Start difference. First operand 12704 states and 24972 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:29,409 INFO L93 Difference]: Finished difference Result 12912 states and 25388 transitions. [2022-03-15 15:13:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:13:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:29,426 INFO L225 Difference]: With dead ends: 12912 [2022-03-15 15:13:29,426 INFO L226 Difference]: Without dead ends: 12912 [2022-03-15 15:13:29,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:13:29,427 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 601 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:29,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3300 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-03-15 15:13:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723. [2022-03-15 15:13:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12657 states have (on average 1.9759816702220114) internal successors, (25010), 12722 states have internal predecessors, (25010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions. [2022-03-15 15:13:29,578 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484 [2022-03-15 15:13:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:29,579 INFO L470 AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions. [2022-03-15 15:13:29,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions. [2022-03-15 15:13:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:29,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:29,582 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:29,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-15 15:13:29,582 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times [2022-03-15 15:13:29,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:29,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793354175] [2022-03-15 15:13:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:29,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:29,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793354175] [2022-03-15 15:13:29,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793354175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:29,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:29,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:29,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400255090] [2022-03-15 15:13:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:29,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:29,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:29,867 INFO L87 Difference]: Start difference. First operand 12723 states and 25010 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:30,851 INFO L93 Difference]: Finished difference Result 12970 states and 25504 transitions. [2022-03-15 15:13:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:13:30,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:30,867 INFO L225 Difference]: With dead ends: 12970 [2022-03-15 15:13:30,868 INFO L226 Difference]: Without dead ends: 12970 [2022-03-15 15:13:30,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:13:30,868 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 613 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:30,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2440 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:13:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2022-03-15 15:13:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743. [2022-03-15 15:13:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12743 states, 12677 states have (on average 1.9760195629880886) internal successors, (25050), 12742 states have internal predecessors, (25050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions. [2022-03-15 15:13:31,027 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484 [2022-03-15 15:13:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:31,027 INFO L470 AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions. [2022-03-15 15:13:31,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions. [2022-03-15 15:13:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:31,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:31,030 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:31,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 15:13:31,031 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times [2022-03-15 15:13:31,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:31,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359030864] [2022-03-15 15:13:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:31,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:31,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359030864] [2022-03-15 15:13:31,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359030864] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:31,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:31,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:31,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114339883] [2022-03-15 15:13:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:31,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:31,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:31,279 INFO L87 Difference]: Start difference. First operand 12743 states and 25050 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:32,563 INFO L93 Difference]: Finished difference Result 13201 states and 25966 transitions. [2022-03-15 15:13:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:13:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:32,584 INFO L225 Difference]: With dead ends: 13201 [2022-03-15 15:13:32,585 INFO L226 Difference]: Without dead ends: 13201 [2022-03-15 15:13:32,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:13:32,585 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 722 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:32,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 3462 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:13:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2022-03-15 15:13:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755. [2022-03-15 15:13:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12755 states, 12689 states have (on average 1.976042241311372) internal successors, (25074), 12754 states have internal predecessors, (25074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions. [2022-03-15 15:13:32,741 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484 [2022-03-15 15:13:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:32,742 INFO L470 AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions. [2022-03-15 15:13:32,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions. [2022-03-15 15:13:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:32,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:32,745 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:32,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 15:13:32,745 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times [2022-03-15 15:13:32,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:32,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568871171] [2022-03-15 15:13:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:32,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:32,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568871171] [2022-03-15 15:13:32,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568871171] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:32,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:32,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:32,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9578867] [2022-03-15 15:13:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:32,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:32,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:32,969 INFO L87 Difference]: Start difference. First operand 12755 states and 25074 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:34,471 INFO L93 Difference]: Finished difference Result 23707 states and 46979 transitions. [2022-03-15 15:13:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:13:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:34,505 INFO L225 Difference]: With dead ends: 23707 [2022-03-15 15:13:34,505 INFO L226 Difference]: Without dead ends: 23707 [2022-03-15 15:13:34,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 15:13:34,505 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 1339 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:34,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 4354 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2022-03-15 15:13:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962. [2022-03-15 15:13:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12896 states have (on average 1.9764267990074442) internal successors, (25488), 12961 states have internal predecessors, (25488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions. [2022-03-15 15:13:34,723 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484 [2022-03-15 15:13:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:34,723 INFO L470 AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions. [2022-03-15 15:13:34,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions. [2022-03-15 15:13:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:34,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:34,727 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:34,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-15 15:13:34,727 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times [2022-03-15 15:13:34,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:34,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224534155] [2022-03-15 15:13:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:34,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:34,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224534155] [2022-03-15 15:13:34,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224534155] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:34,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:34,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:34,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852589855] [2022-03-15 15:13:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:34,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:34,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:34,984 INFO L87 Difference]: Start difference. First operand 12962 states and 25488 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:36,575 INFO L93 Difference]: Finished difference Result 23598 states and 46761 transitions. [2022-03-15 15:13:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 15:13:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:36,609 INFO L225 Difference]: With dead ends: 23598 [2022-03-15 15:13:36,609 INFO L226 Difference]: Without dead ends: 23598 [2022-03-15 15:13:36,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:13:36,609 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1413 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:36,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1413 Valid, 3998 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2022-03-15 15:13:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954. [2022-03-15 15:13:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12954 states, 12889 states have (on average 1.9762588253549538) internal successors, (25472), 12953 states have internal predecessors, (25472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions. [2022-03-15 15:13:36,812 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484 [2022-03-15 15:13:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:36,813 INFO L470 AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions. [2022-03-15 15:13:36,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions. [2022-03-15 15:13:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:36,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:36,816 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:36,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-15 15:13:36,816 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times [2022-03-15 15:13:36,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:36,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627546571] [2022-03-15 15:13:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:36,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:37,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:37,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627546571] [2022-03-15 15:13:37,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627546571] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:37,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:37,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:37,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318324605] [2022-03-15 15:13:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:37,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:37,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:37,094 INFO L87 Difference]: Start difference. First operand 12954 states and 25472 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:38,522 INFO L93 Difference]: Finished difference Result 24018 states and 47600 transitions. [2022-03-15 15:13:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:13:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:38,559 INFO L225 Difference]: With dead ends: 24018 [2022-03-15 15:13:38,560 INFO L226 Difference]: Without dead ends: 24018 [2022-03-15 15:13:38,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:13:38,560 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 913 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:38,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4241 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-03-15 15:13:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195. [2022-03-15 15:13:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13195 states, 13130 states have (on average 1.9766945925361767) internal successors, (25954), 13194 states have internal predecessors, (25954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions. [2022-03-15 15:13:38,782 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484 [2022-03-15 15:13:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:38,782 INFO L470 AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions. [2022-03-15 15:13:38,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions. [2022-03-15 15:13:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:38,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:38,786 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:38,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-15 15:13:38,786 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times [2022-03-15 15:13:38,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:38,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813558828] [2022-03-15 15:13:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:39,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:39,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813558828] [2022-03-15 15:13:39,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813558828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:39,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:39,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:39,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350025111] [2022-03-15 15:13:39,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:39,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:39,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:39,078 INFO L87 Difference]: Start difference. First operand 13195 states and 25954 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:39,915 INFO L93 Difference]: Finished difference Result 13507 states and 26578 transitions. [2022-03-15 15:13:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:13:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:39,933 INFO L225 Difference]: With dead ends: 13507 [2022-03-15 15:13:39,934 INFO L226 Difference]: Without dead ends: 13507 [2022-03-15 15:13:39,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:13:39,934 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:39,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 2672 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2022-03-15 15:13:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199. [2022-03-15 15:13:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-15 15:13:40,099 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-15 15:13:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:40,099 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-15 15:13:40,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-15 15:13:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:40,103 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:40,103 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:40,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-15 15:13:40,103 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times [2022-03-15 15:13:40,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:40,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267609716] [2022-03-15 15:13:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:40,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:40,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267609716] [2022-03-15 15:13:40,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267609716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:40,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:40,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:40,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771101520] [2022-03-15 15:13:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:40,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:40,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:40,358 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:41,124 INFO L93 Difference]: Finished difference Result 13561 states and 26686 transitions. [2022-03-15 15:13:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:13:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:41,138 INFO L225 Difference]: With dead ends: 13561 [2022-03-15 15:13:41,138 INFO L226 Difference]: Without dead ends: 13561 [2022-03-15 15:13:41,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:41,139 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:41,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2252 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:13:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2022-03-15 15:13:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199. [2022-03-15 15:13:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-15 15:13:41,280 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-15 15:13:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:41,281 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-15 15:13:41,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-15 15:13:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:41,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:41,284 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:41,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-15 15:13:41,284 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times [2022-03-15 15:13:41,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:41,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842704040] [2022-03-15 15:13:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:41,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:41,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842704040] [2022-03-15 15:13:41,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842704040] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:41,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:41,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:41,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873659451] [2022-03-15 15:13:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:41,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:41,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:41,547 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:42,499 INFO L93 Difference]: Finished difference Result 13609 states and 26782 transitions. [2022-03-15 15:13:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:13:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:42,518 INFO L225 Difference]: With dead ends: 13609 [2022-03-15 15:13:42,518 INFO L226 Difference]: Without dead ends: 13609 [2022-03-15 15:13:42,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:42,518 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 332 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:42,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 2810 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:13:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2022-03-15 15:13:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199. [2022-03-15 15:13:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-15 15:13:42,676 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-15 15:13:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:42,676 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-15 15:13:42,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-15 15:13:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:42,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:42,680 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:42,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-15 15:13:42,680 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times [2022-03-15 15:13:42,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:42,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973024626] [2022-03-15 15:13:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:42,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:42,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973024626] [2022-03-15 15:13:42,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973024626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:42,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:42,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:42,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186231156] [2022-03-15 15:13:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:42,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:42,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:42,930 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:43,707 INFO L93 Difference]: Finished difference Result 13663 states and 26890 transitions. [2022-03-15 15:13:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:13:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:43,724 INFO L225 Difference]: With dead ends: 13663 [2022-03-15 15:13:43,725 INFO L226 Difference]: Without dead ends: 13663 [2022-03-15 15:13:43,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:43,725 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:43,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 2303 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:13:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2022-03-15 15:13:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199. [2022-03-15 15:13:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-15 15:13:43,876 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-15 15:13:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:43,876 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-15 15:13:43,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-15 15:13:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:43,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:43,880 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:43,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-15 15:13:43,880 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times [2022-03-15 15:13:43,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:43,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342806266] [2022-03-15 15:13:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:44,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:44,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342806266] [2022-03-15 15:13:44,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342806266] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:44,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:44,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:44,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431820425] [2022-03-15 15:13:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:44,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:44,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:44,132 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:45,550 INFO L93 Difference]: Finished difference Result 23784 states and 47132 transitions. [2022-03-15 15:13:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:13:45,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:45,582 INFO L225 Difference]: With dead ends: 23784 [2022-03-15 15:13:45,583 INFO L226 Difference]: Without dead ends: 23784 [2022-03-15 15:13:45,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:13:45,583 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 765 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:45,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 4807 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:13:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2022-03-15 15:13:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971. [2022-03-15 15:13:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-15 15:13:45,791 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-15 15:13:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:45,791 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-15 15:13:45,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-15 15:13:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:45,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:45,795 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:45,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-15 15:13:45,795 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times [2022-03-15 15:13:45,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:45,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772792480] [2022-03-15 15:13:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:46,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:46,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772792480] [2022-03-15 15:13:46,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772792480] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:46,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:46,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:46,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312346792] [2022-03-15 15:13:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:46,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:46,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:46,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:46,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:46,065 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:47,606 INFO L93 Difference]: Finished difference Result 23965 states and 47494 transitions. [2022-03-15 15:13:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:13:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:47,638 INFO L225 Difference]: With dead ends: 23965 [2022-03-15 15:13:47,638 INFO L226 Difference]: Without dead ends: 23965 [2022-03-15 15:13:47,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:13:47,638 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:47,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 4774 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:13:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23965 states. [2022-03-15 15:13:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214. [2022-03-15 15:13:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:13:47,837 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:13:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:47,837 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:13:47,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:13:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:47,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:47,841 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:47,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-15 15:13:47,841 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:47,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times [2022-03-15 15:13:47,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:47,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389542843] [2022-03-15 15:13:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:48,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:48,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389542843] [2022-03-15 15:13:48,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389542843] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:48,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:48,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:48,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922189793] [2022-03-15 15:13:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:48,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:48,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:48,071 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:49,574 INFO L93 Difference]: Finished difference Result 23857 states and 47278 transitions. [2022-03-15 15:13:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 15:13:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:49,606 INFO L225 Difference]: With dead ends: 23857 [2022-03-15 15:13:49,607 INFO L226 Difference]: Without dead ends: 23857 [2022-03-15 15:13:49,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:13:49,607 INFO L933 BasicCegarLoop]: 939 mSDtfsCounter, 816 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:49,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 5100 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:13:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2022-03-15 15:13:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971. [2022-03-15 15:13:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-15 15:13:49,807 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-15 15:13:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:49,807 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-15 15:13:49,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-15 15:13:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:49,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:49,811 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:49,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-15 15:13:49,811 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times [2022-03-15 15:13:49,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:49,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301778280] [2022-03-15 15:13:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:50,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:50,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301778280] [2022-03-15 15:13:50,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301778280] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:50,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:50,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:50,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238146864] [2022-03-15 15:13:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:50,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:50,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:50,047 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:51,378 INFO L93 Difference]: Finished difference Result 25380 states and 50259 transitions. [2022-03-15 15:13:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:13:51,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:51,414 INFO L225 Difference]: With dead ends: 25380 [2022-03-15 15:13:51,414 INFO L226 Difference]: Without dead ends: 25380 [2022-03-15 15:13:51,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 15:13:51,414 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1399 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:51,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 4186 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:13:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-03-15 15:13:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569. [2022-03-15 15:13:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14569 states, 14504 states have (on average 1.993656922228351) internal successors, (28916), 14568 states have internal predecessors, (28916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions. [2022-03-15 15:13:51,725 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484 [2022-03-15 15:13:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:51,725 INFO L470 AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions. [2022-03-15 15:13:51,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions. [2022-03-15 15:13:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:51,729 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:51,729 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:51,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-15 15:13:51,729 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:51,730 INFO L85 PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times [2022-03-15 15:13:51,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:51,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546557591] [2022-03-15 15:13:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:51,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:51,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546557591] [2022-03-15 15:13:51,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546557591] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:51,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:51,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:51,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123755385] [2022-03-15 15:13:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:51,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:51,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:51,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:51,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:51,970 INFO L87 Difference]: Start difference. First operand 14569 states and 28916 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:52,876 INFO L93 Difference]: Finished difference Result 16297 states and 32307 transitions. [2022-03-15 15:13:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:13:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:52,899 INFO L225 Difference]: With dead ends: 16297 [2022-03-15 15:13:52,899 INFO L226 Difference]: Without dead ends: 16297 [2022-03-15 15:13:52,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:13:52,901 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 574 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:52,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3050 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16297 states. [2022-03-15 15:13:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572. [2022-03-15 15:13:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14507 states have (on average 1.9936582339560212) internal successors, (28922), 14571 states have internal predecessors, (28922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions. [2022-03-15 15:13:53,082 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484 [2022-03-15 15:13:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:53,083 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions. [2022-03-15 15:13:53,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions. [2022-03-15 15:13:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:53,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:53,086 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:53,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-15 15:13:53,087 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times [2022-03-15 15:13:53,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:53,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261313587] [2022-03-15 15:13:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:53,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:53,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:53,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261313587] [2022-03-15 15:13:53,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261313587] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:53,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:53,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:53,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780986543] [2022-03-15 15:13:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:53,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:53,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:53,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:53,354 INFO L87 Difference]: Start difference. First operand 14572 states and 28922 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:54,428 INFO L93 Difference]: Finished difference Result 16351 states and 32415 transitions. [2022-03-15 15:13:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:13:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:54,449 INFO L225 Difference]: With dead ends: 16351 [2022-03-15 15:13:54,449 INFO L226 Difference]: Without dead ends: 16351 [2022-03-15 15:13:54,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:13:54,450 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 601 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:54,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3454 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:13:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2022-03-15 15:13:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571. [2022-03-15 15:13:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14571 states, 14506 states have (on average 1.9936577967737488) internal successors, (28920), 14570 states have internal predecessors, (28920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions. [2022-03-15 15:13:54,643 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484 [2022-03-15 15:13:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:54,643 INFO L470 AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions. [2022-03-15 15:13:54,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions. [2022-03-15 15:13:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:54,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:54,648 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:54,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-15 15:13:54,648 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times [2022-03-15 15:13:54,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:54,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417568077] [2022-03-15 15:13:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:54,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:54,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417568077] [2022-03-15 15:13:54,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417568077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:54,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:54,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:54,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271825350] [2022-03-15 15:13:54,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:54,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:54,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:54,883 INFO L87 Difference]: Start difference. First operand 14571 states and 28920 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:55,716 INFO L93 Difference]: Finished difference Result 16399 states and 32511 transitions. [2022-03-15 15:13:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:13:55,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:55,737 INFO L225 Difference]: With dead ends: 16399 [2022-03-15 15:13:55,737 INFO L226 Difference]: Without dead ends: 16399 [2022-03-15 15:13:55,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:13:55,738 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 616 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:55,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 2788 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2022-03-15 15:13:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570. [2022-03-15 15:13:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-15 15:13:55,907 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-15 15:13:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:55,907 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-15 15:13:55,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-15 15:13:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:55,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:55,911 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:55,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-15 15:13:55,911 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times [2022-03-15 15:13:55,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:55,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661823386] [2022-03-15 15:13:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:56,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:56,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661823386] [2022-03-15 15:13:56,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661823386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:56,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:56,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:56,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538336581] [2022-03-15 15:13:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:56,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:56,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:56,217 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:57,068 INFO L93 Difference]: Finished difference Result 16449 states and 32611 transitions. [2022-03-15 15:13:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:13:57,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:57,089 INFO L225 Difference]: With dead ends: 16449 [2022-03-15 15:13:57,089 INFO L226 Difference]: Without dead ends: 16449 [2022-03-15 15:13:57,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:13:57,090 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 629 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:57,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2795 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:13:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2022-03-15 15:13:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570. [2022-03-15 15:13:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-15 15:13:57,267 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-15 15:13:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:57,267 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-15 15:13:57,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-15 15:13:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:57,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:57,271 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:57,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-15 15:13:57,271 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times [2022-03-15 15:13:57,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:57,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094681368] [2022-03-15 15:13:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:57,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:57,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094681368] [2022-03-15 15:13:57,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094681368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:57,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:57,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:57,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759820412] [2022-03-15 15:13:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:57,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:57,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:57,539 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:59,104 INFO L93 Difference]: Finished difference Result 16314 states and 32340 transitions. [2022-03-15 15:13:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 15:13:59,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:13:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:59,129 INFO L225 Difference]: With dead ends: 16314 [2022-03-15 15:13:59,129 INFO L226 Difference]: Without dead ends: 16314 [2022-03-15 15:13:59,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:13:59,129 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 722 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:59,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 4009 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:13:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2022-03-15 15:13:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555. [2022-03-15 15:13:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14555 states, 14490 states have (on average 1.9935127674258108) internal successors, (28886), 14554 states have internal predecessors, (28886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions. [2022-03-15 15:13:59,294 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484 [2022-03-15 15:13:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:59,297 INFO L470 AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions. [2022-03-15 15:13:59,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions. [2022-03-15 15:13:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:13:59,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:59,302 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:59,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-15 15:13:59,302 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:13:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times [2022-03-15 15:13:59,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:59,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32800049] [2022-03-15 15:13:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:13:59,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:59,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32800049] [2022-03-15 15:13:59,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32800049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:59,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:59,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:13:59,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990083123] [2022-03-15 15:13:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:59,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:13:59,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:13:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:13:59,591 INFO L87 Difference]: Start difference. First operand 14555 states and 28886 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:01,313 INFO L93 Difference]: Finished difference Result 16306 states and 32322 transitions. [2022-03-15 15:14:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:14:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:01,336 INFO L225 Difference]: With dead ends: 16306 [2022-03-15 15:14:01,336 INFO L226 Difference]: Without dead ends: 16306 [2022-03-15 15:14:01,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:14:01,336 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 721 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:01,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 4098 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 15:14:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2022-03-15 15:14:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556. [2022-03-15 15:14:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14556 states, 14491 states have (on average 1.993513215099027) internal successors, (28888), 14555 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions. [2022-03-15 15:14:01,502 INFO L78 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484 [2022-03-15 15:14:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:01,502 INFO L470 AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions. [2022-03-15 15:14:01,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions. [2022-03-15 15:14:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:01,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:01,506 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:01,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-15 15:14:01,506 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times [2022-03-15 15:14:01,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:01,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28987233] [2022-03-15 15:14:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:01,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:01,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28987233] [2022-03-15 15:14:01,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28987233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:01,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:01,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:01,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899320530] [2022-03-15 15:14:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:01,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:01,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:01,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:01,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:01,816 INFO L87 Difference]: Start difference. First operand 14556 states and 28888 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:03,579 INFO L93 Difference]: Finished difference Result 16359 states and 32428 transitions. [2022-03-15 15:14:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:14:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:03,601 INFO L225 Difference]: With dead ends: 16359 [2022-03-15 15:14:03,601 INFO L226 Difference]: Without dead ends: 16359 [2022-03-15 15:14:03,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:14:03,602 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 734 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:03,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 4291 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 15:14:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2022-03-15 15:14:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540. [2022-03-15 15:14:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14540 states, 14475 states have (on average 1.9933678756476685) internal successors, (28854), 14539 states have internal predecessors, (28854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions. [2022-03-15 15:14:03,780 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484 [2022-03-15 15:14:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:03,780 INFO L470 AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions. [2022-03-15 15:14:03,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions. [2022-03-15 15:14:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:03,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:03,784 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:03,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-15 15:14:03,784 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times [2022-03-15 15:14:03,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:03,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854573947] [2022-03-15 15:14:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:04,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:04,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854573947] [2022-03-15 15:14:04,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854573947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:04,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:04,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:04,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557371071] [2022-03-15 15:14:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:04,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:04,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:04,033 INFO L87 Difference]: Start difference. First operand 14540 states and 28854 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:05,077 INFO L93 Difference]: Finished difference Result 16300 states and 32309 transitions. [2022-03-15 15:14:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:14:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:05,098 INFO L225 Difference]: With dead ends: 16300 [2022-03-15 15:14:05,098 INFO L226 Difference]: Without dead ends: 16300 [2022-03-15 15:14:05,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:14:05,099 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 659 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:05,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 2864 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:14:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16300 states. [2022-03-15 15:14:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542. [2022-03-15 15:14:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14477 states have (on average 1.99336879187677) internal successors, (28858), 14541 states have internal predecessors, (28858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions. [2022-03-15 15:14:05,277 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484 [2022-03-15 15:14:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:05,277 INFO L470 AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions. [2022-03-15 15:14:05,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions. [2022-03-15 15:14:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:05,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:05,281 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:05,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-15 15:14:05,281 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times [2022-03-15 15:14:05,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:05,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147520442] [2022-03-15 15:14:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:05,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:05,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147520442] [2022-03-15 15:14:05,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147520442] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:05,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:05,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:05,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618234468] [2022-03-15 15:14:05,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:05,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:05,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:05,557 INFO L87 Difference]: Start difference. First operand 14542 states and 28858 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:06,904 INFO L93 Difference]: Finished difference Result 16358 states and 32425 transitions. [2022-03-15 15:14:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:14:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:06,926 INFO L225 Difference]: With dead ends: 16358 [2022-03-15 15:14:06,926 INFO L226 Difference]: Without dead ends: 16358 [2022-03-15 15:14:06,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:14:06,926 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 664 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:06,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 3416 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:14:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-03-15 15:14:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541. [2022-03-15 15:14:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14541 states, 14476 states have (on average 1.9933683337938657) internal successors, (28856), 14540 states have internal predecessors, (28856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions. [2022-03-15 15:14:07,222 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484 [2022-03-15 15:14:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:07,222 INFO L470 AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions. [2022-03-15 15:14:07,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions. [2022-03-15 15:14:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:07,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:07,227 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:07,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-15 15:14:07,227 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times [2022-03-15 15:14:07,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:07,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429987182] [2022-03-15 15:14:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:07,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:07,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429987182] [2022-03-15 15:14:07,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429987182] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:07,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:07,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:07,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086183813] [2022-03-15 15:14:07,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:07,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:07,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:07,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:07,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:07,518 INFO L87 Difference]: Start difference. First operand 14541 states and 28856 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:09,116 INFO L93 Difference]: Finished difference Result 16443 states and 32595 transitions. [2022-03-15 15:14:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:14:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:09,138 INFO L225 Difference]: With dead ends: 16443 [2022-03-15 15:14:09,138 INFO L226 Difference]: Without dead ends: 16443 [2022-03-15 15:14:09,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:14:09,139 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 675 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:09,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 3881 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:14:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2022-03-15 15:14:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214. [2022-03-15 15:14:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:09,305 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:09,306 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:09,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:09,309 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:09,309 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:09,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-15 15:14:09,309 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times [2022-03-15 15:14:09,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:09,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63598531] [2022-03-15 15:14:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:09,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:09,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63598531] [2022-03-15 15:14:09,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63598531] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:09,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:09,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:09,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885809453] [2022-03-15 15:14:09,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:09,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:09,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:09,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:09,553 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:10,823 INFO L93 Difference]: Finished difference Result 14947 states and 29393 transitions. [2022-03-15 15:14:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:14:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:10,844 INFO L225 Difference]: With dead ends: 14947 [2022-03-15 15:14:10,844 INFO L226 Difference]: Without dead ends: 14947 [2022-03-15 15:14:10,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:14:10,845 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 572 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3553 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:10,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 3553 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:14:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-03-15 15:14:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217. [2022-03-15 15:14:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13217 states, 13152 states have (on average 1.9767335766423357) internal successors, (25998), 13216 states have internal predecessors, (25998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions. [2022-03-15 15:14:11,009 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484 [2022-03-15 15:14:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:11,009 INFO L470 AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions. [2022-03-15 15:14:11,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions. [2022-03-15 15:14:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:11,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:11,012 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:11,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-15 15:14:11,013 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times [2022-03-15 15:14:11,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:11,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523565427] [2022-03-15 15:14:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:11,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:11,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523565427] [2022-03-15 15:14:11,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523565427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:11,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:11,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:11,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756047582] [2022-03-15 15:14:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:11,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:11,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:11,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:11,256 INFO L87 Difference]: Start difference. First operand 13217 states and 25998 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:12,276 INFO L93 Difference]: Finished difference Result 15001 states and 29501 transitions. [2022-03-15 15:14:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:14:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:12,296 INFO L225 Difference]: With dead ends: 15001 [2022-03-15 15:14:12,296 INFO L226 Difference]: Without dead ends: 15001 [2022-03-15 15:14:12,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:14:12,297 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 589 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:12,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2837 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:14:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15001 states. [2022-03-15 15:14:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216. [2022-03-15 15:14:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 13151 states have (on average 1.9767318074671127) internal successors, (25996), 13215 states have internal predecessors, (25996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions. [2022-03-15 15:14:12,573 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484 [2022-03-15 15:14:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:12,573 INFO L470 AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions. [2022-03-15 15:14:12,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions. [2022-03-15 15:14:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:12,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:12,577 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:12,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-15 15:14:12,577 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:12,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times [2022-03-15 15:14:12,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:12,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739767116] [2022-03-15 15:14:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:12,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:12,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739767116] [2022-03-15 15:14:12,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739767116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:12,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:12,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:12,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559316524] [2022-03-15 15:14:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:12,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:12,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:12,830 INFO L87 Difference]: Start difference. First operand 13216 states and 25996 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:13,840 INFO L93 Difference]: Finished difference Result 15052 states and 29603 transitions. [2022-03-15 15:14:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:14:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:13,859 INFO L225 Difference]: With dead ends: 15052 [2022-03-15 15:14:13,860 INFO L226 Difference]: Without dead ends: 15052 [2022-03-15 15:14:13,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:14:13,860 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 602 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:13,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 2695 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:14:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2022-03-15 15:14:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215. [2022-03-15 15:14:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13150 states have (on average 1.9767300380228137) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-15 15:14:14,019 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-15 15:14:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:14,019 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-15 15:14:14,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-15 15:14:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:14,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:14,024 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:14,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-15 15:14:14,025 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times [2022-03-15 15:14:14,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:14,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068002867] [2022-03-15 15:14:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:14,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:14,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068002867] [2022-03-15 15:14:14,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068002867] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:14,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:14,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:14,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589715141] [2022-03-15 15:14:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:14,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:14,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:14,323 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:15,682 INFO L93 Difference]: Finished difference Result 15095 states and 29689 transitions. [2022-03-15 15:14:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:14:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:15,702 INFO L225 Difference]: With dead ends: 15095 [2022-03-15 15:14:15,702 INFO L226 Difference]: Without dead ends: 15095 [2022-03-15 15:14:15,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:14:15,703 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 623 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:15,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 3466 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:14:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2022-03-15 15:14:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214. [2022-03-15 15:14:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:15,863 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:15,863 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:15,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:15,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:15,867 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:15,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-15 15:14:15,867 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times [2022-03-15 15:14:15,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:15,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178815358] [2022-03-15 15:14:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:16,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:16,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178815358] [2022-03-15 15:14:16,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178815358] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:16,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:16,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:16,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463035065] [2022-03-15 15:14:16,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:16,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:16,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:16,080 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:17,805 INFO L93 Difference]: Finished difference Result 25238 states and 49975 transitions. [2022-03-15 15:14:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 15:14:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:17,842 INFO L225 Difference]: With dead ends: 25238 [2022-03-15 15:14:17,842 INFO L226 Difference]: Without dead ends: 25238 [2022-03-15 15:14:17,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:14:17,843 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1188 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:17,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 5500 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:14:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25238 states. [2022-03-15 15:14:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987. [2022-03-15 15:14:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12923 states have (on average 1.976166524800743) internal successors, (25538), 12986 states have internal predecessors, (25538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions. [2022-03-15 15:14:18,145 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484 [2022-03-15 15:14:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:18,146 INFO L470 AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions. [2022-03-15 15:14:18,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions. [2022-03-15 15:14:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:18,148 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:18,149 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:18,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-15 15:14:18,149 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times [2022-03-15 15:14:18,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:18,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134399150] [2022-03-15 15:14:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:18,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:18,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134399150] [2022-03-15 15:14:18,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134399150] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:18,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:18,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:18,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565020967] [2022-03-15 15:14:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:18,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:18,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:18,372 INFO L87 Difference]: Start difference. First operand 12987 states and 25538 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:19,519 INFO L93 Difference]: Finished difference Result 24029 states and 47620 transitions. [2022-03-15 15:14:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 15:14:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:19,555 INFO L225 Difference]: With dead ends: 24029 [2022-03-15 15:14:19,555 INFO L226 Difference]: Without dead ends: 24029 [2022-03-15 15:14:19,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:14:19,555 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 1045 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:19,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 4040 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:14:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2022-03-15 15:14:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215. [2022-03-15 15:14:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13151 states have (on average 1.9765797277773554) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-15 15:14:19,769 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-15 15:14:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:19,770 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-15 15:14:19,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-15 15:14:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:19,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:19,773 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:19,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-15 15:14:19,773 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:19,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times [2022-03-15 15:14:19,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:19,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767960553] [2022-03-15 15:14:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:20,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:20,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767960553] [2022-03-15 15:14:20,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767960553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:20,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:20,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:20,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121986095] [2022-03-15 15:14:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:20,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:20,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:20,023 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:20,732 INFO L93 Difference]: Finished difference Result 13519 states and 26600 transitions. [2022-03-15 15:14:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 15:14:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:20,749 INFO L225 Difference]: With dead ends: 13519 [2022-03-15 15:14:20,750 INFO L226 Difference]: Without dead ends: 13519 [2022-03-15 15:14:20,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:14:20,750 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 282 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:20,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 2734 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:14:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2022-03-15 15:14:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214. [2022-03-15 15:14:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:20,907 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:20,907 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:20,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:20,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:20,910 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:20,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-15 15:14:20,911 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times [2022-03-15 15:14:20,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:20,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670786336] [2022-03-15 15:14:20,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:21,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:21,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670786336] [2022-03-15 15:14:21,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670786336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:21,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:21,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:21,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792595807] [2022-03-15 15:14:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:21,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:21,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:21,178 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:21,819 INFO L93 Difference]: Finished difference Result 13573 states and 26708 transitions. [2022-03-15 15:14:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 15:14:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:21,838 INFO L225 Difference]: With dead ends: 13573 [2022-03-15 15:14:21,838 INFO L226 Difference]: Without dead ends: 13573 [2022-03-15 15:14:21,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:14:21,838 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 300 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:21,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 2444 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:14:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2022-03-15 15:14:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214. [2022-03-15 15:14:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:21,991 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:21,992 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:21,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:21,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:21,995 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:21,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-15 15:14:21,995 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times [2022-03-15 15:14:21,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:21,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120247850] [2022-03-15 15:14:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:22,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:22,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120247850] [2022-03-15 15:14:22,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120247850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:22,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:22,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:22,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388048571] [2022-03-15 15:14:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:22,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:22,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:22,309 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:23,350 INFO L93 Difference]: Finished difference Result 13621 states and 26804 transitions. [2022-03-15 15:14:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:14:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:23,369 INFO L225 Difference]: With dead ends: 13621 [2022-03-15 15:14:23,369 INFO L226 Difference]: Without dead ends: 13621 [2022-03-15 15:14:23,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 15:14:23,369 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:23,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3333 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:14:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13621 states. [2022-03-15 15:14:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214. [2022-03-15 15:14:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:23,532 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:23,533 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:23,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:23,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:23,536 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:23,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-15 15:14:23,536 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times [2022-03-15 15:14:23,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:23,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925266640] [2022-03-15 15:14:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:23,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:23,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925266640] [2022-03-15 15:14:23,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925266640] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:23,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:23,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:23,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552745963] [2022-03-15 15:14:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:23,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:23,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:23,777 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:24,491 INFO L93 Difference]: Finished difference Result 13675 states and 26912 transitions. [2022-03-15 15:14:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:14:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:24,509 INFO L225 Difference]: With dead ends: 13675 [2022-03-15 15:14:24,509 INFO L226 Difference]: Without dead ends: 13675 [2022-03-15 15:14:24,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:14:24,509 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 325 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:24,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 2522 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:14:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13675 states. [2022-03-15 15:14:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214. [2022-03-15 15:14:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-15 15:14:24,666 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-15 15:14:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:24,666 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-15 15:14:24,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-15 15:14:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:24,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:24,670 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:24,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-15 15:14:24,670 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times [2022-03-15 15:14:24,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:24,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515326725] [2022-03-15 15:14:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:24,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:24,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515326725] [2022-03-15 15:14:24,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515326725] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:24,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:24,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:24,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532509258] [2022-03-15 15:14:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:24,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:24,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:24,887 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:26,521 INFO L93 Difference]: Finished difference Result 23827 states and 47216 transitions. [2022-03-15 15:14:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 15:14:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:26,554 INFO L225 Difference]: With dead ends: 23827 [2022-03-15 15:14:26,554 INFO L226 Difference]: Without dead ends: 23827 [2022-03-15 15:14:26,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:14:26,554 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:26,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 5442 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:14:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23827 states. [2022-03-15 15:14:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971. [2022-03-15 15:14:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12907 states have (on average 1.9761369799333695) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-15 15:14:26,766 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-15 15:14:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:26,766 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-15 15:14:26,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-15 15:14:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:26,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:26,770 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:26,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-15 15:14:26,770 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times [2022-03-15 15:14:26,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:26,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980144311] [2022-03-15 15:14:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:26,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:26,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980144311] [2022-03-15 15:14:26,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980144311] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:26,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:26,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:26,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163508682] [2022-03-15 15:14:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:26,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:26,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:26,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:26,996 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:28,353 INFO L93 Difference]: Finished difference Result 23624 states and 46810 transitions. [2022-03-15 15:14:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:14:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:28,382 INFO L225 Difference]: With dead ends: 23624 [2022-03-15 15:14:28,383 INFO L226 Difference]: Without dead ends: 23624 [2022-03-15 15:14:28,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:14:28,383 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:28,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 4411 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:14:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2022-03-15 15:14:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875. [2022-03-15 15:14:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 12812 states have (on average 1.9758039338120512) internal successors, (25314), 12874 states have internal predecessors, (25314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions. [2022-03-15 15:14:28,575 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484 [2022-03-15 15:14:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:28,575 INFO L470 AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions. [2022-03-15 15:14:28,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions. [2022-03-15 15:14:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-15 15:14:28,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:28,579 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:28,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-15 15:14:28,579 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times [2022-03-15 15:14:28,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:28,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653922114] [2022-03-15 15:14:28,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:28,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:28,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653922114] [2022-03-15 15:14:28,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653922114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:28,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:28,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:14:28,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648909752] [2022-03-15 15:14:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:28,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:14:28,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:14:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:14:28,791 INFO L87 Difference]: Start difference. First operand 12875 states and 25314 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:30,353 INFO L93 Difference]: Finished difference Result 23548 states and 46658 transitions. [2022-03-15 15:14:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:14:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2022-03-15 15:14:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:30,386 INFO L225 Difference]: With dead ends: 23548 [2022-03-15 15:14:30,386 INFO L226 Difference]: Without dead ends: 23548 [2022-03-15 15:14:30,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:14:30,387 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 776 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:30,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5079 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:14:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2022-03-15 15:14:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618. [2022-03-15 15:14:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12555 states have (on average 1.9753086419753085) internal successors, (24800), 12617 states have internal predecessors, (24800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions. [2022-03-15 15:14:30,584 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484 [2022-03-15 15:14:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:30,585 INFO L470 AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions. [2022-03-15 15:14:30,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions. [2022-03-15 15:14:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-15 15:14:30,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:30,588 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:30,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-15 15:14:30,588 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times [2022-03-15 15:14:30,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:30,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017339135] [2022-03-15 15:14:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:30,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:30,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017339135] [2022-03-15 15:14:30,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017339135] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:30,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:30,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:30,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351512886] [2022-03-15 15:14:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:30,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:30,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:30,769 INFO L87 Difference]: Start difference. First operand 12618 states and 24800 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:31,145 INFO L93 Difference]: Finished difference Result 13358 states and 26280 transitions. [2022-03-15 15:14:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-03-15 15:14:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:31,162 INFO L225 Difference]: With dead ends: 13358 [2022-03-15 15:14:31,162 INFO L226 Difference]: Without dead ends: 13358 [2022-03-15 15:14:31,162 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:14:31,162 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 250 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:31,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 958 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:14:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2022-03-15 15:14:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928. [2022-03-15 15:14:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12928 states, 12866 states have (on average 1.9757500388621172) internal successors, (25420), 12927 states have internal predecessors, (25420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions. [2022-03-15 15:14:31,304 INFO L78 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488 [2022-03-15 15:14:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:31,304 INFO L470 AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions. [2022-03-15 15:14:31,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions. [2022-03-15 15:14:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-15 15:14:31,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:31,308 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:31,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-15 15:14:31,308 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times [2022-03-15 15:14:31,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:31,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714059871] [2022-03-15 15:14:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:31,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:31,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714059871] [2022-03-15 15:14:31,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714059871] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:31,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:31,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:31,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278846608] [2022-03-15 15:14:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:31,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:31,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:31,484 INFO L87 Difference]: Start difference. First operand 12928 states and 25420 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:32,061 INFO L93 Difference]: Finished difference Result 13909 states and 27382 transitions. [2022-03-15 15:14:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-03-15 15:14:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:32,078 INFO L225 Difference]: With dead ends: 13909 [2022-03-15 15:14:32,078 INFO L226 Difference]: Without dead ends: 13909 [2022-03-15 15:14:32,078 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:14:32,079 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 317 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:32,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1271 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:14:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-03-15 15:14:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339. [2022-03-15 15:14:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13339 states, 13280 states have (on average 1.97605421686747) internal successors, (26242), 13338 states have internal predecessors, (26242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions. [2022-03-15 15:14:32,311 INFO L78 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488 [2022-03-15 15:14:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:32,311 INFO L470 AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions. [2022-03-15 15:14:32,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions. [2022-03-15 15:14:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-15 15:14:32,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:32,314 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:32,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-15 15:14:32,314 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times [2022-03-15 15:14:32,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:32,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192377271] [2022-03-15 15:14:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1294 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-03-15 15:14:33,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:33,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192377271] [2022-03-15 15:14:33,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192377271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:14:33,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699050825] [2022-03-15 15:14:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:14:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:14:33,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:14:33,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 15:14:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:35,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 15:14:35,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:14:36,157 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:14:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:36,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:14:36,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699050825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:36,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:14:36,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2022-03-15 15:14:36,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240301156] [2022-03-15 15:14:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:36,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 15:14:36,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 15:14:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:14:36,272 INFO L87 Difference]: Start difference. First operand 13339 states and 26242 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:36,386 INFO L93 Difference]: Finished difference Result 23576 states and 46647 transitions. [2022-03-15 15:14:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 15:14:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 494 [2022-03-15 15:14:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:36,428 INFO L225 Difference]: With dead ends: 23576 [2022-03-15 15:14:36,429 INFO L226 Difference]: Without dead ends: 23576 [2022-03-15 15:14:36,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:14:36,430 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 445 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:36,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 867 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:14:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23576 states. [2022-03-15 15:14:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23576 to 13477. [2022-03-15 15:14:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13477 states, 13416 states have (on average 1.9714519976147884) internal successors, (26449), 13476 states have internal predecessors, (26449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 26449 transitions. [2022-03-15 15:14:36,635 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 26449 transitions. Word has length 494 [2022-03-15 15:14:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:36,635 INFO L470 AbstractCegarLoop]: Abstraction has 13477 states and 26449 transitions. [2022-03-15 15:14:36,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 26449 transitions. [2022-03-15 15:14:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-15 15:14:36,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:36,639 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:36,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 15:14:36,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:14:36,839 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times [2022-03-15 15:14:36,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:36,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779644874] [2022-03-15 15:14:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1342 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-03-15 15:14:37,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:37,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779644874] [2022-03-15 15:14:37,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779644874] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:14:37,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962923041] [2022-03-15 15:14:37,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:14:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:14:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:14:37,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:14:37,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 15:14:39,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:14:39,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:14:39,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 15:14:39,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:14:40,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:14:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:40,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:14:40,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962923041] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:40,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:14:40,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2022-03-15 15:14:40,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499560046] [2022-03-15 15:14:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:40,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 15:14:40,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 15:14:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:14:40,672 INFO L87 Difference]: Start difference. First operand 13477 states and 26449 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:40,818 INFO L93 Difference]: Finished difference Result 24853 states and 49037 transitions. [2022-03-15 15:14:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 494 [2022-03-15 15:14:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:40,854 INFO L225 Difference]: With dead ends: 24853 [2022-03-15 15:14:40,854 INFO L226 Difference]: Without dead ends: 24853 [2022-03-15 15:14:40,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:14:40,855 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 694 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:40,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 919 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:14:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24853 states. [2022-03-15 15:14:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24853 to 14168. [2022-03-15 15:14:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14168 states, 14103 states have (on average 1.9734808196837552) internal successors, (27832), 14167 states have internal predecessors, (27832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14168 states to 14168 states and 27832 transitions. [2022-03-15 15:14:41,071 INFO L78 Accepts]: Start accepts. Automaton has 14168 states and 27832 transitions. Word has length 494 [2022-03-15 15:14:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:41,071 INFO L470 AbstractCegarLoop]: Abstraction has 14168 states and 27832 transitions. [2022-03-15 15:14:41,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14168 states and 27832 transitions. [2022-03-15 15:14:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-15 15:14:41,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:41,074 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:41,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 15:14:41,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:14:41,275 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times [2022-03-15 15:14:41,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:41,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727559513] [2022-03-15 15:14:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:41,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:41,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727559513] [2022-03-15 15:14:41,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727559513] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:41,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:41,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:41,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286060337] [2022-03-15 15:14:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:41,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:41,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:41,499 INFO L87 Difference]: Start difference. First operand 14168 states and 27832 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:41,927 INFO L93 Difference]: Finished difference Result 14570 states and 28636 transitions. [2022-03-15 15:14:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:41,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-03-15 15:14:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:41,944 INFO L225 Difference]: With dead ends: 14570 [2022-03-15 15:14:41,945 INFO L226 Difference]: Without dead ends: 14570 [2022-03-15 15:14:41,945 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:14:41,945 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:41,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 908 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:14:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14570 states. [2022-03-15 15:14:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 14477. [2022-03-15 15:14:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14477 states, 14413 states have (on average 1.9739124401581905) internal successors, (28450), 14476 states have internal predecessors, (28450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14477 states to 14477 states and 28450 transitions. [2022-03-15 15:14:42,105 INFO L78 Accepts]: Start accepts. Automaton has 14477 states and 28450 transitions. Word has length 497 [2022-03-15 15:14:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:42,105 INFO L470 AbstractCegarLoop]: Abstraction has 14477 states and 28450 transitions. [2022-03-15 15:14:42,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14477 states and 28450 transitions. [2022-03-15 15:14:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-15 15:14:42,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:42,108 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:42,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-03-15 15:14:42,108 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times [2022-03-15 15:14:42,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:42,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362295504] [2022-03-15 15:14:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:42,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:42,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362295504] [2022-03-15 15:14:42,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362295504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:42,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:42,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:42,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130846084] [2022-03-15 15:14:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:42,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:42,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:42,344 INFO L87 Difference]: Start difference. First operand 14477 states and 28450 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:43,021 INFO L93 Difference]: Finished difference Result 15039 states and 29575 transitions. [2022-03-15 15:14:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-03-15 15:14:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:43,041 INFO L225 Difference]: With dead ends: 15039 [2022-03-15 15:14:43,042 INFO L226 Difference]: Without dead ends: 15039 [2022-03-15 15:14:43,042 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:14:43,042 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 313 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:43,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 1267 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 15:14:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15039 states. [2022-03-15 15:14:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15039 to 14910. [2022-03-15 15:14:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14910 states, 14847 states have (on average 1.9746076648481174) internal successors, (29317), 14909 states have internal predecessors, (29317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 29317 transitions. [2022-03-15 15:14:43,206 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 29317 transitions. Word has length 497 [2022-03-15 15:14:43,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:43,206 INFO L470 AbstractCegarLoop]: Abstraction has 14910 states and 29317 transitions. [2022-03-15 15:14:43,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 29317 transitions. [2022-03-15 15:14:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-15 15:14:43,209 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:43,209 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:43,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-03-15 15:14:43,209 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times [2022-03-15 15:14:43,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:43,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015102236] [2022-03-15 15:14:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:43,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:43,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015102236] [2022-03-15 15:14:43,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015102236] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:43,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:43,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:43,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185513920] [2022-03-15 15:14:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:43,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:43,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:43,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:43,408 INFO L87 Difference]: Start difference. First operand 14910 states and 29317 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:43,902 INFO L93 Difference]: Finished difference Result 15314 states and 30125 transitions. [2022-03-15 15:14:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2022-03-15 15:14:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:43,924 INFO L225 Difference]: With dead ends: 15314 [2022-03-15 15:14:43,924 INFO L226 Difference]: Without dead ends: 15314 [2022-03-15 15:14:43,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:43,924 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 241 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:43,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 1207 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:14:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2022-03-15 15:14:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15218. [2022-03-15 15:14:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15218 states, 15156 states have (on average 1.974993401953022) internal successors, (29933), 15217 states have internal predecessors, (29933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 29933 transitions. [2022-03-15 15:14:44,179 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 29933 transitions. Word has length 505 [2022-03-15 15:14:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:44,179 INFO L470 AbstractCegarLoop]: Abstraction has 15218 states and 29933 transitions. [2022-03-15 15:14:44,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 29933 transitions. [2022-03-15 15:14:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-15 15:14:44,182 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:44,182 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:44,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-15 15:14:44,182 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times [2022-03-15 15:14:44,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:44,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962467284] [2022-03-15 15:14:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:44,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:44,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:44,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962467284] [2022-03-15 15:14:44,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962467284] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:44,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:44,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:44,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776610384] [2022-03-15 15:14:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:44,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:44,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:44,415 INFO L87 Difference]: Start difference. First operand 15218 states and 29933 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:44,926 INFO L93 Difference]: Finished difference Result 15782 states and 31062 transitions. [2022-03-15 15:14:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:44,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2022-03-15 15:14:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:44,955 INFO L225 Difference]: With dead ends: 15782 [2022-03-15 15:14:44,955 INFO L226 Difference]: Without dead ends: 15250 [2022-03-15 15:14:44,955 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:14:44,956 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 315 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:44,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 992 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:14:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15250 states. [2022-03-15 15:14:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15250 to 15125. [2022-03-15 15:14:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15125 states, 15064 states have (on average 1.9719861922464152) internal successors, (29706), 15124 states have internal predecessors, (29706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 29706 transitions. [2022-03-15 15:14:45,152 INFO L78 Accepts]: Start accepts. Automaton has 15125 states and 29706 transitions. Word has length 505 [2022-03-15 15:14:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:45,152 INFO L470 AbstractCegarLoop]: Abstraction has 15125 states and 29706 transitions. [2022-03-15 15:14:45,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15125 states and 29706 transitions. [2022-03-15 15:14:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-03-15 15:14:45,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:45,156 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:45,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-15 15:14:45,156 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times [2022-03-15 15:14:45,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:45,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744748625] [2022-03-15 15:14:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:45,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:45,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744748625] [2022-03-15 15:14:45,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744748625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:45,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:45,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:45,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846666786] [2022-03-15 15:14:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:45,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:45,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:45,392 INFO L87 Difference]: Start difference. First operand 15125 states and 29706 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:45,738 INFO L93 Difference]: Finished difference Result 15598 states and 30652 transitions. [2022-03-15 15:14:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 521 [2022-03-15 15:14:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:45,770 INFO L225 Difference]: With dead ends: 15598 [2022-03-15 15:14:45,770 INFO L226 Difference]: Without dead ends: 15598 [2022-03-15 15:14:45,770 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:14:45,770 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 248 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:45,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 755 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:14:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15598 states. [2022-03-15 15:14:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 15416. [2022-03-15 15:14:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15416 states, 15358 states have (on average 1.9721317879932283) internal successors, (30288), 15415 states have internal predecessors, (30288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 30288 transitions. [2022-03-15 15:14:45,977 INFO L78 Accepts]: Start accepts. Automaton has 15416 states and 30288 transitions. Word has length 521 [2022-03-15 15:14:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:45,977 INFO L470 AbstractCegarLoop]: Abstraction has 15416 states and 30288 transitions. [2022-03-15 15:14:45,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15416 states and 30288 transitions. [2022-03-15 15:14:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-03-15 15:14:45,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:45,980 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:45,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-15 15:14:45,981 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times [2022-03-15 15:14:45,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:45,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290300761] [2022-03-15 15:14:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:46,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:46,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290300761] [2022-03-15 15:14:46,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290300761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:46,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:46,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:14:46,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49766655] [2022-03-15 15:14:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:46,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:14:46,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:46,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:14:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:14:46,184 INFO L87 Difference]: Start difference. First operand 15416 states and 30288 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:46,508 INFO L93 Difference]: Finished difference Result 17548 states and 34524 transitions. [2022-03-15 15:14:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:14:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 531 [2022-03-15 15:14:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:46,537 INFO L225 Difference]: With dead ends: 17548 [2022-03-15 15:14:46,537 INFO L226 Difference]: Without dead ends: 17197 [2022-03-15 15:14:46,537 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:14:46,537 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:46,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 876 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:14:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17197 states. [2022-03-15 15:14:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17197 to 15413. [2022-03-15 15:14:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15413 states, 15358 states have (on average 1.963992707383774) internal successors, (30163), 15412 states have internal predecessors, (30163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 30163 transitions. [2022-03-15 15:14:46,755 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 30163 transitions. Word has length 531 [2022-03-15 15:14:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:46,755 INFO L470 AbstractCegarLoop]: Abstraction has 15413 states and 30163 transitions. [2022-03-15 15:14:46,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 30163 transitions. [2022-03-15 15:14:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-15 15:14:46,760 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:46,761 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:46,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-15 15:14:46,761 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:14:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -208741065, now seen corresponding path program 1 times [2022-03-15 15:14:46,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:46,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867737026] [2022-03-15 15:14:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:14:47,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:47,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867737026] [2022-03-15 15:14:47,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867737026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:14:47,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681859681] [2022-03-15 15:14:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:47,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:14:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:14:47,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:14:47,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 15:14:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:50,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 15:14:50,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:14:50,234 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 15:14:50,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-15 15:14:50,347 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-15 15:14:50,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-15 15:14:50,692 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-15 15:14:50,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-15 15:14:50,995 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-15 15:14:50,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-15 15:14:51,255 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-15 15:14:51,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-15 15:14:51,545 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 15:14:51,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-15 15:14:52,018 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 15:14:52,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-15 15:14:52,498 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 15:14:52,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-15 15:14:52,902 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 15:14:52,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-15 15:14:53,359 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 15:14:53,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-15 15:14:53,840 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-15 15:14:53,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-15 15:14:54,484 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-15 15:14:54,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2022-03-15 15:15:03,811 INFO L353 Elim1Store]: treesize reduction 38, result has 48.6 percent of original size [2022-03-15 15:15:03,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2022-03-15 15:15:06,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:06,564 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 15:15:06,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 15:15:06,740 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 15:15:06,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 15:15:07,427 INFO L353 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-03-15 15:15:07,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 50 [2022-03-15 15:15:07,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 15:15:07,673 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 15:15:07,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 15:15:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2022-03-15 15:15:07,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:15:07,769 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| 2 .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-15 15:15:07,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| 2 .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-15 15:15:08,253 INFO L353 Elim1Store]: treesize reduction 132, result has 22.8 percent of original size [2022-03-15 15:15:08,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 108 [2022-03-15 15:15:08,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-03-15 15:15:08,268 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 15:15:08,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 191 [2022-03-15 15:15:08,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-03-15 15:15:08,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2022-03-15 15:15:08,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-03-15 15:15:13,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:13,312 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 15:15:13,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2022-03-15 15:15:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-03-15 15:15:13,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681859681] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:15:13,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:15:13,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 37 [2022-03-15 15:15:13,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385736073] [2022-03-15 15:15:13,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:15:13,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 15:15:13,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 15:15:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1068, Unknown=10, NotChecked=138, Total=1406 [2022-03-15 15:15:13,366 INFO L87 Difference]: Start difference. First operand 15413 states and 30163 transitions. Second operand has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:14,900 INFO L93 Difference]: Finished difference Result 17784 states and 34899 transitions. [2022-03-15 15:15:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 15:15:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-15 15:15:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:14,923 INFO L225 Difference]: With dead ends: 17784 [2022-03-15 15:15:14,924 INFO L226 Difference]: Without dead ends: 17784 [2022-03-15 15:15:14,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1139 SyntacticMatches, 33 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=593, Invalid=3308, Unknown=13, NotChecked=246, Total=4160 [2022-03-15 15:15:14,925 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 2234 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3670 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:14,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2234 Valid, 7127 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1313 Invalid, 0 Unknown, 3670 Unchecked, 0.7s Time] [2022-03-15 15:15:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17784 states. [2022-03-15 15:15:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17784 to 17146. [2022-03-15 15:15:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17146 states, 17091 states have (on average 1.9676437891287812) internal successors, (33629), 17145 states have internal predecessors, (33629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 33629 transitions. [2022-03-15 15:15:15,127 INFO L78 Accepts]: Start accepts. Automaton has 17146 states and 33629 transitions. Word has length 589 [2022-03-15 15:15:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:15,127 INFO L470 AbstractCegarLoop]: Abstraction has 17146 states and 33629 transitions. [2022-03-15 15:15:15,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17146 states and 33629 transitions. [2022-03-15 15:15:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-15 15:15:15,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:15,132 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:15,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 15:15:15,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 15:15:15,333 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:15:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -208808955, now seen corresponding path program 2 times [2022-03-15 15:15:15,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:15,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034785847] [2022-03-15 15:15:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:15:16,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:16,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034785847] [2022-03-15 15:15:16,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034785847] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:15:16,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430484524] [2022-03-15 15:15:16,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:15:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:15:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:15:16,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:15:16,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 15:15:18,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:15:18,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:15:18,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 15:15:18,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:15:19,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:19,568 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-15 15:15:19,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-03-15 15:15:19,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 15:15:19,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:19,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 15:15:19,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,927 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:19,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 15:15:19,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:19,979 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:19,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 15:15:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-15 15:15:20,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:15:20,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430484524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:20,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:15:20,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2022-03-15 15:15:20,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686294066] [2022-03-15 15:15:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:20,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 15:15:20,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 15:15:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-15 15:15:20,021 INFO L87 Difference]: Start difference. First operand 17146 states and 33629 transitions. Second operand has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:21,724 INFO L93 Difference]: Finished difference Result 46055 states and 91420 transitions. [2022-03-15 15:15:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:15:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-15 15:15:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:21,799 INFO L225 Difference]: With dead ends: 46055 [2022-03-15 15:15:21,799 INFO L226 Difference]: Without dead ends: 46055 [2022-03-15 15:15:21,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:15:21,800 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1128 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:21,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 2489 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:15:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2022-03-15 15:15:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 26239. [2022-03-15 15:15:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26239 states, 26184 states have (on average 2.0164604338527345) internal successors, (52799), 26238 states have internal predecessors, (52799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26239 states to 26239 states and 52799 transitions. [2022-03-15 15:15:22,295 INFO L78 Accepts]: Start accepts. Automaton has 26239 states and 52799 transitions. Word has length 589 [2022-03-15 15:15:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:22,295 INFO L470 AbstractCegarLoop]: Abstraction has 26239 states and 52799 transitions. [2022-03-15 15:15:22,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 26239 states and 52799 transitions. [2022-03-15 15:15:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-15 15:15:22,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:22,301 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:22,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 15:15:22,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:15:22,502 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:15:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash -895811763, now seen corresponding path program 3 times [2022-03-15 15:15:22,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:22,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277344001] [2022-03-15 15:15:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:15:23,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:23,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277344001] [2022-03-15 15:15:23,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277344001] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:15:23,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746576968] [2022-03-15 15:15:23,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:15:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:15:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:15:23,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:15:23,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 15:15:25,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:15:25,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:15:25,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 15:15:25,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:15:26,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:26,402 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-15 15:15:26,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-03-15 15:15:26,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:26,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 15:15:26,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,737 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:26,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-03-15 15:15:26,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:26,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 15:15:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:26,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:26,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 15:15:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-15 15:15:26,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:15:26,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746576968] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:26,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:15:26,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:15:26,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732202113] [2022-03-15 15:15:26,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:26,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:15:26,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:26,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:15:26,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:15:26,823 INFO L87 Difference]: Start difference. First operand 26239 states and 52799 transitions. Second operand has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:28,135 INFO L93 Difference]: Finished difference Result 46138 states and 91586 transitions. [2022-03-15 15:15:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 15:15:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-15 15:15:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:28,205 INFO L225 Difference]: With dead ends: 46138 [2022-03-15 15:15:28,205 INFO L226 Difference]: Without dead ends: 46138 [2022-03-15 15:15:28,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 15:15:28,206 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 1094 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:28,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 1829 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:15:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46138 states. [2022-03-15 15:15:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46138 to 26263. [2022-03-15 15:15:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26263 states, 26208 states have (on average 2.0164453601953602) internal successors, (52847), 26262 states have internal predecessors, (52847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26263 states to 26263 states and 52847 transitions. [2022-03-15 15:15:28,675 INFO L78 Accepts]: Start accepts. Automaton has 26263 states and 52847 transitions. Word has length 589 [2022-03-15 15:15:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:28,676 INFO L470 AbstractCegarLoop]: Abstraction has 26263 states and 52847 transitions. [2022-03-15 15:15:28,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26263 states and 52847 transitions. [2022-03-15 15:15:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-15 15:15:28,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:28,682 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:28,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 15:15:28,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-03-15 15:15:28,882 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:15:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash -361079955, now seen corresponding path program 4 times [2022-03-15 15:15:28,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:28,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283166192] [2022-03-15 15:15:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:15:29,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:29,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283166192] [2022-03-15 15:15:29,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283166192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:15:29,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392146769] [2022-03-15 15:15:29,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:15:29,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:15:29,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:15:29,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:15:29,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 15:15:32,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:15:32,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:15:32,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:15:32,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:15:33,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 15:15:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:33,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 15:15:34,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,005 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:34,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-03-15 15:15:34,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:34,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 15:15:34,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:15:34,085 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:15:34,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 15:15:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2022-03-15 15:15:34,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:15:35,797 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0))) is different from false [2022-03-15 15:15:37,471 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1 1))) 0))) is different from false [2022-03-15 15:15:38,487 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0))) is different from false [2022-03-15 15:15:39,433 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3)))))) is different from false [2022-03-15 15:15:39,484 INFO L353 Elim1Store]: treesize reduction 124, result has 23.5 percent of original size [2022-03-15 15:15:39,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-03-15 15:15:39,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 15:15:39,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2022-03-15 15:15:39,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,510 INFO L353 Elim1Store]: treesize reduction 40, result has 45.9 percent of original size [2022-03-15 15:15:39,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 62 [2022-03-15 15:15:39,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-03-15 15:15:39,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:15:39,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2022-03-15 15:15:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1855 trivial. 1 not checked. [2022-03-15 15:15:41,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392146769] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:15:41,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:15:41,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 32 [2022-03-15 15:15:41,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411164179] [2022-03-15 15:15:41,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:15:41,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 15:15:41,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 15:15:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=620, Unknown=4, NotChecked=228, Total=1056 [2022-03-15 15:15:41,525 INFO L87 Difference]: Start difference. First operand 26263 states and 52847 transitions. Second operand has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:43,022 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))))) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-15 15:15:43,785 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0)) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-15 15:15:44,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3 1))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-15 15:15:45,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-15 15:15:48,254 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)))) is different from false [2022-03-15 15:15:49,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-15 15:15:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:49,711 INFO L93 Difference]: Finished difference Result 136660 states and 278972 transitions. [2022-03-15 15:15:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 15:15:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 589 [2022-03-15 15:15:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:50,187 INFO L225 Difference]: With dead ends: 136660 [2022-03-15 15:15:50,187 INFO L226 Difference]: Without dead ends: 136660 [2022-03-15 15:15:50,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=709, Invalid=2401, Unknown=10, NotChecked=1170, Total=4290 [2022-03-15 15:15:50,188 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 4008 mSDsluCounter, 6661 mSDsCounter, 0 mSdLazyCounter, 4649 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 7365 SdHoareTripleChecker+Invalid, 13837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 4649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8559 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:50,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 7365 Invalid, 13837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 4649 Invalid, 0 Unknown, 8559 Unchecked, 2.6s Time] [2022-03-15 15:15:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136660 states. [2022-03-15 15:15:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136660 to 64021. [2022-03-15 15:15:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64021 states, 63966 states have (on average 2.0758371634931057) internal successors, (132783), 64020 states have internal predecessors, (132783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64021 states to 64021 states and 132783 transitions. [2022-03-15 15:15:51,736 INFO L78 Accepts]: Start accepts. Automaton has 64021 states and 132783 transitions. Word has length 589 [2022-03-15 15:15:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:51,736 INFO L470 AbstractCegarLoop]: Abstraction has 64021 states and 132783 transitions. [2022-03-15 15:15:51,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64021 states and 132783 transitions. [2022-03-15 15:15:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-15 15:15:51,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:51,744 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:51,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 15:15:51,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-15 15:15:51,947 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 15:15:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash -364683705, now seen corresponding path program 5 times [2022-03-15 15:15:51,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:51,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239859997] [2022-03-15 15:15:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-15 15:15:52,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:52,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239859997] [2022-03-15 15:15:52,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239859997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:15:52,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659011299] [2022-03-15 15:15:52,958 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:15:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:15:52,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:15:52,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:15:52,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-03-15 15:25:25,679 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 15:25:25,680 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 15:25:26,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-03-15 15:25:26,880 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-15 15:25:26,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-03-15 15:25:26,925 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 15:25:26,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:25:26,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-03-15 15:25:26,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690267523] [2022-03-15 15:25:26,926 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-15 15:25:26,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 15:25:26,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:25:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 15:25:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:25:26,927 INFO L87 Difference]: Start difference. First operand 64021 states and 132783 transitions. Second operand has 13 states, 12 states have (on average 18.333333333333332) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:25:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 15:25:26,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:25:26,928 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:25:26,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:25:26,929 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-15 15:25:26,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-03-15 15:25:26,930 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2022-03-15 15:25:26,931 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-15 15:25:26,931 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-15 15:25:26,931 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-15 15:25:26,932 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-15 15:25:26,933 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-15 15:25:26,935 INFO L732 BasicCegarLoop]: Path program histogram: [28, 21, 15, 12, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:25:26,938 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 15:25:26,938 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 15:25:26,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:25:26 BasicIcfg [2022-03-15 15:25:26,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 15:25:26,940 INFO L158 Benchmark]: Toolchain (without parser) took 805433.52ms. Allocated memory was 195.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 139.4MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 711.0MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 195.0MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.20ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 139.2MB in the beginning and 183.4MB in the end (delta: -44.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.89ms. Allocated memory is still 234.9MB. Free memory was 183.4MB in the beginning and 179.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 234.9MB. Free memory was 179.2MB in the beginning and 176.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: RCFGBuilder took 635.87ms. Allocated memory is still 234.9MB. Free memory was 175.6MB in the beginning and 148.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 INFO L158 Benchmark]: TraceAbstraction took 803980.30ms. Allocated memory was 234.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 147.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 680.1MB. Max. memory is 8.0GB. [2022-03-15 15:25:26,940 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.39ms. Allocated memory is still 195.0MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 695.20ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 139.2MB in the beginning and 183.4MB in the end (delta: -44.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.89ms. Allocated memory is still 234.9MB. Free memory was 183.4MB in the beginning and 179.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 234.9MB. Free memory was 179.2MB in the beginning and 176.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.87ms. Allocated memory is still 234.9MB. Free memory was 175.6MB in the beginning and 148.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 803980.30ms. Allocated memory was 234.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 147.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 680.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 354 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 803.8s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.4s, AutomataDifference: 118.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71725 SdHoareTripleChecker+Valid, 91.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71725 mSDsluCounter, 314842 SdHoareTripleChecker+Invalid, 75.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12229 IncrementalHoareTripleChecker+Unchecked, 252999 mSDsCounter, 6015 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189617 IncrementalHoareTripleChecker+Invalid, 207861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6015 mSolverCounterUnsat, 62005 mSDtfsCounter, 189617 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8721 GetRequests, 6638 SyntacticMatches, 35 SemanticMatches, 2048 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12315 ImplicationChecksByTransitivity, 28.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64021occurred in iteration=100, InterpolantAutomatonStates: 1793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.7s AutomataMinimizationTime, 100 MinimizatonAttempts, 488637 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 50757 NumberOfCodeBlocks, 48910 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 52441 ConstructedInterpolants, 844 QuantifiedInterpolants, 149015 SizeOfPredicates, 82 NumberOfNonLiveVariables, 9835 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 183612/190869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown