/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.abstract-por-f0ea240
[2022-02-10 23:47:03,328 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-02-10 23:47:03,329 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-10 23:47:03,386 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-10 23:47:03,388 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-10 23:47:03,391 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-10 23:47:03,393 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-10 23:47:03,395 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-10 23:47:03,396 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-10 23:47:03,399 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-10 23:47:03,400 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-02-10 23:47:03,401 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-10 23:47:03,401 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-10 23:47:03,403 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-10 23:47:03,404 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-10 23:47:03,406 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-10 23:47:03,406 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-10 23:47:03,407 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-10 23:47:03,408 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-10 23:47:03,413 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-10 23:47:03,414 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-10 23:47:03,415 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-10 23:47:03,416 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-02-10 23:47:03,416 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-10 23:47:03,421 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-10 23:47:03,422 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-10 23:47:03,422 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-10 23:47:03,423 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-10 23:47:03,423 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-10 23:47:03,424 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-10 23:47:03,424 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-10 23:47:03,424 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-10 23:47:03,425 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-10 23:47:03,426 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-10 23:47:03,427 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-10 23:47:03,427 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-10 23:47:03,427 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-10 23:47:03,427 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-10 23:47:03,427 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-10 23:47:03,428 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-10 23:47:03,428 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-02-10 23:47:03,429 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-02-10 23:47:03,452 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-02-10 23:47:03,452 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-10 23:47:03,452 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-10 23:47:03,452 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-10 23:47:03,453 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-10 23:47:03,453 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-10 23:47:03,453 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-10 23:47:03,454 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-02-10 23:47:03,454 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-02-10 23:47:03,454 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-10 23:47:03,454 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-02-10 23:47:03,454 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-02-10 23:47:03,455 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-02-10 23:47:03,455 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-10 23:47:03,456 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-02-10 23:47:03,456 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-10 23:47:03,456 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-02-10 23:47:03,622 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-10 23:47:03,636 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-10 23:47:03,637 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-10 23:47:03,638 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-02-10 23:47:03,639 INFO  L275        PluginConnector]: CDTParser initialized
[2022-02-10 23:47:03,639 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-02-10 23:47:03,728 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe477f8b8/30a0b9a970d844759a32a825abfef5a0/FLAGf420850b3
[2022-02-10 23:47:04,080 INFO  L306              CDTParser]: Found 1 translation units.
[2022-02-10 23:47:04,080 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i
[2022-02-10 23:47:04,089 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe477f8b8/30a0b9a970d844759a32a825abfef5a0/FLAGf420850b3
[2022-02-10 23:47:04,096 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe477f8b8/30a0b9a970d844759a32a825abfef5a0
[2022-02-10 23:47:04,098 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-10 23:47:04,099 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-10 23:47:04,100 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-10 23:47:04,100 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-10 23:47:04,102 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-10 23:47:04,102 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,103 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3181cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04, skipping insertion in model container
[2022-02-10 23:47:04,103 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,107 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-02-10 23:47:04,133 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-10 23:47:04,537 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-10 23:47:04,545 INFO  L203         MainTranslator]: Completed pre-run
[2022-02-10 23:47:04,580 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-10 23:47:04,640 INFO  L208         MainTranslator]: Completed translation
[2022-02-10 23:47:04,640 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04 WrapperNode
[2022-02-10 23:47:04,640 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-10 23:47:04,641 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-10 23:47:04,641 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-10 23:47:04,642 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-10 23:47:04,647 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,672 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,702 INFO  L137                Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237
[2022-02-10 23:47:04,702 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-10 23:47:04,703 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-10 23:47:04,703 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-10 23:47:04,703 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-02-10 23:47:04,711 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,711 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,715 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,716 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,729 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,731 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,733 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,736 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-10 23:47:04,736 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-10 23:47:04,736 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-02-10 23:47:04,737 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-02-10 23:47:04,737 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (1/1) ...
[2022-02-10 23:47:04,752 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-10 23:47:04,761 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:04,782 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-02-10 23:47:04,786 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-02-10 23:47:04,818 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-10 23:47:04,818 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-02-10 23:47:04,818 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure t_fun
[2022-02-10 23:47:04,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure t_fun
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-10 23:47:04,819 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-10 23:47:04,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-10 23:47:04,820 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-10 23:47:04,954 INFO  L234             CfgBuilder]: Building ICFG
[2022-02-10 23:47:04,955 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-10 23:47:05,266 INFO  L275             CfgBuilder]: Performing block encoding
[2022-02-10 23:47:05,275 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-10 23:47:05,275 INFO  L299             CfgBuilder]: Removed 3 assume(true) statements.
[2022-02-10 23:47:05,276 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:47:05 BoogieIcfgContainer
[2022-02-10 23:47:05,276 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-10 23:47:05,278 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-10 23:47:05,278 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-02-10 23:47:05,280 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-02-10 23:47:05,280 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:47:04" (1/3) ...
[2022-02-10 23:47:05,281 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d4c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:47:05, skipping insertion in model container
[2022-02-10 23:47:05,281 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:47:04" (2/3) ...
[2022-02-10 23:47:05,281 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d4c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:47:05, skipping insertion in model container
[2022-02-10 23:47:05,281 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:47:05" (3/3) ...
[2022-02-10 23:47:05,282 INFO  L112   eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i
[2022-02-10 23:47:05,285 WARN  L154   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-10 23:47:05,285 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-10 23:47:05,285 INFO  L168   ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations.
[2022-02-10 23:47:05,285 INFO  L538   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-10 23:47:05,316 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,317 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,318 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,319 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,320 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,321 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,322 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,323 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,324 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,324 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,324 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,325 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,326 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,327 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,327 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,327 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,328 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,329 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,329 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,330 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,333 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,333 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,334 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,335 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,336 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,337 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,338 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,339 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,340 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,340 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,340 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,341 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,342 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,347 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,348 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,348 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,348 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,348 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,349 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,350 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,350 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,350 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,351 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,352 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,353 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,353 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,355 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,355 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,355 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,356 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,356 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,356 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,356 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,356 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,357 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,358 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,359 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,360 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,361 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,362 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,363 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,364 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,365 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,366 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,367 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,368 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,369 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,370 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,371 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,372 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,376 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,377 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,378 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,379 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,379 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,379 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,379 WARN  L322   ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-10 23:47:05,381 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-10 23:47:05,409 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-10 23:47:05,413 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, 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
[2022-02-10 23:47:05,413 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 25 error locations.
[2022-02-10 23:47:05,426 INFO  L111   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow
[2022-02-10 23:47:05,638 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-02-10 23:47:05,654 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-02-10 23:47:05,665 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-02-10 23:47:05,665 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:05,666 INFO  L515         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-02-10 23:47:05,666 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-02-10 23:47:05,673 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:05,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times
[2022-02-10 23:47:05,681 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:05,682 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792790072]
[2022-02-10 23:47:05,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:05,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:05,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:05,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:05,998 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:05,998 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792790072]
[2022-02-10 23:47:05,999 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792790072] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:05,999 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:05,999 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:47:06,000 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571980926]
[2022-02-10 23:47:06,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:06,004 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:47:06,005 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:06,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:47:06,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:47:06,053 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-02-10 23:47:06,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:06,634 INFO  L93              Difference]: Finished difference Result 10027 states and 19985 transitions.
[2022-02-10 23:47:06,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:47:06,636 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-02-10 23:47:06,637 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:06,677 INFO  L225             Difference]: With dead ends: 10027
[2022-02-10 23:47:06,677 INFO  L226             Difference]: Without dead ends: 10027
[2022-02-10 23:47:06,678 INFO  L933         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-02-10 23:47:06,680 INFO  L934         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-02-10 23:47:06,680 INFO  L935         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-02-10 23:47:06,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10027 states.
[2022-02-10 23:47:06,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946.
[2022-02-10 23:47:06,968 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-02-10 23:47:06,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions.
[2022-02-10 23:47:06,994 INFO  L78                 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40
[2022-02-10 23:47:06,994 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:06,994 INFO  L470      AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions.
[2022-02-10 23:47:06,994 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-02-10 23:47:06,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions.
[2022-02-10 23:47:06,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2022-02-10 23:47:06,997 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:06,997 INFO  L515         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-02-10 23:47:06,997 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-10 23:47:06,997 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-02-10 23:47:06,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:06,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times
[2022-02-10 23:47:06,998 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:06,998 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622599280]
[2022-02-10 23:47:06,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:06,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:07,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:07,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:07,086 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:07,086 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622599280]
[2022-02-10 23:47:07,086 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622599280] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:07,086 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:07,086 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:47:07,086 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508966673]
[2022-02-10 23:47:07,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:07,087 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:47:07,087 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:07,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:47:07,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:47:07,088 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-02-10 23:47:07,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:07,562 INFO  L93              Difference]: Finished difference Result 10347 states and 20626 transitions.
[2022-02-10 23:47:07,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:47:07,563 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-02-10 23:47:07,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:07,608 INFO  L225             Difference]: With dead ends: 10347
[2022-02-10 23:47:07,609 INFO  L226             Difference]: Without dead ends: 10347
[2022-02-10 23:47:07,609 INFO  L933         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-02-10 23:47:07,611 INFO  L934         BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:07,611 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 937 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-02-10 23:47:07,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10347 states.
[2022-02-10 23:47:07,793 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266.
[2022-02-10 23:47:07,804 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-02-10 23:47:07,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions.
[2022-02-10 23:47:07,829 INFO  L78                 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48
[2022-02-10 23:47:07,829 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:07,830 INFO  L470      AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions.
[2022-02-10 23:47:07,830 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-02-10 23:47:07,830 INFO  L276                IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions.
[2022-02-10 23:47:07,833 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2022-02-10 23:47:07,833 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:07,834 INFO  L515         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-02-10 23:47:07,834 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-10 23:47:07,834 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-02-10 23:47:07,834 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:07,835 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times
[2022-02-10 23:47:07,835 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:07,837 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522294428]
[2022-02-10 23:47:07,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:07,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:07,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:07,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:07,904 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:07,904 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522294428]
[2022-02-10 23:47:07,904 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522294428] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:07,904 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:07,905 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-10 23:47:07,905 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055376010]
[2022-02-10 23:47:07,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:07,905 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-10 23:47:07,905 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:07,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-10 23:47:07,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-10 23:47:07,906 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-02-10 23:47:08,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:08,031 INFO  L93              Difference]: Finished difference Result 19601 states and 39093 transitions.
[2022-02-10 23:47:08,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-02-10 23:47:08,031 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-02-10 23:47:08,031 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:08,070 INFO  L225             Difference]: With dead ends: 19601
[2022-02-10 23:47:08,070 INFO  L226             Difference]: Without dead ends: 19601
[2022-02-10 23:47:08,071 INFO  L933         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-02-10 23:47:08,071 INFO  L934         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.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:08,072 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 550 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-10 23:47:08,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19601 states.
[2022-02-10 23:47:08,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348.
[2022-02-10 23:47:08,328 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-02-10 23:47:08,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions.
[2022-02-10 23:47:08,403 INFO  L78                 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49
[2022-02-10 23:47:08,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:08,403 INFO  L470      AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions.
[2022-02-10 23:47:08,403 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-02-10 23:47:08,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions.
[2022-02-10 23:47:08,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2022-02-10 23:47:08,404 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:08,404 INFO  L515         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-02-10 23:47:08,404 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-10 23:47:08,404 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-02-10 23:47:08,404 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:08,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times
[2022-02-10 23:47:08,404 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:08,405 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976659684]
[2022-02-10 23:47:08,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:08,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:08,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:08,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:08,517 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:08,517 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976659684]
[2022-02-10 23:47:08,517 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976659684] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:08,517 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:08,517 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:47:08,518 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629162279]
[2022-02-10 23:47:08,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:08,518 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:47:08,518 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:08,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:47:08,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:47:08,518 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-02-10 23:47:08,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:08,656 INFO  L93              Difference]: Finished difference Result 10347 states and 20627 transitions.
[2022-02-10 23:47:08,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:47:08,656 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-02-10 23:47:08,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:08,674 INFO  L225             Difference]: With dead ends: 10347
[2022-02-10 23:47:08,675 INFO  L226             Difference]: Without dead ends: 10347
[2022-02-10 23:47:08,677 INFO  L933         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-02-10 23:47:08,681 INFO  L934         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-02-10 23:47:08,682 INFO  L935         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-02-10 23:47:08,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10347 states.
[2022-02-10 23:47:08,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347.
[2022-02-10 23:47:08,860 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-02-10 23:47:08,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions.
[2022-02-10 23:47:08,876 INFO  L78                 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59
[2022-02-10 23:47:08,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:08,877 INFO  L470      AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions.
[2022-02-10 23:47:08,877 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-02-10 23:47:08,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions.
[2022-02-10 23:47:08,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2022-02-10 23:47:08,878 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:08,879 INFO  L515         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-02-10 23:47:08,879 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-10 23:47:08,879 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-02-10 23:47:08,880 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:08,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times
[2022-02-10 23:47:08,880 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:08,880 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404172699]
[2022-02-10 23:47:08,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:08,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:08,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:09,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:09,002 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:09,002 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404172699]
[2022-02-10 23:47:09,002 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404172699] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:47:09,002 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923670558]
[2022-02-10 23:47:09,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:09,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:47:09,002 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:09,005 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-02-10 23:47:09,007 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-02-10 23:47:09,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:09,120 INFO  L263         TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-10 23:47:09,125 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:47:09,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:09,343 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-10 23:47:09,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:09,482 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923670558] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-10 23:47:09,482 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-10 23:47:09,482 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2022-02-10 23:47:09,482 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020937099]
[2022-02-10 23:47:09,482 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-10 23:47:09,483 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-10 23:47:09,483 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:09,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-10 23:47:09,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2022-02-10 23:47:09,484 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-02-10 23:47:09,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:09,646 INFO  L93              Difference]: Finished difference Result 19642 states and 39134 transitions.
[2022-02-10 23:47:09,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-10 23:47:09,647 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-02-10 23:47:09,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:09,753 INFO  L225             Difference]: With dead ends: 19642
[2022-02-10 23:47:09,753 INFO  L226             Difference]: Without dead ends: 19642
[2022-02-10 23:47:09,754 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182
[2022-02-10 23:47:09,754 INFO  L934         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-02-10 23:47:09,754 INFO  L935         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-02-10 23:47:09,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19642 states.
[2022-02-10 23:47:09,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429.
[2022-02-10 23:47:09,945 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-02-10 23:47:09,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions.
[2022-02-10 23:47:09,964 INFO  L78                 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90
[2022-02-10 23:47:09,964 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:09,964 INFO  L470      AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions.
[2022-02-10 23:47:09,964 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-02-10 23:47:09,965 INFO  L276                IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions.
[2022-02-10 23:47:09,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2022-02-10 23:47:09,966 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:09,966 INFO  L515         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-02-10 23:47:09,996 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-02-10 23:47:10,183 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-02-10 23:47:10,183 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-02-10 23:47:10,184 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:10,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times
[2022-02-10 23:47:10,184 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:10,184 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654454952]
[2022-02-10 23:47:10,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:10,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:10,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:10,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:10,364 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:10,364 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654454952]
[2022-02-10 23:47:10,364 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654454952] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:47:10,364 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644653039]
[2022-02-10 23:47:10,364 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-10 23:47:10,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:47:10,365 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:10,370 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-02-10 23:47:10,371 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-02-10 23:47:10,490 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-02-10 23:47:10,490 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:47:10,491 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-02-10 23:47:10,507 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:47:10,870 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-02-10 23:47:10,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,889 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-02-10 23:47:10,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,914 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,916 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:47:10,916 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-02-10 23:47:10,944 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,945 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,946 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,946 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,947 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,947 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:47:10,949 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:47:10,949 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-02-10 23:47:10,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2022-02-10 23:47:10,969 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:47:10,969 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644653039] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:10,969 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:47:10,969 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15
[2022-02-10 23:47:10,970 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18716734]
[2022-02-10 23:47:10,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:10,970 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-10 23:47:10,970 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:10,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-10 23:47:10,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2022-02-10 23:47:10,970 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-02-10 23:47:11,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:11,650 INFO  L93              Difference]: Finished difference Result 12090 states and 24032 transitions.
[2022-02-10 23:47:11,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-10 23:47:11,651 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-02-10 23:47:11,651 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:11,671 INFO  L225             Difference]: With dead ends: 12090
[2022-02-10 23:47:11,671 INFO  L226             Difference]: Without dead ends: 12090
[2022-02-10 23:47:11,671 INFO  L933         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-02-10 23:47:11,672 INFO  L934         BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:11,672 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2448 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-02-10 23:47:11,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12090 states.
[2022-02-10 23:47:11,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867.
[2022-02-10 23:47:11,873 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-02-10 23:47:11,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions.
[2022-02-10 23:47:11,889 INFO  L78                 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172
[2022-02-10 23:47:11,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:11,889 INFO  L470      AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions.
[2022-02-10 23:47:11,889 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-02-10 23:47:11,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions.
[2022-02-10 23:47:11,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2022-02-10 23:47:11,891 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:11,891 INFO  L515         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-02-10 23:47:11,907 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-02-10 23:47:12,107 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-02-10 23:47:12,107 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-02-10 23:47:12,108 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:12,108 INFO  L85        PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times
[2022-02-10 23:47:12,108 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:12,108 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285746013]
[2022-02-10 23:47:12,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:12,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:12,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:12,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:12,248 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:12,248 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285746013]
[2022-02-10 23:47:12,248 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285746013] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:47:12,248 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517651195]
[2022-02-10 23:47:12,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:12,248 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:47:12,248 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:12,249 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-02-10 23:47:12,250 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-02-10 23:47:12,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:12,425 INFO  L263         TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-02-10 23:47:12,430 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:47:12,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:12,677 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-10 23:47:12,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:12,954 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517651195] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-10 23:47:12,954 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-10 23:47:12,954 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18
[2022-02-10 23:47:12,954 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163409828]
[2022-02-10 23:47:12,954 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-10 23:47:12,955 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2022-02-10 23:47:12,955 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:12,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2022-02-10 23:47:12,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2022-02-10 23:47:12,955 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-02-10 23:47:13,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:13,249 INFO  L93              Difference]: Finished difference Result 20585 states and 40856 transitions.
[2022-02-10 23:47:13,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2022-02-10 23:47:13,249 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-02-10 23:47:13,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:13,367 INFO  L225             Difference]: With dead ends: 20585
[2022-02-10 23:47:13,367 INFO  L226             Difference]: Without dead ends: 20585
[2022-02-10 23:47:13,367 INFO  L933         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-02-10 23:47:13,368 INFO  L934         BasicCegarLoop]: 319 mSDtfsCounter, 805 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:13,368 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2497 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-10 23:47:13,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20585 states.
[2022-02-10 23:47:13,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031.
[2022-02-10 23:47:13,531 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-02-10 23:47:13,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions.
[2022-02-10 23:47:13,550 INFO  L78                 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180
[2022-02-10 23:47:13,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:13,551 INFO  L470      AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions.
[2022-02-10 23:47:13,551 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-02-10 23:47:13,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions.
[2022-02-10 23:47:13,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2022-02-10 23:47:13,554 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:13,554 INFO  L515         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-02-10 23:47:13,574 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-02-10 23:47:13,767 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-02-10 23:47:13,768 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-02-10 23:47:13,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:13,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times
[2022-02-10 23:47:13,769 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:13,769 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364244213]
[2022-02-10 23:47:13,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:13,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:13,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:14,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-02-10 23:47:14,004 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:14,004 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364244213]
[2022-02-10 23:47:14,004 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364244213] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:47:14,004 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620554723]
[2022-02-10 23:47:14,004 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-10 23:47:14,004 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:47:14,004 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:14,005 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-02-10 23:47:14,041 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-02-10 23:47:14,189 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-02-10 23:47:14,189 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:47:14,190 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-02-10 23:47:14,193 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:47:14,599 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-02-10 23:47:14,620 INFO  L353             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2022-02-10 23:47:14,620 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-02-10 23:47:14,652 INFO  L353             Elim1Store]: treesize reduction 64, result has 22.9 percent of original size
[2022-02-10 23:47:14,652 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-02-10 23:47:14,697 INFO  L353             Elim1Store]: treesize reduction 114, result has 19.7 percent of original size
[2022-02-10 23:47:14,697 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-02-10 23:47:14,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked.
[2022-02-10 23:47:14,721 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:47:14,722 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [620554723] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:14,722 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:47:14,722 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21
[2022-02-10 23:47:14,722 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646196492]
[2022-02-10 23:47:14,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:14,722 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:47:14,722 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:14,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:47:14,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420
[2022-02-10 23:47:14,723 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-02-10 23:47:15,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:15,239 INFO  L93              Difference]: Finished difference Result 11586 states and 22859 transitions.
[2022-02-10 23:47:15,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:47:15,240 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-02-10 23:47:15,240 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:15,257 INFO  L225             Difference]: With dead ends: 11586
[2022-02-10 23:47:15,257 INFO  L226             Difference]: Without dead ends: 11586
[2022-02-10 23:47:15,258 INFO  L933         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-02-10 23:47:15,258 INFO  L934         BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:15,258 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1050 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:47:15,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11586 states.
[2022-02-10 23:47:15,466 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469.
[2022-02-10 23:47:15,477 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-02-10 23:47:15,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions.
[2022-02-10 23:47:15,497 INFO  L78                 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344
[2022-02-10 23:47:15,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:15,498 INFO  L470      AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions.
[2022-02-10 23:47:15,498 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-02-10 23:47:15,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions.
[2022-02-10 23:47:15,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2022-02-10 23:47:15,502 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:15,502 INFO  L515         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-02-10 23:47:15,533 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-02-10 23:47:15,718 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-02-10 23:47:15,719 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-02-10 23:47:15,719 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:15,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times
[2022-02-10 23:47:15,719 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:15,719 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158796291]
[2022-02-10 23:47:15,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:15,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:15,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:15,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:15,965 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:15,966 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158796291]
[2022-02-10 23:47:15,966 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158796291] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:47:15,966 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709919948]
[2022-02-10 23:47:15,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:15,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:47:15,966 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:47:15,967 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-02-10 23:47:15,969 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-02-10 23:47:16,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:16,286 INFO  L263         TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core
[2022-02-10 23:47:16,291 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:47:16,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:16,836 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-10 23:47:17,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-10 23:47:17,442 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [709919948] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-10 23:47:17,442 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-10 23:47:17,442 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23
[2022-02-10 23:47:17,442 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585184536]
[2022-02-10 23:47:17,442 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-10 23:47:17,443 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-02-10 23:47:17,443 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:17,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-02-10 23:47:17,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506
[2022-02-10 23:47:17,444 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-02-10 23:47:17,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:17,855 INFO  L93              Difference]: Finished difference Result 21487 states and 42537 transitions.
[2022-02-10 23:47:17,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2022-02-10 23:47:17,856 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-02-10 23:47:17,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:17,891 INFO  L225             Difference]: With dead ends: 21487
[2022-02-10 23:47:17,891 INFO  L226             Difference]: Without dead ends: 21487
[2022-02-10 23:47:17,892 INFO  L933         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-02-10 23:47:17,892 INFO  L934         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-02-10 23:47:17,892 INFO  L935         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-02-10 23:47:17,924 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21487 states.
[2022-02-10 23:47:18,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592.
[2022-02-10 23:47:18,108 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-02-10 23:47:18,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions.
[2022-02-10 23:47:18,128 INFO  L78                 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353
[2022-02-10 23:47:18,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:18,128 INFO  L470      AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions.
[2022-02-10 23:47:18,129 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-02-10 23:47:18,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions.
[2022-02-10 23:47:18,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:18,134 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:18,135 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:18,153 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-02-10 23:47:18,352 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-02-10 23:47:18,352 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-02-10 23:47:18,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:18,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times
[2022-02-10 23:47:18,353 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:18,353 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515615483]
[2022-02-10 23:47:18,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:18,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:18,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:18,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-02-10 23:47:18,790 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:18,790 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515615483]
[2022-02-10 23:47:18,790 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515615483] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:18,790 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:18,790 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:18,791 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656031923]
[2022-02-10 23:47:18,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:18,791 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:18,791 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:18,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:18,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:18,791 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-02-10 23:47:19,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:19,892 INFO  L93              Difference]: Finished difference Result 11725 states and 23014 transitions.
[2022-02-10 23:47:19,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2022-02-10 23:47:19,892 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-02-10 23:47:19,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:19,906 INFO  L225             Difference]: With dead ends: 11725
[2022-02-10 23:47:19,907 INFO  L226             Difference]: Without dead ends: 11725
[2022-02-10 23:47:19,907 INFO  L933         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-02-10 23:47:19,907 INFO  L934         BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:19,907 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-10 23:47:19,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11725 states.
[2022-02-10 23:47:20,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609.
[2022-02-10 23:47:20,039 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-02-10 23:47:20,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions.
[2022-02-10 23:47:20,059 INFO  L78                 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476
[2022-02-10 23:47:20,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:20,060 INFO  L470      AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions.
[2022-02-10 23:47:20,060 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-02-10 23:47:20,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions.
[2022-02-10 23:47:20,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:20,066 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:20,066 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:20,066 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-10 23:47:20,066 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-02-10 23:47:20,066 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:20,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times
[2022-02-10 23:47:20,067 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:20,067 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059762572]
[2022-02-10 23:47:20,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:20,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:20,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:20,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:20,403 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:20,403 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059762572]
[2022-02-10 23:47:20,403 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059762572] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:20,403 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:20,403 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:20,404 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144723689]
[2022-02-10 23:47:20,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:20,405 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:20,405 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:20,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:20,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:20,406 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-02-10 23:47:21,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:21,486 INFO  L93              Difference]: Finished difference Result 11752 states and 23068 transitions.
[2022-02-10 23:47:21,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-10 23:47:21,486 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-02-10 23:47:21,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:21,501 INFO  L225             Difference]: With dead ends: 11752
[2022-02-10 23:47:21,501 INFO  L226             Difference]: Without dead ends: 11752
[2022-02-10 23:47:21,501 INFO  L933         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-02-10 23:47:21,502 INFO  L934         BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:21,502 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 2927 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-10 23:47:21,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11752 states.
[2022-02-10 23:47:21,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610.
[2022-02-10 23:47:21,618 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-02-10 23:47:21,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions.
[2022-02-10 23:47:21,636 INFO  L78                 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476
[2022-02-10 23:47:21,637 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:21,637 INFO  L470      AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions.
[2022-02-10 23:47:21,637 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-02-10 23:47:21,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions.
[2022-02-10 23:47:21,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:21,640 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:21,640 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:21,640 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-10 23:47:21,640 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-02-10 23:47:21,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:21,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times
[2022-02-10 23:47:21,641 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:21,641 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630493158]
[2022-02-10 23:47:21,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:21,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:21,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:22,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:22,032 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:22,032 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630493158]
[2022-02-10 23:47:22,032 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630493158] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:22,032 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:22,032 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:22,033 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670696857]
[2022-02-10 23:47:22,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:22,034 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:22,034 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:22,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:22,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:22,034 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-02-10 23:47:23,497 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:23,497 INFO  L93              Difference]: Finished difference Result 11790 states and 23144 transitions.
[2022-02-10 23:47:23,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:47:23,498 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-02-10 23:47:23,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:23,514 INFO  L225             Difference]: With dead ends: 11790
[2022-02-10 23:47:23,514 INFO  L226             Difference]: Without dead ends: 11790
[2022-02-10 23:47:23,515 INFO  L933         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-02-10 23:47:23,515 INFO  L934         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-02-10 23:47:23,516 INFO  L935         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-02-10 23:47:23,531 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11790 states.
[2022-02-10 23:47:23,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633.
[2022-02-10 23:47:23,663 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-02-10 23:47:23,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions.
[2022-02-10 23:47:23,684 INFO  L78                 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476
[2022-02-10 23:47:23,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:23,685 INFO  L470      AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions.
[2022-02-10 23:47:23,685 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-02-10 23:47:23,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions.
[2022-02-10 23:47:23,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:23,689 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:23,689 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:23,689 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-10 23:47:23,690 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-02-10 23:47:23,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:23,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times
[2022-02-10 23:47:23,690 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:23,690 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130988031]
[2022-02-10 23:47:23,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:23,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:23,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:24,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-02-10 23:47:24,070 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:24,070 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130988031]
[2022-02-10 23:47:24,071 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130988031] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:24,071 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:24,071 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:24,071 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435380582]
[2022-02-10 23:47:24,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:24,071 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:24,071 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:24,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:24,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:24,072 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-02-10 23:47:25,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:25,325 INFO  L93              Difference]: Finished difference Result 11790 states and 23144 transitions.
[2022-02-10 23:47:25,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-10 23:47:25,326 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-02-10 23:47:25,326 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:25,343 INFO  L225             Difference]: With dead ends: 11790
[2022-02-10 23:47:25,343 INFO  L226             Difference]: Without dead ends: 11790
[2022-02-10 23:47:25,344 INFO  L933         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-02-10 23:47:25,345 INFO  L934         BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:25,346 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2610 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:47:25,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11790 states.
[2022-02-10 23:47:25,551 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635.
[2022-02-10 23:47:25,561 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-02-10 23:47:25,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions.
[2022-02-10 23:47:25,579 INFO  L78                 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476
[2022-02-10 23:47:25,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:25,579 INFO  L470      AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions.
[2022-02-10 23:47:25,580 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-02-10 23:47:25,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions.
[2022-02-10 23:47:25,583 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:25,583 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:25,583 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:25,583 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-10 23:47:25,583 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-02-10 23:47:25,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:25,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times
[2022-02-10 23:47:25,584 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:25,584 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87500008]
[2022-02-10 23:47:25,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:25,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:25,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:25,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:25,861 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:25,861 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87500008]
[2022-02-10 23:47:25,861 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87500008] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:25,861 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:25,861 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:25,861 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372830936]
[2022-02-10 23:47:25,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:25,863 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:25,863 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:25,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:25,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:25,863 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-02-10 23:47:27,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:27,061 INFO  L93              Difference]: Finished difference Result 11854 states and 23272 transitions.
[2022-02-10 23:47:27,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:47:27,061 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-02-10 23:47:27,061 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:27,076 INFO  L225             Difference]: With dead ends: 11854
[2022-02-10 23:47:27,076 INFO  L226             Difference]: Without dead ends: 11854
[2022-02-10 23:47:27,077 INFO  L933         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-02-10 23:47:27,077 INFO  L934         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-02-10 23:47:27,078 INFO  L935         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-02-10 23:47:27,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11854 states.
[2022-02-10 23:47:27,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634.
[2022-02-10 23:47:27,195 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-02-10 23:47:27,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions.
[2022-02-10 23:47:27,213 INFO  L78                 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476
[2022-02-10 23:47:27,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:27,213 INFO  L470      AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions.
[2022-02-10 23:47:27,214 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-02-10 23:47:27,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions.
[2022-02-10 23:47:27,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:27,217 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:27,217 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:27,217 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-02-10 23:47:27,217 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-02-10 23:47:27,217 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:27,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times
[2022-02-10 23:47:27,217 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:27,217 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086208022]
[2022-02-10 23:47:27,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:27,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:27,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:27,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:27,484 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:27,484 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086208022]
[2022-02-10 23:47:27,484 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086208022] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:27,484 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:27,484 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:27,484 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942147434]
[2022-02-10 23:47:27,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:27,485 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:27,485 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:27,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:27,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:27,485 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-02-10 23:47:28,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:28,523 INFO  L93              Difference]: Finished difference Result 11855 states and 23274 transitions.
[2022-02-10 23:47:28,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:47:28,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-02-10 23:47:28,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:28,543 INFO  L225             Difference]: With dead ends: 11855
[2022-02-10 23:47:28,543 INFO  L226             Difference]: Without dead ends: 11855
[2022-02-10 23:47:28,543 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420
[2022-02-10 23:47:28,544 INFO  L934         BasicCegarLoop]: 549 mSDtfsCounter, 548 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:28,544 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2649 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-10 23:47:28,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11855 states.
[2022-02-10 23:47:28,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657.
[2022-02-10 23:47:28,662 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-02-10 23:47:28,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions.
[2022-02-10 23:47:28,679 INFO  L78                 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476
[2022-02-10 23:47:28,679 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:28,680 INFO  L470      AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions.
[2022-02-10 23:47:28,680 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-02-10 23:47:28,680 INFO  L276                IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions.
[2022-02-10 23:47:28,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:28,683 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:28,683 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:28,683 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-02-10 23:47:28,683 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-02-10 23:47:28,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:28,683 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times
[2022-02-10 23:47:28,684 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:28,684 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941500577]
[2022-02-10 23:47:28,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:28,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:28,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:28,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:28,956 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:28,956 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941500577]
[2022-02-10 23:47:28,957 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941500577] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:28,957 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:28,957 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:47:28,957 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287964764]
[2022-02-10 23:47:28,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:28,957 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:47:28,957 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:28,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:47:28,958 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:47:28,958 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-02-10 23:47:30,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:30,044 INFO  L93              Difference]: Finished difference Result 11923 states and 23410 transitions.
[2022-02-10 23:47:30,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2022-02-10 23:47:30,044 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-02-10 23:47:30,045 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:30,060 INFO  L225             Difference]: With dead ends: 11923
[2022-02-10 23:47:30,060 INFO  L226             Difference]: Without dead ends: 11923
[2022-02-10 23:47:30,061 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930
[2022-02-10 23:47:30,061 INFO  L934         BasicCegarLoop]: 577 mSDtfsCounter, 950 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:30,061 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 2658 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-10 23:47:30,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11923 states.
[2022-02-10 23:47:30,201 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681.
[2022-02-10 23:47:30,212 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-02-10 23:47:30,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions.
[2022-02-10 23:47:30,232 INFO  L78                 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476
[2022-02-10 23:47:30,233 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:30,233 INFO  L470      AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions.
[2022-02-10 23:47:30,233 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-02-10 23:47:30,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions.
[2022-02-10 23:47:30,237 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:30,237 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:30,237 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:30,237 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-02-10 23:47:30,237 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-02-10 23:47:30,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:30,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times
[2022-02-10 23:47:30,238 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:30,238 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270459052]
[2022-02-10 23:47:30,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:30,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:30,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:30,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:30,585 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:30,585 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270459052]
[2022-02-10 23:47:30,585 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270459052] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:30,585 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:30,585 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:47:30,585 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727171148]
[2022-02-10 23:47:30,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:30,586 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:47:30,586 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:30,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:47:30,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:47:30,586 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-02-10 23:47:31,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:31,948 INFO  L93              Difference]: Finished difference Result 12163 states and 23890 transitions.
[2022-02-10 23:47:31,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2022-02-10 23:47:31,949 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-02-10 23:47:31,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:31,988 INFO  L225             Difference]: With dead ends: 12163
[2022-02-10 23:47:31,988 INFO  L226             Difference]: Without dead ends: 12163
[2022-02-10 23:47:31,989 INFO  L933         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-02-10 23:47:31,989 INFO  L934         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-02-10 23:47:31,998 INFO  L935         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-02-10 23:47:32,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12163 states.
[2022-02-10 23:47:32,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685.
[2022-02-10 23:47:32,149 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-02-10 23:47:32,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions.
[2022-02-10 23:47:32,170 INFO  L78                 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476
[2022-02-10 23:47:32,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:32,170 INFO  L470      AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions.
[2022-02-10 23:47:32,170 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-02-10 23:47:32,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions.
[2022-02-10 23:47:32,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:32,174 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:32,174 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:32,174 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-02-10 23:47:32,186 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-02-10 23:47:32,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:32,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times
[2022-02-10 23:47:32,187 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:32,187 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544300925]
[2022-02-10 23:47:32,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:32,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:32,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:32,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:32,443 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:32,443 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544300925]
[2022-02-10 23:47:32,444 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544300925] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:32,444 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:32,444 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:47:32,444 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420081283]
[2022-02-10 23:47:32,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:32,444 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:47:32,444 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:32,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:47:32,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:47:32,445 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-02-10 23:47:33,887 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:33,887 INFO  L93              Difference]: Finished difference Result 21888 states and 43344 transitions.
[2022-02-10 23:47:33,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2022-02-10 23:47:33,888 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-02-10 23:47:33,888 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:33,924 INFO  L225             Difference]: With dead ends: 21888
[2022-02-10 23:47:33,924 INFO  L226             Difference]: Without dead ends: 21888
[2022-02-10 23:47:33,924 INFO  L933         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-02-10 23:47:33,925 INFO  L934         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-02-10 23:47:33,925 INFO  L935         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-02-10 23:47:33,953 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21888 states.
[2022-02-10 23:47:34,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752.
[2022-02-10 23:47:34,119 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-02-10 23:47:34,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions.
[2022-02-10 23:47:34,138 INFO  L78                 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476
[2022-02-10 23:47:34,138 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:34,138 INFO  L470      AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions.
[2022-02-10 23:47:34,139 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-02-10 23:47:34,139 INFO  L276                IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions.
[2022-02-10 23:47:34,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:34,141 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:34,142 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:34,142 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-02-10 23:47:34,142 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-02-10 23:47:34,142 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:34,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times
[2022-02-10 23:47:34,142 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:34,142 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847426716]
[2022-02-10 23:47:34,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:34,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:34,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:34,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:34,369 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:34,369 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847426716]
[2022-02-10 23:47:34,369 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847426716] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:34,369 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:34,369 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:34,369 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066965254]
[2022-02-10 23:47:34,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:34,370 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:34,370 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:34,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:34,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:34,370 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-02-10 23:47:36,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:36,026 INFO  L93              Difference]: Finished difference Result 21740 states and 43045 transitions.
[2022-02-10 23:47:36,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2022-02-10 23:47:36,026 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-02-10 23:47:36,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:36,057 INFO  L225             Difference]: With dead ends: 21740
[2022-02-10 23:47:36,057 INFO  L226             Difference]: Without dead ends: 21740
[2022-02-10 23:47:36,058 INFO  L933         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-02-10 23:47:36,058 INFO  L934         BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:36,058 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 4516 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-10 23:47:36,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21740 states.
[2022-02-10 23:47:36,257 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831.
[2022-02-10 23:47:36,266 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-02-10 23:47:36,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions.
[2022-02-10 23:47:36,299 INFO  L78                 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476
[2022-02-10 23:47:36,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:36,299 INFO  L470      AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions.
[2022-02-10 23:47:36,300 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-02-10 23:47:36,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions.
[2022-02-10 23:47:36,302 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:36,302 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:36,303 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:36,303 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-02-10 23:47:36,307 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-02-10 23:47:36,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:36,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times
[2022-02-10 23:47:36,308 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:36,308 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144616419]
[2022-02-10 23:47:36,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:36,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:36,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:36,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:36,569 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:36,569 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144616419]
[2022-02-10 23:47:36,569 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144616419] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:36,569 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:36,569 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:36,570 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718564199]
[2022-02-10 23:47:36,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:36,570 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:36,571 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:36,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:36,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:36,571 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-02-10 23:47:37,225 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:37,225 INFO  L93              Difference]: Finished difference Result 12198 states and 23964 transitions.
[2022-02-10 23:47:37,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:47:37,225 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-02-10 23:47:37,226 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:37,241 INFO  L225             Difference]: With dead ends: 12198
[2022-02-10 23:47:37,241 INFO  L226             Difference]: Without dead ends: 12198
[2022-02-10 23:47:37,242 INFO  L933         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-02-10 23:47:37,242 INFO  L934         BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:37,242 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2224 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:47:37,257 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12198 states.
[2022-02-10 23:47:37,349 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856.
[2022-02-10 23:47:37,359 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-02-10 23:47:37,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions.
[2022-02-10 23:47:37,377 INFO  L78                 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476
[2022-02-10 23:47:37,377 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:37,377 INFO  L470      AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions.
[2022-02-10 23:47:37,377 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-02-10 23:47:37,377 INFO  L276                IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions.
[2022-02-10 23:47:37,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:37,380 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:37,380 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:37,380 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-02-10 23:47:37,380 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-02-10 23:47:37,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:37,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times
[2022-02-10 23:47:37,381 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:37,381 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882677635]
[2022-02-10 23:47:37,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:37,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:37,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:37,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:37,618 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:37,618 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882677635]
[2022-02-10 23:47:37,618 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882677635] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:37,618 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:37,618 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:37,618 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47534070]
[2022-02-10 23:47:37,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:37,618 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:37,618 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:37,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:37,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:37,619 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-02-10 23:47:38,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:38,436 INFO  L93              Difference]: Finished difference Result 12278 states and 24124 transitions.
[2022-02-10 23:47:38,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:47:38,436 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-02-10 23:47:38,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:38,451 INFO  L225             Difference]: With dead ends: 12278
[2022-02-10 23:47:38,451 INFO  L226             Difference]: Without dead ends: 12278
[2022-02-10 23:47:38,451 INFO  L933         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-02-10 23:47:38,452 INFO  L934         BasicCegarLoop]: 420 mSDtfsCounter, 358 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:38,452 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 2542 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-10 23:47:38,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12278 states.
[2022-02-10 23:47:38,554 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864.
[2022-02-10 23:47:38,564 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-02-10 23:47:38,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions.
[2022-02-10 23:47:38,582 INFO  L78                 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476
[2022-02-10 23:47:38,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:38,582 INFO  L470      AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions.
[2022-02-10 23:47:38,582 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-02-10 23:47:38,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions.
[2022-02-10 23:47:38,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:38,585 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:38,585 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:38,585 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-02-10 23:47:38,585 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-02-10 23:47:38,585 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:38,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times
[2022-02-10 23:47:38,586 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:38,586 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274187894]
[2022-02-10 23:47:38,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:38,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:38,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:38,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:38,817 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:38,817 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274187894]
[2022-02-10 23:47:38,817 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274187894] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:38,817 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:38,817 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:38,817 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194689245]
[2022-02-10 23:47:38,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:38,818 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:38,818 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:38,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:38,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:38,819 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-02-10 23:47:39,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:39,638 INFO  L93              Difference]: Finished difference Result 12342 states and 24252 transitions.
[2022-02-10 23:47:39,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:47:39,638 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-02-10 23:47:39,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:39,655 INFO  L225             Difference]: With dead ends: 12342
[2022-02-10 23:47:39,655 INFO  L226             Difference]: Without dead ends: 12342
[2022-02-10 23:47:39,655 INFO  L933         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-02-10 23:47:39,656 INFO  L934         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-02-10 23:47:39,656 INFO  L935         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-02-10 23:47:39,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12342 states.
[2022-02-10 23:47:39,759 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872.
[2022-02-10 23:47:39,769 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-02-10 23:47:39,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions.
[2022-02-10 23:47:39,789 INFO  L78                 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476
[2022-02-10 23:47:39,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:39,789 INFO  L470      AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions.
[2022-02-10 23:47:39,789 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-02-10 23:47:39,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions.
[2022-02-10 23:47:39,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:39,792 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:39,792 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:39,792 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-02-10 23:47:39,792 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-02-10 23:47:39,793 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:39,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times
[2022-02-10 23:47:39,793 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:39,793 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551672335]
[2022-02-10 23:47:39,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:39,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:39,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:40,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:40,025 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:40,025 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551672335]
[2022-02-10 23:47:40,026 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551672335] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:40,026 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:40,026 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:40,026 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453904048]
[2022-02-10 23:47:40,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:40,026 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:40,026 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:40,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:40,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:40,027 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-02-10 23:47:41,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:41,426 INFO  L93              Difference]: Finished difference Result 22094 states and 43756 transitions.
[2022-02-10 23:47:41,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2022-02-10 23:47:41,426 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-02-10 23:47:41,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:41,455 INFO  L225             Difference]: With dead ends: 22094
[2022-02-10 23:47:41,455 INFO  L226             Difference]: Without dead ends: 22094
[2022-02-10 23:47:41,455 INFO  L933         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-02-10 23:47:41,456 INFO  L934         BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:41,456 INFO  L935         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-02-10 23:47:41,479 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22094 states.
[2022-02-10 23:47:41,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904.
[2022-02-10 23:47:41,616 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-02-10 23:47:41,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions.
[2022-02-10 23:47:41,634 INFO  L78                 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476
[2022-02-10 23:47:41,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:41,634 INFO  L470      AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions.
[2022-02-10 23:47:41,635 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-02-10 23:47:41,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions.
[2022-02-10 23:47:41,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:41,638 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:41,638 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:41,638 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2022-02-10 23:47:41,638 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-02-10 23:47:41,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:41,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times
[2022-02-10 23:47:41,638 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:41,638 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836845851]
[2022-02-10 23:47:41,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:41,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:41,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:41,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:41,892 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:41,892 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836845851]
[2022-02-10 23:47:41,892 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836845851] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:41,893 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:41,893 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:47:41,893 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660133049]
[2022-02-10 23:47:41,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:41,893 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:47:41,893 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:41,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:47:41,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:47:41,893 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-02-10 23:47:43,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:43,300 INFO  L93              Difference]: Finished difference Result 21883 states and 43334 transitions.
[2022-02-10 23:47:43,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2022-02-10 23:47:43,301 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-02-10 23:47:43,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:43,331 INFO  L225             Difference]: With dead ends: 21883
[2022-02-10 23:47:43,331 INFO  L226             Difference]: Without dead ends: 21883
[2022-02-10 23:47:43,331 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702
[2022-02-10 23:47:43,332 INFO  L934         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-02-10 23:47:43,332 INFO  L935         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-02-10 23:47:43,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21883 states.
[2022-02-10 23:47:43,493 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847.
[2022-02-10 23:47:43,502 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-02-10 23:47:43,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions.
[2022-02-10 23:47:43,521 INFO  L78                 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476
[2022-02-10 23:47:43,521 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:43,521 INFO  L470      AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions.
[2022-02-10 23:47:43,522 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-02-10 23:47:43,522 INFO  L276                IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions.
[2022-02-10 23:47:43,524 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:43,524 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:43,525 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:43,525 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2022-02-10 23:47:43,525 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-02-10 23:47:43,525 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:43,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times
[2022-02-10 23:47:43,525 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:43,525 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245158447]
[2022-02-10 23:47:43,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:43,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:43,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:43,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:43,758 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:43,758 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245158447]
[2022-02-10 23:47:43,758 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245158447] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:43,758 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:43,758 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:43,758 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571868757]
[2022-02-10 23:47:43,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:43,759 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:43,759 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:43,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:43,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:43,759 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-02-10 23:47:45,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:45,204 INFO  L93              Difference]: Finished difference Result 22050 states and 43668 transitions.
[2022-02-10 23:47:45,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2022-02-10 23:47:45,204 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-02-10 23:47:45,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:45,234 INFO  L225             Difference]: With dead ends: 22050
[2022-02-10 23:47:45,234 INFO  L226             Difference]: Without dead ends: 22050
[2022-02-10 23:47:45,234 INFO  L933         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-02-10 23:47:45,234 INFO  L934         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-02-10 23:47:45,235 INFO  L935         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-02-10 23:47:45,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22050 states.
[2022-02-10 23:47:45,389 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919.
[2022-02-10 23:47:45,399 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-02-10 23:47:45,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions.
[2022-02-10 23:47:45,417 INFO  L78                 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476
[2022-02-10 23:47:45,417 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:45,417 INFO  L470      AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions.
[2022-02-10 23:47:45,417 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-02-10 23:47:45,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions.
[2022-02-10 23:47:45,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:45,420 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:45,420 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:45,421 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2022-02-10 23:47:45,421 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-02-10 23:47:45,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:45,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times
[2022-02-10 23:47:45,421 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:45,421 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316878205]
[2022-02-10 23:47:45,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:45,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:45,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:45,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-02-10 23:47:45,671 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:45,671 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316878205]
[2022-02-10 23:47:45,671 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316878205] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:45,671 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:45,671 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:47:45,671 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259961110]
[2022-02-10 23:47:45,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:45,672 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:47:45,672 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:45,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:47:45,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:47:45,672 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-02-10 23:47:47,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:47,279 INFO  L93              Difference]: Finished difference Result 21957 states and 43482 transitions.
[2022-02-10 23:47:47,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2022-02-10 23:47:47,279 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-02-10 23:47:47,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:47,305 INFO  L225             Difference]: With dead ends: 21957
[2022-02-10 23:47:47,306 INFO  L226             Difference]: Without dead ends: 21957
[2022-02-10 23:47:47,306 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332
[2022-02-10 23:47:47,306 INFO  L934         BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:47,306 INFO  L935         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-02-10 23:47:47,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21957 states.
[2022-02-10 23:47:47,455 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847.
[2022-02-10 23:47:47,465 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-02-10 23:47:47,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions.
[2022-02-10 23:47:47,482 INFO  L78                 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476
[2022-02-10 23:47:47,482 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:47,483 INFO  L470      AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions.
[2022-02-10 23:47:47,483 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-02-10 23:47:47,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions.
[2022-02-10 23:47:47,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:47,485 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:47,486 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:47,486 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2022-02-10 23:47:47,486 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-02-10 23:47:47,486 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:47,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times
[2022-02-10 23:47:47,486 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:47,486 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451470128]
[2022-02-10 23:47:47,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:47,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:47,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:47,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:47,725 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:47,725 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451470128]
[2022-02-10 23:47:47,725 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451470128] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:47,725 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:47,725 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:47,725 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786892530]
[2022-02-10 23:47:47,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:47,726 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:47,726 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:47,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:47,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:47,726 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-02-10 23:47:48,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:48,703 INFO  L93              Difference]: Finished difference Result 13605 states and 26712 transitions.
[2022-02-10 23:47:48,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:47:48,703 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-02-10 23:47:48,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:48,722 INFO  L225             Difference]: With dead ends: 13605
[2022-02-10 23:47:48,722 INFO  L226             Difference]: Without dead ends: 13605
[2022-02-10 23:47:48,723 INFO  L933         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-02-10 23:47:48,723 INFO  L934         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-02-10 23:47:48,723 INFO  L935         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-02-10 23:47:48,738 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13605 states.
[2022-02-10 23:47:48,833 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867.
[2022-02-10 23:47:48,843 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-02-10 23:47:48,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions.
[2022-02-10 23:47:48,860 INFO  L78                 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476
[2022-02-10 23:47:48,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:48,861 INFO  L470      AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions.
[2022-02-10 23:47:48,861 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-02-10 23:47:48,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions.
[2022-02-10 23:47:48,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:48,863 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:48,864 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:48,864 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2022-02-10 23:47:48,864 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-02-10 23:47:48,864 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:48,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times
[2022-02-10 23:47:48,864 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:48,864 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788299083]
[2022-02-10 23:47:48,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:48,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:48,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:49,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:49,127 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:49,127 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788299083]
[2022-02-10 23:47:49,127 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788299083] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:49,127 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:49,127 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:49,127 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114331118]
[2022-02-10 23:47:49,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:49,127 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:49,127 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:49,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:49,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:49,128 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-02-10 23:47:50,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:50,287 INFO  L93              Difference]: Finished difference Result 13688 states and 26878 transitions.
[2022-02-10 23:47:50,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:47:50,287 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-02-10 23:47:50,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:50,305 INFO  L225             Difference]: With dead ends: 13688
[2022-02-10 23:47:50,305 INFO  L226             Difference]: Without dead ends: 13688
[2022-02-10 23:47:50,305 INFO  L933         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-02-10 23:47:50,305 INFO  L934         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-02-10 23:47:50,305 INFO  L935         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-02-10 23:47:50,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13688 states.
[2022-02-10 23:47:50,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875.
[2022-02-10 23:47:50,432 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-02-10 23:47:50,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions.
[2022-02-10 23:47:50,450 INFO  L78                 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476
[2022-02-10 23:47:50,450 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:50,450 INFO  L470      AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions.
[2022-02-10 23:47:50,450 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-02-10 23:47:50,450 INFO  L276                IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions.
[2022-02-10 23:47:50,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:50,453 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:50,454 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:50,454 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2022-02-10 23:47:50,454 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-02-10 23:47:50,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:50,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times
[2022-02-10 23:47:50,454 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:50,454 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602721629]
[2022-02-10 23:47:50,454 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:50,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:50,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:50,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:50,682 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:50,682 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602721629]
[2022-02-10 23:47:50,682 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602721629] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:50,682 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:50,682 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:50,682 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234711979]
[2022-02-10 23:47:50,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:50,683 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:50,683 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:50,683 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:50,683 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:50,683 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-02-10 23:47:51,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:51,884 INFO  L93              Difference]: Finished difference Result 13858 states and 27218 transitions.
[2022-02-10 23:47:51,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:47:51,884 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-02-10 23:47:51,884 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:51,902 INFO  L225             Difference]: With dead ends: 13858
[2022-02-10 23:47:51,902 INFO  L226             Difference]: Without dead ends: 13858
[2022-02-10 23:47:51,902 INFO  L933         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-02-10 23:47:51,903 INFO  L934         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-02-10 23:47:51,903 INFO  L935         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-02-10 23:47:51,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13858 states.
[2022-02-10 23:47:52,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883.
[2022-02-10 23:47:52,034 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-02-10 23:47:52,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions.
[2022-02-10 23:47:52,054 INFO  L78                 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476
[2022-02-10 23:47:52,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:52,055 INFO  L470      AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions.
[2022-02-10 23:47:52,055 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-02-10 23:47:52,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions.
[2022-02-10 23:47:52,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:52,058 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:52,058 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:52,058 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2022-02-10 23:47:52,058 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-02-10 23:47:52,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:52,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times
[2022-02-10 23:47:52,058 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:52,059 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453870673]
[2022-02-10 23:47:52,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:52,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:52,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:52,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-02-10 23:47:52,414 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:52,414 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453870673]
[2022-02-10 23:47:52,414 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453870673] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:52,414 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:52,414 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:52,414 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307686575]
[2022-02-10 23:47:52,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:52,414 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:52,414 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:52,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:52,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:52,415 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-02-10 23:47:53,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:53,717 INFO  L93              Difference]: Finished difference Result 13640 states and 26782 transitions.
[2022-02-10 23:47:53,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:47:53,717 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-02-10 23:47:53,718 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:53,735 INFO  L225             Difference]: With dead ends: 13640
[2022-02-10 23:47:53,735 INFO  L226             Difference]: Without dead ends: 13640
[2022-02-10 23:47:53,735 INFO  L933         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-02-10 23:47:53,736 INFO  L934         BasicCegarLoop]: 668 mSDtfsCounter, 693 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:53,736 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3423 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:47:53,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13640 states.
[2022-02-10 23:47:53,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884.
[2022-02-10 23:47:53,861 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-02-10 23:47:53,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions.
[2022-02-10 23:47:53,879 INFO  L78                 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476
[2022-02-10 23:47:53,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:53,880 INFO  L470      AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions.
[2022-02-10 23:47:53,880 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-02-10 23:47:53,880 INFO  L276                IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions.
[2022-02-10 23:47:53,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:53,883 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:53,883 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:53,883 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2022-02-10 23:47:53,884 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-02-10 23:47:53,884 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:53,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times
[2022-02-10 23:47:53,884 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:53,884 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347111136]
[2022-02-10 23:47:53,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:53,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:53,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:54,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:54,124 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:54,124 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347111136]
[2022-02-10 23:47:54,124 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347111136] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:54,124 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:54,124 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:54,124 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090186044]
[2022-02-10 23:47:54,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:54,124 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:54,124 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:54,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:54,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:54,125 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-02-10 23:47:55,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:55,550 INFO  L93              Difference]: Finished difference Result 13799 states and 27100 transitions.
[2022-02-10 23:47:55,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:47:55,551 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-02-10 23:47:55,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:55,569 INFO  L225             Difference]: With dead ends: 13799
[2022-02-10 23:47:55,569 INFO  L226             Difference]: Without dead ends: 13799
[2022-02-10 23:47:55,569 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420
[2022-02-10 23:47:55,570 INFO  L934         BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:55,570 INFO  L935         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-02-10 23:47:55,585 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13799 states.
[2022-02-10 23:47:55,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883.
[2022-02-10 23:47:55,690 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-02-10 23:47:55,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions.
[2022-02-10 23:47:55,708 INFO  L78                 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476
[2022-02-10 23:47:55,708 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:55,708 INFO  L470      AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions.
[2022-02-10 23:47:55,708 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-02-10 23:47:55,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions.
[2022-02-10 23:47:55,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:55,711 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:55,711 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:55,711 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2022-02-10 23:47:55,711 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-02-10 23:47:55,712 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:55,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times
[2022-02-10 23:47:55,712 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:55,712 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190170345]
[2022-02-10 23:47:55,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:55,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:55,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:55,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:55,965 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:55,965 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190170345]
[2022-02-10 23:47:55,965 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190170345] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:55,965 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:55,965 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:55,965 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168066183]
[2022-02-10 23:47:55,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:55,965 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:55,965 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:55,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:55,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:55,966 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-02-10 23:47:57,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:57,496 INFO  L93              Difference]: Finished difference Result 13633 states and 26767 transitions.
[2022-02-10 23:47:57,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:47:57,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-02-10 23:47:57,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:57,520 INFO  L225             Difference]: With dead ends: 13633
[2022-02-10 23:47:57,520 INFO  L226             Difference]: Without dead ends: 13633
[2022-02-10 23:47:57,521 INFO  L933         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-02-10 23:47:57,521 INFO  L934         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.4s IncrementalHoareTripleChecker+Time
[2022-02-10 23:47:57,521 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3816 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-10 23:47:57,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13633 states.
[2022-02-10 23:47:57,646 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883.
[2022-02-10 23:47:57,656 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-02-10 23:47:57,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions.
[2022-02-10 23:47:57,674 INFO  L78                 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476
[2022-02-10 23:47:57,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:57,674 INFO  L470      AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions.
[2022-02-10 23:47:57,674 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-02-10 23:47:57,674 INFO  L276                IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions.
[2022-02-10 23:47:57,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:57,677 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:57,677 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:57,677 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2022-02-10 23:47:57,677 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-02-10 23:47:57,678 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:57,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times
[2022-02-10 23:47:57,678 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:57,678 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162042135]
[2022-02-10 23:47:57,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:57,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:57,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:57,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:57,929 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:57,929 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162042135]
[2022-02-10 23:47:57,929 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162042135] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:57,929 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:57,930 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:57,930 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966412436]
[2022-02-10 23:47:57,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:57,930 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:57,930 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:57,930 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:57,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:57,930 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-02-10 23:47:58,904 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:47:58,904 INFO  L93              Difference]: Finished difference Result 13686 states and 26874 transitions.
[2022-02-10 23:47:58,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:47:58,904 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-02-10 23:47:58,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:47:58,923 INFO  L225             Difference]: With dead ends: 13686
[2022-02-10 23:47:58,924 INFO  L226             Difference]: Without dead ends: 13686
[2022-02-10 23:47:58,924 INFO  L933         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-02-10 23:47:58,924 INFO  L934         BasicCegarLoop]: 617 mSDtfsCounter, 616 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-02-10 23:47:58,924 INFO  L935         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-02-10 23:47:58,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13686 states.
[2022-02-10 23:47:59,035 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889.
[2022-02-10 23:47:59,045 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-02-10 23:47:59,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions.
[2022-02-10 23:47:59,063 INFO  L78                 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476
[2022-02-10 23:47:59,063 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:47:59,063 INFO  L470      AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions.
[2022-02-10 23:47:59,064 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-02-10 23:47:59,064 INFO  L276                IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions.
[2022-02-10 23:47:59,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:47:59,066 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:47:59,067 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:47:59,067 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2022-02-10 23:47:59,067 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-02-10 23:47:59,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:47:59,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times
[2022-02-10 23:47:59,067 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:47:59,067 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097838682]
[2022-02-10 23:47:59,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:47:59,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:47:59,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:47:59,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:47:59,305 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:47:59,305 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097838682]
[2022-02-10 23:47:59,305 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097838682] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:47:59,305 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:47:59,305 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:47:59,306 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228601755]
[2022-02-10 23:47:59,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:47:59,306 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:47:59,306 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:47:59,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:47:59,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:47:59,306 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-02-10 23:48:00,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:00,126 INFO  L93              Difference]: Finished difference Result 13769 states and 27040 transitions.
[2022-02-10 23:48:00,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:48:00,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-02-10 23:48:00,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:00,147 INFO  L225             Difference]: With dead ends: 13769
[2022-02-10 23:48:00,147 INFO  L226             Difference]: Without dead ends: 13769
[2022-02-10 23:48:00,148 INFO  L933         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-02-10 23:48:00,148 INFO  L934         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.6s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:00,148 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2803 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-02-10 23:48:00,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13769 states.
[2022-02-10 23:48:00,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888.
[2022-02-10 23:48:00,274 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-02-10 23:48:00,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions.
[2022-02-10 23:48:00,291 INFO  L78                 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476
[2022-02-10 23:48:00,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:00,292 INFO  L470      AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions.
[2022-02-10 23:48:00,292 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-02-10 23:48:00,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions.
[2022-02-10 23:48:00,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:00,295 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:00,295 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:00,297 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2022-02-10 23:48:00,297 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-02-10 23:48:00,298 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:00,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times
[2022-02-10 23:48:00,298 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:00,298 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409131030]
[2022-02-10 23:48:00,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:00,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:00,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:00,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-02-10 23:48:00,537 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:00,538 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409131030]
[2022-02-10 23:48:00,538 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409131030] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:00,538 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:00,538 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:00,538 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022012059]
[2022-02-10 23:48:00,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:00,538 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:00,538 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:00,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:00,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:00,539 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-02-10 23:48:01,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:01,516 INFO  L93              Difference]: Finished difference Result 13833 states and 27168 transitions.
[2022-02-10 23:48:01,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2022-02-10 23:48:01,517 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-02-10 23:48:01,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:01,535 INFO  L225             Difference]: With dead ends: 13833
[2022-02-10 23:48:01,536 INFO  L226             Difference]: Without dead ends: 13833
[2022-02-10 23:48:01,536 INFO  L933         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-02-10 23:48:01,536 INFO  L934         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-02-10 23:48:01,536 INFO  L935         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-02-10 23:48:01,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13833 states.
[2022-02-10 23:48:01,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887.
[2022-02-10 23:48:01,673 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-02-10 23:48:01,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions.
[2022-02-10 23:48:01,691 INFO  L78                 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476
[2022-02-10 23:48:01,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:01,692 INFO  L470      AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions.
[2022-02-10 23:48:01,692 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-02-10 23:48:01,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions.
[2022-02-10 23:48:01,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:01,695 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:01,695 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:01,695 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2022-02-10 23:48:01,695 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-02-10 23:48:01,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:01,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times
[2022-02-10 23:48:01,696 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:01,696 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843250407]
[2022-02-10 23:48:01,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:01,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:01,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:01,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:01,907 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:01,907 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843250407]
[2022-02-10 23:48:01,907 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843250407] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:01,907 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:01,907 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:01,908 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118441128]
[2022-02-10 23:48:01,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:01,908 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:01,908 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:01,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:01,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:01,908 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-02-10 23:48:03,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:03,322 INFO  L93              Difference]: Finished difference Result 23633 states and 46768 transitions.
[2022-02-10 23:48:03,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2022-02-10 23:48:03,323 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-02-10 23:48:03,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:03,355 INFO  L225             Difference]: With dead ends: 23633
[2022-02-10 23:48:03,355 INFO  L226             Difference]: Without dead ends: 23633
[2022-02-10 23:48:03,356 INFO  L933         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-02-10 23:48:03,356 INFO  L934         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-02-10 23:48:03,356 INFO  L935         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-02-10 23:48:03,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23633 states.
[2022-02-10 23:48:03,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919.
[2022-02-10 23:48:03,535 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-02-10 23:48:03,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions.
[2022-02-10 23:48:03,553 INFO  L78                 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476
[2022-02-10 23:48:03,553 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:03,553 INFO  L470      AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions.
[2022-02-10 23:48:03,553 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-02-10 23:48:03,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions.
[2022-02-10 23:48:03,617 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:03,618 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:03,618 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:03,618 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2022-02-10 23:48:03,618 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-02-10 23:48:03,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:03,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times
[2022-02-10 23:48:03,618 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:03,619 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262877174]
[2022-02-10 23:48:03,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:03,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:03,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:03,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:03,895 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:03,895 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262877174]
[2022-02-10 23:48:03,895 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262877174] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:03,895 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:03,895 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:48:03,895 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465276385]
[2022-02-10 23:48:03,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:03,896 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:48:03,897 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:03,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:48:03,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:48:03,898 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-02-10 23:48:06,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:06,032 INFO  L93              Difference]: Finished difference Result 23388 states and 46278 transitions.
[2022-02-10 23:48:06,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2022-02-10 23:48:06,032 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-02-10 23:48:06,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:06,066 INFO  L225             Difference]: With dead ends: 23388
[2022-02-10 23:48:06,066 INFO  L226             Difference]: Without dead ends: 23388
[2022-02-10 23:48:06,070 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070
[2022-02-10 23:48:06,070 INFO  L934         BasicCegarLoop]: 1049 mSDtfsCounter, 1521 mSDsluCounter, 5294 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:06,071 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 6340 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2022-02-10 23:48:06,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23388 states.
[2022-02-10 23:48:06,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863.
[2022-02-10 23:48:06,249 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-02-10 23:48:06,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions.
[2022-02-10 23:48:06,266 INFO  L78                 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476
[2022-02-10 23:48:06,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:06,266 INFO  L470      AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions.
[2022-02-10 23:48:06,267 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-02-10 23:48:06,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions.
[2022-02-10 23:48:06,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:06,269 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:06,270 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:06,270 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2022-02-10 23:48:06,270 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-02-10 23:48:06,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:06,270 INFO  L85        PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times
[2022-02-10 23:48:06,270 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:06,270 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476738978]
[2022-02-10 23:48:06,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:06,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:06,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:06,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-02-10 23:48:06,492 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:06,492 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476738978]
[2022-02-10 23:48:06,493 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476738978] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:06,493 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:06,493 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:06,493 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284919785]
[2022-02-10 23:48:06,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:06,493 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:06,493 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:06,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:06,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:06,494 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-02-10 23:48:07,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:07,428 INFO  L93              Difference]: Finished difference Result 12207 states and 23984 transitions.
[2022-02-10 23:48:07,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:48:07,429 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-02-10 23:48:07,429 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:07,443 INFO  L225             Difference]: With dead ends: 12207
[2022-02-10 23:48:07,443 INFO  L226             Difference]: Without dead ends: 12207
[2022-02-10 23:48:07,443 INFO  L933         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-02-10 23:48:07,444 INFO  L934         BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:07,444 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 3240 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-10 23:48:07,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12207 states.
[2022-02-10 23:48:07,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879.
[2022-02-10 23:48:07,556 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-02-10 23:48:07,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions.
[2022-02-10 23:48:07,576 INFO  L78                 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476
[2022-02-10 23:48:07,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:07,576 INFO  L470      AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions.
[2022-02-10 23:48:07,576 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-02-10 23:48:07,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions.
[2022-02-10 23:48:07,579 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:07,579 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:07,579 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:07,579 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2022-02-10 23:48:07,579 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-02-10 23:48:07,579 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:07,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times
[2022-02-10 23:48:07,580 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:07,580 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587691812]
[2022-02-10 23:48:07,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:07,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:07,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:07,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:07,808 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:07,808 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587691812]
[2022-02-10 23:48:07,808 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587691812] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:07,808 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:07,808 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:07,808 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853106704]
[2022-02-10 23:48:07,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:07,808 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:07,808 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:07,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:07,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:07,809 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-02-10 23:48:08,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:08,590 INFO  L93              Difference]: Finished difference Result 12290 states and 24150 transitions.
[2022-02-10 23:48:08,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:48:08,591 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-02-10 23:48:08,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:08,606 INFO  L225             Difference]: With dead ends: 12290
[2022-02-10 23:48:08,606 INFO  L226             Difference]: Without dead ends: 12290
[2022-02-10 23:48:08,606 INFO  L933         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-02-10 23:48:08,607 INFO  L934         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-02-10 23:48:08,607 INFO  L935         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-02-10 23:48:08,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12290 states.
[2022-02-10 23:48:08,712 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887.
[2022-02-10 23:48:08,722 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-02-10 23:48:08,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions.
[2022-02-10 23:48:08,739 INFO  L78                 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476
[2022-02-10 23:48:08,740 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:08,740 INFO  L470      AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions.
[2022-02-10 23:48:08,740 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-02-10 23:48:08,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions.
[2022-02-10 23:48:08,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:08,743 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:08,743 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:08,743 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2022-02-10 23:48:08,743 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-02-10 23:48:08,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:08,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times
[2022-02-10 23:48:08,743 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:08,744 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820082070]
[2022-02-10 23:48:08,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:08,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:08,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:08,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:08,972 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:08,972 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820082070]
[2022-02-10 23:48:08,972 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820082070] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:08,972 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:08,972 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:08,972 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429757933]
[2022-02-10 23:48:08,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:08,972 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:08,973 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:08,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:08,973 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:08,973 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-02-10 23:48:09,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:09,709 INFO  L93              Difference]: Finished difference Result 12354 states and 24278 transitions.
[2022-02-10 23:48:09,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:48:09,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476
[2022-02-10 23:48:09,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:09,725 INFO  L225             Difference]: With dead ends: 12354
[2022-02-10 23:48:09,725 INFO  L226             Difference]: Without dead ends: 12354
[2022-02-10 23:48:09,725 INFO  L933         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-02-10 23:48:09,726 INFO  L934         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-02-10 23:48:09,726 INFO  L935         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-02-10 23:48:09,740 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12354 states.
[2022-02-10 23:48:09,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895.
[2022-02-10 23:48:09,841 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-02-10 23:48:09,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions.
[2022-02-10 23:48:09,859 INFO  L78                 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476
[2022-02-10 23:48:09,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:09,860 INFO  L470      AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions.
[2022-02-10 23:48:09,860 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-02-10 23:48:09,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions.
[2022-02-10 23:48:09,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:09,863 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:09,863 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:09,863 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2022-02-10 23:48:09,863 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-02-10 23:48:09,863 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:09,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times
[2022-02-10 23:48:09,864 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:09,864 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213825095]
[2022-02-10 23:48:09,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:09,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:09,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:10,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:10,089 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:10,089 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213825095]
[2022-02-10 23:48:10,089 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213825095] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:10,089 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:10,090 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:10,090 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671219386]
[2022-02-10 23:48:10,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:10,090 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:10,090 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:10,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:10,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:10,090 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-02-10 23:48:11,742 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:11,743 INFO  L93              Difference]: Finished difference Result 22106 states and 43782 transitions.
[2022-02-10 23:48:11,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2022-02-10 23:48:11,743 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-02-10 23:48:11,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:11,773 INFO  L225             Difference]: With dead ends: 22106
[2022-02-10 23:48:11,774 INFO  L226             Difference]: Without dead ends: 22106
[2022-02-10 23:48:11,774 INFO  L933         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-02-10 23:48:11,774 INFO  L934         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-02-10 23:48:11,774 INFO  L935         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-02-10 23:48:11,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22106 states.
[2022-02-10 23:48:11,930 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927.
[2022-02-10 23:48:11,940 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-02-10 23:48:11,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions.
[2022-02-10 23:48:11,958 INFO  L78                 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476
[2022-02-10 23:48:11,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:11,958 INFO  L470      AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions.
[2022-02-10 23:48:11,959 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-02-10 23:48:11,959 INFO  L276                IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions.
[2022-02-10 23:48:11,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:11,962 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:11,962 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:11,962 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2022-02-10 23:48:11,962 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-02-10 23:48:11,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:11,962 INFO  L85        PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times
[2022-02-10 23:48:11,962 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:11,962 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197230518]
[2022-02-10 23:48:11,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:11,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:12,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:12,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:12,194 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:12,194 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197230518]
[2022-02-10 23:48:12,194 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197230518] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:12,194 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:12,194 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:48:12,195 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846021694]
[2022-02-10 23:48:12,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:12,195 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:48:12,195 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:12,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:48:12,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:48:12,195 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-02-10 23:48:13,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:13,408 INFO  L93              Difference]: Finished difference Result 21911 states and 43392 transitions.
[2022-02-10 23:48:13,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2022-02-10 23:48:13,408 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-02-10 23:48:13,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:13,438 INFO  L225             Difference]: With dead ends: 21911
[2022-02-10 23:48:13,438 INFO  L226             Difference]: Without dead ends: 21911
[2022-02-10 23:48:13,438 INFO  L933         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-02-10 23:48:13,439 INFO  L934         BasicCegarLoop]: 919 mSDtfsCounter, 1149 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:13,439 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 4839 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-10 23:48:13,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21911 states.
[2022-02-10 23:48:13,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848.
[2022-02-10 23:48:13,622 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-02-10 23:48:13,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions.
[2022-02-10 23:48:13,639 INFO  L78                 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476
[2022-02-10 23:48:13,640 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:13,640 INFO  L470      AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions.
[2022-02-10 23:48:13,640 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-02-10 23:48:13,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions.
[2022-02-10 23:48:13,642 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:13,642 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:13,643 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:13,643 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2022-02-10 23:48:13,643 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-02-10 23:48:13,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:13,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times
[2022-02-10 23:48:13,643 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:13,643 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870942242]
[2022-02-10 23:48:13,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:13,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:13,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:13,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:13,847 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:13,847 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870942242]
[2022-02-10 23:48:13,847 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870942242] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:13,847 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:13,848 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:13,848 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501359473]
[2022-02-10 23:48:13,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:13,848 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:13,848 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:13,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:13,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:13,849 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-02-10 23:48:15,127 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:15,127 INFO  L93              Difference]: Finished difference Result 21819 states and 43200 transitions.
[2022-02-10 23:48:15,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:48:15,127 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-02-10 23:48:15,128 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:15,155 INFO  L225             Difference]: With dead ends: 21819
[2022-02-10 23:48:15,156 INFO  L226             Difference]: Without dead ends: 21819
[2022-02-10 23:48:15,157 INFO  L933         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-02-10 23:48:15,157 INFO  L934         BasicCegarLoop]: 842 mSDtfsCounter, 933 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:15,157 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 4801 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:48:15,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21819 states.
[2022-02-10 23:48:15,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741.
[2022-02-10 23:48:15,316 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-02-10 23:48:15,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions.
[2022-02-10 23:48:15,333 INFO  L78                 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476
[2022-02-10 23:48:15,333 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:15,333 INFO  L470      AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions.
[2022-02-10 23:48:15,333 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-02-10 23:48:15,333 INFO  L276                IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions.
[2022-02-10 23:48:15,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 477
[2022-02-10 23:48:15,336 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:15,336 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:15,336 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2022-02-10 23:48:15,336 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-02-10 23:48:15,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:15,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times
[2022-02-10 23:48:15,337 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:15,337 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927669896]
[2022-02-10 23:48:15,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:15,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:15,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:15,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:15,573 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:15,573 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927669896]
[2022-02-10 23:48:15,573 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927669896] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:15,573 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:15,573 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-10 23:48:15,573 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551733534]
[2022-02-10 23:48:15,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:15,573 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:48:15,573 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:15,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:48:15,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2022-02-10 23:48:15,574 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-02-10 23:48:17,440 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:17,441 INFO  L93              Difference]: Finished difference Result 21742 states and 43046 transitions.
[2022-02-10 23:48:17,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2022-02-10 23:48:17,441 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-02-10 23:48:17,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:17,472 INFO  L225             Difference]: With dead ends: 21742
[2022-02-10 23:48:17,472 INFO  L226             Difference]: Without dead ends: 21742
[2022-02-10 23:48:17,473 INFO  L933         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-02-10 23:48:17,473 INFO  L934         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-02-10 23:48:17,473 INFO  L935         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-02-10 23:48:17,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21742 states.
[2022-02-10 23:48:17,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608.
[2022-02-10 23:48:17,633 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-02-10 23:48:17,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions.
[2022-02-10 23:48:17,650 INFO  L78                 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476
[2022-02-10 23:48:17,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:17,651 INFO  L470      AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions.
[2022-02-10 23:48:17,651 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-02-10 23:48:17,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions.
[2022-02-10 23:48:17,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 478
[2022-02-10 23:48:17,653 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:17,653 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:17,653 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2022-02-10 23:48:17,654 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-02-10 23:48:17,654 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:17,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times
[2022-02-10 23:48:17,654 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:17,654 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139147724]
[2022-02-10 23:48:17,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:17,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:17,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:17,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:17,822 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:17,822 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139147724]
[2022-02-10 23:48:17,822 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139147724] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:17,822 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:17,822 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:48:17,822 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262290697]
[2022-02-10 23:48:17,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:17,823 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:48:17,823 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:17,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:48:17,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:48:17,823 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-02-10 23:48:18,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:18,158 INFO  L93              Difference]: Finished difference Result 15459 states and 30482 transitions.
[2022-02-10 23:48:18,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:48:18,158 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-02-10 23:48:18,158 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:18,178 INFO  L225             Difference]: With dead ends: 15459
[2022-02-10 23:48:18,178 INFO  L226             Difference]: Without dead ends: 15459
[2022-02-10 23:48:18,178 INFO  L933         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-02-10 23:48:18,179 INFO  L934         BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:18,179 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 888 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-10 23:48:18,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15459 states.
[2022-02-10 23:48:18,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246.
[2022-02-10 23:48:18,311 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-02-10 23:48:18,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions.
[2022-02-10 23:48:18,330 INFO  L78                 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477
[2022-02-10 23:48:18,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:18,330 INFO  L470      AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions.
[2022-02-10 23:48:18,330 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-02-10 23:48:18,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions.
[2022-02-10 23:48:18,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 478
[2022-02-10 23:48:18,333 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:18,333 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:18,333 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2022-02-10 23:48:18,333 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-02-10 23:48:18,333 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:18,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times
[2022-02-10 23:48:18,333 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:18,333 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84498819]
[2022-02-10 23:48:18,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:18,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:18,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:18,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:18,491 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:18,491 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84498819]
[2022-02-10 23:48:18,491 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84498819] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:18,491 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:18,491 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:48:18,491 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677003034]
[2022-02-10 23:48:18,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:18,492 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:48:18,492 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:18,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:48:18,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:48:18,492 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-02-10 23:48:19,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:19,098 INFO  L93              Difference]: Finished difference Result 14561 states and 28686 transitions.
[2022-02-10 23:48:19,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:48:19,098 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-02-10 23:48:19,099 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:19,117 INFO  L225             Difference]: With dead ends: 14561
[2022-02-10 23:48:19,117 INFO  L226             Difference]: Without dead ends: 14561
[2022-02-10 23:48:19,117 INFO  L933         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-02-10 23:48:19,118 INFO  L934         BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-02-10 23:48:19,118 INFO  L935         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-02-10 23:48:19,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14561 states.
[2022-02-10 23:48:19,242 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666.
[2022-02-10 23:48:19,252 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-02-10 23:48:19,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions.
[2022-02-10 23:48:19,271 INFO  L78                 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477
[2022-02-10 23:48:19,271 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:19,271 INFO  L470      AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions.
[2022-02-10 23:48:19,272 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-02-10 23:48:19,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions.
[2022-02-10 23:48:19,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:19,275 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:19,275 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:19,275 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2022-02-10 23:48:19,275 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-02-10 23:48:19,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:19,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times
[2022-02-10 23:48:19,275 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:19,276 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112222144]
[2022-02-10 23:48:19,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:19,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:19,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:19,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:19,612 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:19,612 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112222144]
[2022-02-10 23:48:19,612 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112222144] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:19,612 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:19,612 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:19,612 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668869925]
[2022-02-10 23:48:19,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:19,613 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:19,613 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:19,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:19,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:19,613 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-02-10 23:48:20,564 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:20,564 INFO  L93              Difference]: Finished difference Result 12802 states and 25168 transitions.
[2022-02-10 23:48:20,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2022-02-10 23:48:20,565 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-02-10 23:48:20,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:20,580 INFO  L225             Difference]: With dead ends: 12802
[2022-02-10 23:48:20,581 INFO  L226             Difference]: Without dead ends: 12802
[2022-02-10 23:48:20,581 INFO  L933         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-02-10 23:48:20,581 INFO  L934         BasicCegarLoop]: 592 mSDtfsCounter, 565 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:20,581 INFO  L935         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-02-10 23:48:20,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12802 states.
[2022-02-10 23:48:20,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683.
[2022-02-10 23:48:20,710 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-02-10 23:48:20,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions.
[2022-02-10 23:48:20,729 INFO  L78                 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484
[2022-02-10 23:48:20,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:20,729 INFO  L470      AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions.
[2022-02-10 23:48:20,730 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-02-10 23:48:20,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions.
[2022-02-10 23:48:20,733 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:20,733 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:20,733 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:20,733 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2022-02-10 23:48:20,733 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-02-10 23:48:20,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:20,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times
[2022-02-10 23:48:20,734 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:20,734 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562609575]
[2022-02-10 23:48:20,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:20,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:20,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:20,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:20,988 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:20,988 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562609575]
[2022-02-10 23:48:20,988 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562609575] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:20,988 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:20,988 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:20,988 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112378455]
[2022-02-10 23:48:20,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:20,989 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:20,989 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:20,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:20,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:20,989 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-02-10 23:48:22,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:22,176 INFO  L93              Difference]: Finished difference Result 12858 states and 25280 transitions.
[2022-02-10 23:48:22,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:48:22,177 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-02-10 23:48:22,177 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:22,194 INFO  L225             Difference]: With dead ends: 12858
[2022-02-10 23:48:22,194 INFO  L226             Difference]: Without dead ends: 12858
[2022-02-10 23:48:22,195 INFO  L933         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-02-10 23:48:22,195 INFO  L934         BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:22,195 INFO  L935         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-02-10 23:48:22,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12858 states.
[2022-02-10 23:48:22,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703.
[2022-02-10 23:48:22,328 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-02-10 23:48:22,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions.
[2022-02-10 23:48:22,352 INFO  L78                 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484
[2022-02-10 23:48:22,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:22,353 INFO  L470      AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions.
[2022-02-10 23:48:22,353 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-02-10 23:48:22,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions.
[2022-02-10 23:48:22,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:22,356 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:22,356 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:22,356 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2022-02-10 23:48:22,356 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-02-10 23:48:22,357 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:22,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times
[2022-02-10 23:48:22,357 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:22,357 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905710141]
[2022-02-10 23:48:22,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:22,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:22,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:22,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:22,593 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:22,593 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905710141]
[2022-02-10 23:48:22,593 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905710141] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:22,593 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:22,593 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:22,593 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921621891]
[2022-02-10 23:48:22,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:22,594 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:22,594 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:22,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:22,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:22,594 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-02-10 23:48:23,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:23,720 INFO  L93              Difference]: Finished difference Result 12891 states and 25346 transitions.
[2022-02-10 23:48:23,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:48:23,721 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-02-10 23:48:23,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:23,736 INFO  L225             Difference]: With dead ends: 12891
[2022-02-10 23:48:23,736 INFO  L226             Difference]: Without dead ends: 12891
[2022-02-10 23:48:23,737 INFO  L933         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-02-10 23:48:23,737 INFO  L934         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-02-10 23:48:23,737 INFO  L935         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-02-10 23:48:23,751 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12891 states.
[2022-02-10 23:48:23,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704.
[2022-02-10 23:48:23,872 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-02-10 23:48:23,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions.
[2022-02-10 23:48:23,892 INFO  L78                 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484
[2022-02-10 23:48:23,893 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:23,893 INFO  L470      AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions.
[2022-02-10 23:48:23,893 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-02-10 23:48:23,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions.
[2022-02-10 23:48:23,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:23,896 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:23,896 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:23,896 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2022-02-10 23:48:23,896 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-02-10 23:48:23,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:23,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times
[2022-02-10 23:48:23,897 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:23,897 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516941579]
[2022-02-10 23:48:23,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:23,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:23,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:24,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-02-10 23:48:24,092 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:24,092 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516941579]
[2022-02-10 23:48:24,092 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516941579] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:24,092 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:24,092 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:24,092 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476919429]
[2022-02-10 23:48:24,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:24,093 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:24,093 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:24,093 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:24,093 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:24,093 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-02-10 23:48:25,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:25,495 INFO  L93              Difference]: Finished difference Result 12912 states and 25388 transitions.
[2022-02-10 23:48:25,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:48:25,495 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484
[2022-02-10 23:48:25,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:25,511 INFO  L225             Difference]: With dead ends: 12912
[2022-02-10 23:48:25,511 INFO  L226             Difference]: Without dead ends: 12912
[2022-02-10 23:48:25,511 INFO  L933         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-02-10 23:48:25,512 INFO  L934         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-02-10 23:48:25,512 INFO  L935         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-02-10 23:48:25,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12912 states.
[2022-02-10 23:48:25,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723.
[2022-02-10 23:48:25,640 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-02-10 23:48:25,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions.
[2022-02-10 23:48:25,660 INFO  L78                 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484
[2022-02-10 23:48:25,660 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:25,660 INFO  L470      AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions.
[2022-02-10 23:48:25,660 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-02-10 23:48:25,660 INFO  L276                IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions.
[2022-02-10 23:48:25,663 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:25,663 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:25,663 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:25,663 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2022-02-10 23:48:25,663 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-02-10 23:48:25,664 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:25,664 INFO  L85        PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times
[2022-02-10 23:48:25,664 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:25,664 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50560248]
[2022-02-10 23:48:25,664 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:25,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:25,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:25,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:25,841 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:25,841 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50560248]
[2022-02-10 23:48:25,841 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50560248] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:25,841 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:25,841 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:25,841 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963470721]
[2022-02-10 23:48:25,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:25,841 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:25,841 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:25,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:25,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:25,842 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-02-10 23:48:26,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:26,516 INFO  L93              Difference]: Finished difference Result 12970 states and 25504 transitions.
[2022-02-10 23:48:26,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2022-02-10 23:48:26,516 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-02-10 23:48:26,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:26,532 INFO  L225             Difference]: With dead ends: 12970
[2022-02-10 23:48:26,532 INFO  L226             Difference]: Without dead ends: 12970
[2022-02-10 23:48:26,533 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702
[2022-02-10 23:48:26,544 INFO  L934         BasicCegarLoop]: 580 mSDtfsCounter, 613 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:26,544 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2440 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:48:26,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12970 states.
[2022-02-10 23:48:26,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743.
[2022-02-10 23:48:26,674 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-02-10 23:48:26,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions.
[2022-02-10 23:48:26,695 INFO  L78                 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484
[2022-02-10 23:48:26,695 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:26,695 INFO  L470      AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions.
[2022-02-10 23:48:26,695 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-02-10 23:48:26,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions.
[2022-02-10 23:48:26,698 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:26,698 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:26,698 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:26,698 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2022-02-10 23:48:26,698 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-02-10 23:48:26,699 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:26,699 INFO  L85        PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times
[2022-02-10 23:48:26,699 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:26,699 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979064746]
[2022-02-10 23:48:26,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:26,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:26,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:26,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:26,899 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:26,899 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979064746]
[2022-02-10 23:48:26,899 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979064746] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:26,899 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:26,899 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:26,899 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478577832]
[2022-02-10 23:48:26,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:26,900 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:26,900 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:26,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:26,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:26,900 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-02-10 23:48:28,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:28,108 INFO  L93              Difference]: Finished difference Result 13201 states and 25966 transitions.
[2022-02-10 23:48:28,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2022-02-10 23:48:28,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-02-10 23:48:28,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:28,125 INFO  L225             Difference]: With dead ends: 13201
[2022-02-10 23:48:28,125 INFO  L226             Difference]: Without dead ends: 13201
[2022-02-10 23:48:28,126 INFO  L933         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-02-10 23:48:28,127 INFO  L934         BasicCegarLoop]: 672 mSDtfsCounter, 722 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:28,127 INFO  L935         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-02-10 23:48:28,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13201 states.
[2022-02-10 23:48:28,244 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755.
[2022-02-10 23:48:28,255 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-02-10 23:48:28,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions.
[2022-02-10 23:48:28,287 INFO  L78                 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484
[2022-02-10 23:48:28,287 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:28,287 INFO  L470      AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions.
[2022-02-10 23:48:28,287 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-02-10 23:48:28,287 INFO  L276                IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions.
[2022-02-10 23:48:28,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:28,290 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:28,290 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:28,291 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2022-02-10 23:48:28,291 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-02-10 23:48:28,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:28,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times
[2022-02-10 23:48:28,291 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:28,291 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170049475]
[2022-02-10 23:48:28,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:28,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:28,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:28,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:28,505 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:28,506 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170049475]
[2022-02-10 23:48:28,506 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170049475] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:28,506 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:28,506 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:28,506 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016279022]
[2022-02-10 23:48:28,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:28,506 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:28,506 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:28,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:28,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:28,507 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-02-10 23:48:29,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:29,978 INFO  L93              Difference]: Finished difference Result 23707 states and 46979 transitions.
[2022-02-10 23:48:29,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2022-02-10 23:48:29,979 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-02-10 23:48:29,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:30,015 INFO  L225             Difference]: With dead ends: 23707
[2022-02-10 23:48:30,015 INFO  L226             Difference]: Without dead ends: 23707
[2022-02-10 23:48:30,015 INFO  L933         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-02-10 23:48:30,016 INFO  L934         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-02-10 23:48:30,016 INFO  L935         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-02-10 23:48:30,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23707 states.
[2022-02-10 23:48:30,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962.
[2022-02-10 23:48:30,246 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-02-10 23:48:30,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions.
[2022-02-10 23:48:30,266 INFO  L78                 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484
[2022-02-10 23:48:30,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:30,266 INFO  L470      AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions.
[2022-02-10 23:48:30,266 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-02-10 23:48:30,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions.
[2022-02-10 23:48:30,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:30,269 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:30,270 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:30,270 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2022-02-10 23:48:30,270 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-02-10 23:48:30,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:30,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times
[2022-02-10 23:48:30,271 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:30,271 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832058185]
[2022-02-10 23:48:30,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:30,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:30,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:30,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:30,477 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:30,477 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832058185]
[2022-02-10 23:48:30,477 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832058185] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:30,477 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:30,477 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:30,477 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988800394]
[2022-02-10 23:48:30,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:30,478 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:30,478 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:30,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:30,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:30,478 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-02-10 23:48:32,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:32,003 INFO  L93              Difference]: Finished difference Result 23598 states and 46761 transitions.
[2022-02-10 23:48:32,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2022-02-10 23:48:32,003 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-02-10 23:48:32,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:32,036 INFO  L225             Difference]: With dead ends: 23598
[2022-02-10 23:48:32,036 INFO  L226             Difference]: Without dead ends: 23598
[2022-02-10 23:48:32,036 INFO  L933         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-02-10 23:48:32,040 INFO  L934         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-02-10 23:48:32,040 INFO  L935         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-02-10 23:48:32,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23598 states.
[2022-02-10 23:48:32,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954.
[2022-02-10 23:48:32,241 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-02-10 23:48:32,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions.
[2022-02-10 23:48:32,262 INFO  L78                 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484
[2022-02-10 23:48:32,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:32,262 INFO  L470      AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions.
[2022-02-10 23:48:32,262 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-02-10 23:48:32,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions.
[2022-02-10 23:48:32,265 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:32,265 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:32,265 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:32,265 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2022-02-10 23:48:32,265 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-02-10 23:48:32,265 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:32,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times
[2022-02-10 23:48:32,266 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:32,266 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708217658]
[2022-02-10 23:48:32,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:32,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:32,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:32,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:32,483 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:32,483 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708217658]
[2022-02-10 23:48:32,484 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708217658] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:32,484 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:32,484 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:32,484 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535489401]
[2022-02-10 23:48:32,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:32,484 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:32,484 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:32,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:32,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:32,484 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-02-10 23:48:33,815 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:33,816 INFO  L93              Difference]: Finished difference Result 24018 states and 47600 transitions.
[2022-02-10 23:48:33,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2022-02-10 23:48:33,816 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-02-10 23:48:33,816 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:33,853 INFO  L225             Difference]: With dead ends: 24018
[2022-02-10 23:48:33,853 INFO  L226             Difference]: Without dead ends: 24018
[2022-02-10 23:48:33,853 INFO  L933         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-02-10 23:48:33,853 INFO  L934         BasicCegarLoop]: 715 mSDtfsCounter, 913 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:33,853 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4241 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:48:33,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24018 states.
[2022-02-10 23:48:34,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195.
[2022-02-10 23:48:34,050 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-02-10 23:48:34,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions.
[2022-02-10 23:48:34,071 INFO  L78                 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484
[2022-02-10 23:48:34,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:34,071 INFO  L470      AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions.
[2022-02-10 23:48:34,071 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-02-10 23:48:34,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions.
[2022-02-10 23:48:34,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:34,074 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:34,074 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:34,075 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2022-02-10 23:48:34,075 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-02-10 23:48:34,075 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:34,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times
[2022-02-10 23:48:34,075 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:34,075 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6467593]
[2022-02-10 23:48:34,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:34,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:34,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:34,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:34,290 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:34,290 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6467593]
[2022-02-10 23:48:34,290 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6467593] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:34,290 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:34,290 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:34,290 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544795436]
[2022-02-10 23:48:34,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:34,290 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:34,291 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:34,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:34,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:34,291 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-02-10 23:48:34,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:34,989 INFO  L93              Difference]: Finished difference Result 13507 states and 26578 transitions.
[2022-02-10 23:48:34,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-10 23:48:34,989 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-02-10 23:48:34,990 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:35,006 INFO  L225             Difference]: With dead ends: 13507
[2022-02-10 23:48:35,007 INFO  L226             Difference]: Without dead ends: 13507
[2022-02-10 23:48:35,007 INFO  L933         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-02-10 23:48:35,010 INFO  L934         BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:35,011 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 2672 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-02-10 23:48:35,026 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13507 states.
[2022-02-10 23:48:35,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199.
[2022-02-10 23:48:35,209 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-02-10 23:48:35,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions.
[2022-02-10 23:48:35,230 INFO  L78                 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484
[2022-02-10 23:48:35,230 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:35,230 INFO  L470      AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions.
[2022-02-10 23:48:35,230 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-02-10 23:48:35,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions.
[2022-02-10 23:48:35,233 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:35,233 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:35,234 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:35,234 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2022-02-10 23:48:35,234 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-02-10 23:48:35,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:35,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times
[2022-02-10 23:48:35,235 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:35,235 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079457296]
[2022-02-10 23:48:35,235 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:35,235 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:35,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:35,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:35,458 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:35,458 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079457296]
[2022-02-10 23:48:35,458 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079457296] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:35,458 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:35,458 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:35,458 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937538751]
[2022-02-10 23:48:35,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:35,459 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:35,459 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:35,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:35,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:35,459 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-02-10 23:48:36,036 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:36,036 INFO  L93              Difference]: Finished difference Result 13561 states and 26686 transitions.
[2022-02-10 23:48:36,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:48:36,036 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-02-10 23:48:36,037 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:36,053 INFO  L225             Difference]: With dead ends: 13561
[2022-02-10 23:48:36,053 INFO  L226             Difference]: Without dead ends: 13561
[2022-02-10 23:48:36,053 INFO  L933         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-02-10 23:48:36,053 INFO  L934         BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:36,053 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2252 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:48:36,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13561 states.
[2022-02-10 23:48:36,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199.
[2022-02-10 23:48:36,196 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-02-10 23:48:36,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions.
[2022-02-10 23:48:36,221 INFO  L78                 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484
[2022-02-10 23:48:36,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:36,221 INFO  L470      AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions.
[2022-02-10 23:48:36,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-02-10 23:48:36,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions.
[2022-02-10 23:48:36,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:36,226 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:36,226 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:36,226 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2022-02-10 23:48:36,226 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-02-10 23:48:36,229 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:36,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times
[2022-02-10 23:48:36,230 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:36,230 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839935490]
[2022-02-10 23:48:36,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:36,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:36,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:36,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:36,488 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:36,488 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839935490]
[2022-02-10 23:48:36,488 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839935490] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:36,488 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:36,488 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:36,488 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430863517]
[2022-02-10 23:48:36,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:36,489 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:36,489 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:36,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:36,489 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:36,489 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-02-10 23:48:37,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:37,466 INFO  L93              Difference]: Finished difference Result 13609 states and 26782 transitions.
[2022-02-10 23:48:37,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:48:37,466 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-02-10 23:48:37,466 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:37,483 INFO  L225             Difference]: With dead ends: 13609
[2022-02-10 23:48:37,484 INFO  L226             Difference]: Without dead ends: 13609
[2022-02-10 23:48:37,484 INFO  L933         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-02-10 23:48:37,484 INFO  L934         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-02-10 23:48:37,484 INFO  L935         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-02-10 23:48:37,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13609 states.
[2022-02-10 23:48:37,608 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199.
[2022-02-10 23:48:37,624 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-02-10 23:48:37,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions.
[2022-02-10 23:48:37,645 INFO  L78                 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484
[2022-02-10 23:48:37,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:37,646 INFO  L470      AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions.
[2022-02-10 23:48:37,646 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-02-10 23:48:37,646 INFO  L276                IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions.
[2022-02-10 23:48:37,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:37,649 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:37,649 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:37,649 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2022-02-10 23:48:37,649 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-02-10 23:48:37,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:37,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times
[2022-02-10 23:48:37,650 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:37,650 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462503734]
[2022-02-10 23:48:37,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:37,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:37,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:37,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:37,905 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:37,905 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462503734]
[2022-02-10 23:48:37,905 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462503734] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:37,905 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:37,905 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:37,905 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34725665]
[2022-02-10 23:48:37,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:37,906 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:37,906 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:37,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:37,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:37,906 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-02-10 23:48:38,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:38,676 INFO  L93              Difference]: Finished difference Result 13663 states and 26890 transitions.
[2022-02-10 23:48:38,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:48:38,677 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-02-10 23:48:38,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:38,696 INFO  L225             Difference]: With dead ends: 13663
[2022-02-10 23:48:38,696 INFO  L226             Difference]: Without dead ends: 13663
[2022-02-10 23:48:38,696 INFO  L933         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-02-10 23:48:38,696 INFO  L934         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-02-10 23:48:38,696 INFO  L935         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-02-10 23:48:38,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13663 states.
[2022-02-10 23:48:38,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199.
[2022-02-10 23:48:38,840 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-02-10 23:48:38,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions.
[2022-02-10 23:48:38,864 INFO  L78                 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484
[2022-02-10 23:48:38,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:38,864 INFO  L470      AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions.
[2022-02-10 23:48:38,864 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-02-10 23:48:38,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions.
[2022-02-10 23:48:38,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:38,867 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:38,868 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:38,868 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2022-02-10 23:48:38,868 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-02-10 23:48:38,868 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:38,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times
[2022-02-10 23:48:38,868 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:38,868 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743128331]
[2022-02-10 23:48:38,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:38,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:38,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:39,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:39,140 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:39,140 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743128331]
[2022-02-10 23:48:39,140 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743128331] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:39,140 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:39,140 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:39,140 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260414949]
[2022-02-10 23:48:39,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:39,140 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:39,140 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:39,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:39,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:39,141 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-02-10 23:48:40,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:40,552 INFO  L93              Difference]: Finished difference Result 23784 states and 47132 transitions.
[2022-02-10 23:48:40,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:48:40,552 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-02-10 23:48:40,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:40,583 INFO  L225             Difference]: With dead ends: 23784
[2022-02-10 23:48:40,583 INFO  L226             Difference]: Without dead ends: 23784
[2022-02-10 23:48:40,583 INFO  L933         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-02-10 23:48:40,584 INFO  L934         BasicCegarLoop]: 841 mSDtfsCounter, 765 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:40,584 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 4807 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2022-02-10 23:48:40,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23784 states.
[2022-02-10 23:48:40,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971.
[2022-02-10 23:48:40,772 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-02-10 23:48:40,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions.
[2022-02-10 23:48:40,792 INFO  L78                 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484
[2022-02-10 23:48:40,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:40,792 INFO  L470      AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions.
[2022-02-10 23:48:40,792 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-02-10 23:48:40,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions.
[2022-02-10 23:48:40,795 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:40,795 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:40,796 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:40,796 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2022-02-10 23:48:40,796 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-02-10 23:48:40,796 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:40,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times
[2022-02-10 23:48:40,796 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:40,796 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989827761]
[2022-02-10 23:48:40,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:40,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:40,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:40,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:40,990 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:40,990 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989827761]
[2022-02-10 23:48:40,990 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989827761] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:40,990 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:40,990 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:40,990 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845354408]
[2022-02-10 23:48:40,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:40,990 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:40,990 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:40,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:40,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:40,991 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-02-10 23:48:42,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:42,099 INFO  L93              Difference]: Finished difference Result 23965 states and 47494 transitions.
[2022-02-10 23:48:42,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2022-02-10 23:48:42,099 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-02-10 23:48:42,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:42,132 INFO  L225             Difference]: With dead ends: 23965
[2022-02-10 23:48:42,132 INFO  L226             Difference]: Without dead ends: 23965
[2022-02-10 23:48:42,132 INFO  L933         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-02-10 23:48:42,133 INFO  L934         BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:42,133 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 4774 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-10 23:48:42,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23965 states.
[2022-02-10 23:48:42,311 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214.
[2022-02-10 23:48:42,322 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-02-10 23:48:42,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:48:42,343 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:48:42,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:42,343 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:48:42,343 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-02-10 23:48:42,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:48:42,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:42,347 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:42,347 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:42,347 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2022-02-10 23:48:42,347 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-02-10 23:48:42,347 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:42,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times
[2022-02-10 23:48:42,347 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:42,347 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527537569]
[2022-02-10 23:48:42,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:42,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:42,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:42,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:42,514 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:42,514 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527537569]
[2022-02-10 23:48:42,514 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527537569] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:42,514 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:42,514 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:42,514 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390789913]
[2022-02-10 23:48:42,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:42,514 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:42,514 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:42,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:42,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:42,515 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-02-10 23:48:43,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:43,761 INFO  L93              Difference]: Finished difference Result 23857 states and 47278 transitions.
[2022-02-10 23:48:43,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2022-02-10 23:48:43,761 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-02-10 23:48:43,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:43,793 INFO  L225             Difference]: With dead ends: 23857
[2022-02-10 23:48:43,793 INFO  L226             Difference]: Without dead ends: 23857
[2022-02-10 23:48:43,793 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702
[2022-02-10 23:48:43,793 INFO  L934         BasicCegarLoop]: 939 mSDtfsCounter, 816 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:43,793 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 5100 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-10 23:48:43,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23857 states.
[2022-02-10 23:48:43,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971.
[2022-02-10 23:48:43,985 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-02-10 23:48:44,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions.
[2022-02-10 23:48:44,006 INFO  L78                 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484
[2022-02-10 23:48:44,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:44,007 INFO  L470      AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions.
[2022-02-10 23:48:44,007 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-02-10 23:48:44,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions.
[2022-02-10 23:48:44,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:44,010 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:44,010 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:44,010 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2022-02-10 23:48:44,010 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-02-10 23:48:44,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:44,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times
[2022-02-10 23:48:44,011 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:44,011 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812274860]
[2022-02-10 23:48:44,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:44,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:44,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:44,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:44,242 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:44,242 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812274860]
[2022-02-10 23:48:44,242 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812274860] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:44,242 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:44,242 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:44,242 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663733343]
[2022-02-10 23:48:44,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:44,242 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:44,242 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:44,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:44,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:44,243 INFO  L87              Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand  has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-10 23:48:45,182 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:45,183 INFO  L93              Difference]: Finished difference Result 25380 states and 50259 transitions.
[2022-02-10 23:48:45,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2022-02-10 23:48:45,183 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-02-10 23:48:45,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:45,219 INFO  L225             Difference]: With dead ends: 25380
[2022-02-10 23:48:45,220 INFO  L226             Difference]: Without dead ends: 25380
[2022-02-10 23:48:45,220 INFO  L933         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-02-10 23:48:45,220 INFO  L934         BasicCegarLoop]: 918 mSDtfsCounter, 1399 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:45,220 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 4186 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2022-02-10 23:48:45,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25380 states.
[2022-02-10 23:48:45,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569.
[2022-02-10 23:48:45,423 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-02-10 23:48:45,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions.
[2022-02-10 23:48:45,446 INFO  L78                 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484
[2022-02-10 23:48:45,446 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:45,446 INFO  L470      AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions.
[2022-02-10 23:48:45,446 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-02-10 23:48:45,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions.
[2022-02-10 23:48:45,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:45,449 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:45,449 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:45,450 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2022-02-10 23:48:45,450 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-02-10 23:48:45,450 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:45,450 INFO  L85        PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times
[2022-02-10 23:48:45,450 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:45,450 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652593213]
[2022-02-10 23:48:45,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:45,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:45,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:45,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:45,688 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:45,688 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652593213]
[2022-02-10 23:48:45,689 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652593213] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:45,689 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:45,689 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:45,689 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504842050]
[2022-02-10 23:48:45,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:45,690 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:45,690 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:45,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:45,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:45,693 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-02-10 23:48:46,615 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:46,615 INFO  L93              Difference]: Finished difference Result 16297 states and 32307 transitions.
[2022-02-10 23:48:46,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:48:46,616 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-02-10 23:48:46,616 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:46,638 INFO  L225             Difference]: With dead ends: 16297
[2022-02-10 23:48:46,638 INFO  L226             Difference]: Without dead ends: 16297
[2022-02-10 23:48:46,639 INFO  L933         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-02-10 23:48:46,645 INFO  L934         BasicCegarLoop]: 613 mSDtfsCounter, 574 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:46,646 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3050 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-10 23:48:46,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16297 states.
[2022-02-10 23:48:46,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572.
[2022-02-10 23:48:46,826 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-02-10 23:48:46,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions.
[2022-02-10 23:48:46,849 INFO  L78                 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484
[2022-02-10 23:48:46,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:46,850 INFO  L470      AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions.
[2022-02-10 23:48:46,850 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-02-10 23:48:46,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions.
[2022-02-10 23:48:46,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:46,853 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:46,853 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:46,853 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2022-02-10 23:48:46,853 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-02-10 23:48:46,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:46,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times
[2022-02-10 23:48:46,854 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:46,854 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046340623]
[2022-02-10 23:48:46,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:46,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:46,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:47,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:47,066 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:47,066 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046340623]
[2022-02-10 23:48:47,066 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046340623] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:47,066 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:47,066 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:47,067 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279094991]
[2022-02-10 23:48:47,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:47,067 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:47,067 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:47,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:47,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:47,067 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-02-10 23:48:47,990 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:47,991 INFO  L93              Difference]: Finished difference Result 16351 states and 32415 transitions.
[2022-02-10 23:48:47,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:48:47,991 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-02-10 23:48:47,991 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:48,012 INFO  L225             Difference]: With dead ends: 16351
[2022-02-10 23:48:48,012 INFO  L226             Difference]: Without dead ends: 16351
[2022-02-10 23:48:48,012 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506
[2022-02-10 23:48:48,013 INFO  L934         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.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:48,013 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3454 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-10 23:48:48,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16351 states.
[2022-02-10 23:48:48,165 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571.
[2022-02-10 23:48:48,179 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-02-10 23:48:48,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions.
[2022-02-10 23:48:48,202 INFO  L78                 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484
[2022-02-10 23:48:48,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:48,203 INFO  L470      AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions.
[2022-02-10 23:48:48,203 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-02-10 23:48:48,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions.
[2022-02-10 23:48:48,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:48,206 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:48,206 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:48,206 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2022-02-10 23:48:48,206 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-02-10 23:48:48,207 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:48,207 INFO  L85        PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times
[2022-02-10 23:48:48,207 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:48,207 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221970217]
[2022-02-10 23:48:48,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:48,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:48,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:48,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:48,499 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:48,499 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221970217]
[2022-02-10 23:48:48,499 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221970217] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:48,499 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:48,499 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:48,499 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313833834]
[2022-02-10 23:48:48,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:48,500 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:48,500 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:48,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:48,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:48,500 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-02-10 23:48:49,090 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:49,090 INFO  L93              Difference]: Finished difference Result 16399 states and 32511 transitions.
[2022-02-10 23:48:49,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:48:49,091 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-02-10 23:48:49,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:49,112 INFO  L225             Difference]: With dead ends: 16399
[2022-02-10 23:48:49,112 INFO  L226             Difference]: Without dead ends: 16399
[2022-02-10 23:48:49,112 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552
[2022-02-10 23:48:49,113 INFO  L934         BasicCegarLoop]: 626 mSDtfsCounter, 616 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:49,114 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 2788 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:48:49,132 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16399 states.
[2022-02-10 23:48:49,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570.
[2022-02-10 23:48:49,275 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-02-10 23:48:49,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions.
[2022-02-10 23:48:49,297 INFO  L78                 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484
[2022-02-10 23:48:49,298 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:49,298 INFO  L470      AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions.
[2022-02-10 23:48:49,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-02-10 23:48:49,298 INFO  L276                IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions.
[2022-02-10 23:48:49,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:49,301 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:49,301 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:49,301 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2022-02-10 23:48:49,301 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-02-10 23:48:49,302 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:49,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times
[2022-02-10 23:48:49,302 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:49,302 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027744076]
[2022-02-10 23:48:49,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:49,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:49,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:49,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:49,531 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:49,531 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027744076]
[2022-02-10 23:48:49,531 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027744076] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:49,531 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:49,531 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:49,531 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365108360]
[2022-02-10 23:48:49,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:49,531 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:49,531 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:49,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:49,532 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:49,532 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-02-10 23:48:50,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:50,254 INFO  L93              Difference]: Finished difference Result 16449 states and 32611 transitions.
[2022-02-10 23:48:50,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2022-02-10 23:48:50,254 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-02-10 23:48:50,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:50,279 INFO  L225             Difference]: With dead ends: 16449
[2022-02-10 23:48:50,279 INFO  L226             Difference]: Without dead ends: 16449
[2022-02-10 23:48:50,280 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600
[2022-02-10 23:48:50,280 INFO  L934         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.6s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:50,280 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2795 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-02-10 23:48:50,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16449 states.
[2022-02-10 23:48:50,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570.
[2022-02-10 23:48:50,457 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-02-10 23:48:50,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions.
[2022-02-10 23:48:50,482 INFO  L78                 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484
[2022-02-10 23:48:50,482 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:50,482 INFO  L470      AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions.
[2022-02-10 23:48:50,482 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-02-10 23:48:50,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions.
[2022-02-10 23:48:50,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:50,486 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:50,486 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:50,486 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2022-02-10 23:48:50,486 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-02-10 23:48:50,486 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:50,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times
[2022-02-10 23:48:50,486 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:50,487 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212916150]
[2022-02-10 23:48:50,487 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:50,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:50,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:50,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:50,756 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:50,756 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212916150]
[2022-02-10 23:48:50,756 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212916150] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:50,757 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:50,757 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:50,757 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217790502]
[2022-02-10 23:48:50,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:50,757 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:50,757 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:50,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:50,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:50,757 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-02-10 23:48:52,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:52,370 INFO  L93              Difference]: Finished difference Result 16314 states and 32340 transitions.
[2022-02-10 23:48:52,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-10 23:48:52,370 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-02-10 23:48:52,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:52,394 INFO  L225             Difference]: With dead ends: 16314
[2022-02-10 23:48:52,394 INFO  L226             Difference]: Without dead ends: 16314
[2022-02-10 23:48:52,395 INFO  L933         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-02-10 23:48:52,395 INFO  L934         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.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:52,395 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 4009 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2022-02-10 23:48:52,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16314 states.
[2022-02-10 23:48:52,542 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555.
[2022-02-10 23:48:52,555 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-02-10 23:48:52,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions.
[2022-02-10 23:48:52,580 INFO  L78                 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484
[2022-02-10 23:48:52,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:52,581 INFO  L470      AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions.
[2022-02-10 23:48:52,581 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-02-10 23:48:52,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions.
[2022-02-10 23:48:52,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:52,584 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:52,584 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:52,584 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2022-02-10 23:48:52,584 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-02-10 23:48:52,585 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:52,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times
[2022-02-10 23:48:52,585 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:52,585 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691366795]
[2022-02-10 23:48:52,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:52,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:52,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:52,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:52,834 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:52,835 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691366795]
[2022-02-10 23:48:52,835 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691366795] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:52,835 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:52,835 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:52,835 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779308850]
[2022-02-10 23:48:52,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:52,835 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:52,835 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:52,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:52,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:52,835 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-02-10 23:48:54,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:54,418 INFO  L93              Difference]: Finished difference Result 16306 states and 32322 transitions.
[2022-02-10 23:48:54,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-10 23:48:54,418 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-02-10 23:48:54,419 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:54,440 INFO  L225             Difference]: With dead ends: 16306
[2022-02-10 23:48:54,440 INFO  L226             Difference]: Without dead ends: 16306
[2022-02-10 23:48:54,440 INFO  L933         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-02-10 23:48:54,440 INFO  L934         BasicCegarLoop]: 731 mSDtfsCounter, 721 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time
[2022-02-10 23:48:54,440 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 4098 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2022-02-10 23:48:54,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16306 states.
[2022-02-10 23:48:54,582 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556.
[2022-02-10 23:48:54,595 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-02-10 23:48:54,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions.
[2022-02-10 23:48:54,618 INFO  L78                 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484
[2022-02-10 23:48:54,619 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:54,619 INFO  L470      AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions.
[2022-02-10 23:48:54,619 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-02-10 23:48:54,619 INFO  L276                IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions.
[2022-02-10 23:48:54,622 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:54,622 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:54,623 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:54,623 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2022-02-10 23:48:54,623 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-02-10 23:48:54,623 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:54,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times
[2022-02-10 23:48:54,623 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:54,623 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061952686]
[2022-02-10 23:48:54,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:54,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:54,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:54,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:54,875 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:54,875 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061952686]
[2022-02-10 23:48:54,875 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061952686] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:54,875 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:54,875 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:54,875 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686487667]
[2022-02-10 23:48:54,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:54,876 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:54,876 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:54,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:54,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:54,876 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-02-10 23:48:56,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:56,671 INFO  L93              Difference]: Finished difference Result 16359 states and 32428 transitions.
[2022-02-10 23:48:56,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:48:56,671 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-02-10 23:48:56,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:56,692 INFO  L225             Difference]: With dead ends: 16359
[2022-02-10 23:48:56,693 INFO  L226             Difference]: Without dead ends: 16359
[2022-02-10 23:48:56,693 INFO  L933         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-02-10 23:48:56,698 INFO  L934         BasicCegarLoop]: 738 mSDtfsCounter, 734 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-02-10 23:48:56,698 INFO  L935         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-02-10 23:48:56,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16359 states.
[2022-02-10 23:48:56,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540.
[2022-02-10 23:48:56,853 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-02-10 23:48:56,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions.
[2022-02-10 23:48:56,877 INFO  L78                 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484
[2022-02-10 23:48:56,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:56,877 INFO  L470      AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions.
[2022-02-10 23:48:56,877 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-02-10 23:48:56,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions.
[2022-02-10 23:48:56,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:56,880 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:56,880 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:56,880 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2022-02-10 23:48:56,881 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-02-10 23:48:56,881 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:56,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times
[2022-02-10 23:48:56,881 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:56,881 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968190930]
[2022-02-10 23:48:56,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:56,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:56,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:57,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:57,104 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:57,104 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968190930]
[2022-02-10 23:48:57,104 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968190930] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:57,104 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:57,104 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:57,105 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467900489]
[2022-02-10 23:48:57,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:57,105 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:57,105 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:57,105 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:57,105 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:57,105 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-02-10 23:48:58,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:48:58,103 INFO  L93              Difference]: Finished difference Result 16300 states and 32309 transitions.
[2022-02-10 23:48:58,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-10 23:48:58,103 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-02-10 23:48:58,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:48:58,126 INFO  L225             Difference]: With dead ends: 16300
[2022-02-10 23:48:58,126 INFO  L226             Difference]: Without dead ends: 16300
[2022-02-10 23:48:58,127 INFO  L933         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-02-10 23:48:58,127 INFO  L934         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-02-10 23:48:58,127 INFO  L935         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-02-10 23:48:58,148 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16300 states.
[2022-02-10 23:48:58,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542.
[2022-02-10 23:48:58,306 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-02-10 23:48:58,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions.
[2022-02-10 23:48:58,333 INFO  L78                 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484
[2022-02-10 23:48:58,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:48:58,334 INFO  L470      AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions.
[2022-02-10 23:48:58,334 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-02-10 23:48:58,334 INFO  L276                IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions.
[2022-02-10 23:48:58,337 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:48:58,337 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:48:58,338 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:48:58,338 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2022-02-10 23:48:58,339 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-02-10 23:48:58,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:48:58,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times
[2022-02-10 23:48:58,339 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:48:58,339 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681009962]
[2022-02-10 23:48:58,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:48:58,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:48:58,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:48:58,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:48:58,696 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:48:58,696 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681009962]
[2022-02-10 23:48:58,696 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681009962] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:48:58,697 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:48:58,697 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:48:58,697 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417629775]
[2022-02-10 23:48:58,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:48:58,697 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:48:58,697 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:48:58,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:48:58,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:48:58,698 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-02-10 23:49:00,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:00,109 INFO  L93              Difference]: Finished difference Result 16358 states and 32425 transitions.
[2022-02-10 23:49:00,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:49:00,109 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-02-10 23:49:00,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:00,132 INFO  L225             Difference]: With dead ends: 16358
[2022-02-10 23:49:00,133 INFO  L226             Difference]: Without dead ends: 16358
[2022-02-10 23:49:00,133 INFO  L933         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-02-10 23:49:00,133 INFO  L934         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-02-10 23:49:00,133 INFO  L935         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-02-10 23:49:00,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16358 states.
[2022-02-10 23:49:00,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541.
[2022-02-10 23:49:00,304 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-02-10 23:49:00,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions.
[2022-02-10 23:49:00,327 INFO  L78                 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484
[2022-02-10 23:49:00,328 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:00,328 INFO  L470      AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions.
[2022-02-10 23:49:00,328 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-02-10 23:49:00,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions.
[2022-02-10 23:49:00,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:00,331 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:00,332 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:00,332 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2022-02-10 23:49:00,332 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-02-10 23:49:00,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:00,332 INFO  L85        PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times
[2022-02-10 23:49:00,332 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:00,332 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640281420]
[2022-02-10 23:49:00,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:00,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:00,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:00,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:00,569 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:00,569 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640281420]
[2022-02-10 23:49:00,569 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640281420] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:00,569 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:00,569 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:00,569 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287790851]
[2022-02-10 23:49:00,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:00,570 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:00,570 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:00,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:00,570 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:00,570 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-02-10 23:49:02,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:02,190 INFO  L93              Difference]: Finished difference Result 16443 states and 32595 transitions.
[2022-02-10 23:49:02,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:49:02,190 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-02-10 23:49:02,190 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:02,212 INFO  L225             Difference]: With dead ends: 16443
[2022-02-10 23:49:02,212 INFO  L226             Difference]: Without dead ends: 16443
[2022-02-10 23:49:02,212 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420
[2022-02-10 23:49:02,213 INFO  L934         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-02-10 23:49:02,213 INFO  L935         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-02-10 23:49:02,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16443 states.
[2022-02-10 23:49:02,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214.
[2022-02-10 23:49:02,374 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-02-10 23:49:02,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:02,396 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:02,396 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:02,396 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:02,397 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-02-10 23:49:02,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:02,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:02,400 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:02,400 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:02,400 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2022-02-10 23:49:02,400 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-02-10 23:49:02,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:02,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times
[2022-02-10 23:49:02,401 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:02,401 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605276742]
[2022-02-10 23:49:02,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:02,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:02,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:02,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:02,617 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:02,617 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605276742]
[2022-02-10 23:49:02,617 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605276742] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:02,617 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:02,617 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:02,617 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695778005]
[2022-02-10 23:49:02,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:02,617 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:02,617 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:02,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:02,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:02,618 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-02-10 23:49:03,861 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:03,861 INFO  L93              Difference]: Finished difference Result 14947 states and 29393 transitions.
[2022-02-10 23:49:03,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-10 23:49:03,862 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-02-10 23:49:03,862 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:03,887 INFO  L225             Difference]: With dead ends: 14947
[2022-02-10 23:49:03,887 INFO  L226             Difference]: Without dead ends: 14947
[2022-02-10 23:49:03,887 INFO  L933         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-02-10 23:49:03,888 INFO  L934         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-02-10 23:49:03,888 INFO  L935         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-02-10 23:49:03,915 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14947 states.
[2022-02-10 23:49:04,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217.
[2022-02-10 23:49:04,058 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-02-10 23:49:04,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions.
[2022-02-10 23:49:04,081 INFO  L78                 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484
[2022-02-10 23:49:04,081 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:04,081 INFO  L470      AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions.
[2022-02-10 23:49:04,081 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-02-10 23:49:04,081 INFO  L276                IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions.
[2022-02-10 23:49:04,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:04,084 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:04,085 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:04,085 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2022-02-10 23:49:04,085 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-02-10 23:49:04,085 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:04,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times
[2022-02-10 23:49:04,085 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:04,085 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727280868]
[2022-02-10 23:49:04,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:04,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:04,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:04,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:04,409 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:04,409 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727280868]
[2022-02-10 23:49:04,409 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727280868] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:04,409 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:04,409 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:04,409 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544574060]
[2022-02-10 23:49:04,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:04,410 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:04,410 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:04,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:04,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:04,410 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-02-10 23:49:05,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:05,379 INFO  L93              Difference]: Finished difference Result 15001 states and 29501 transitions.
[2022-02-10 23:49:05,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:49:05,380 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484
[2022-02-10 23:49:05,380 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:05,399 INFO  L225             Difference]: With dead ends: 15001
[2022-02-10 23:49:05,399 INFO  L226             Difference]: Without dead ends: 15001
[2022-02-10 23:49:05,400 INFO  L933         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-02-10 23:49:05,400 INFO  L934         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.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:05,400 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2837 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2022-02-10 23:49:05,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15001 states.
[2022-02-10 23:49:05,551 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216.
[2022-02-10 23:49:05,563 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-02-10 23:49:05,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions.
[2022-02-10 23:49:05,585 INFO  L78                 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484
[2022-02-10 23:49:05,585 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:05,585 INFO  L470      AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions.
[2022-02-10 23:49:05,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-02-10 23:49:05,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions.
[2022-02-10 23:49:05,588 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:05,588 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:05,589 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:05,589 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2022-02-10 23:49:05,589 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-02-10 23:49:05,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:05,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times
[2022-02-10 23:49:05,589 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:05,589 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111681757]
[2022-02-10 23:49:05,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:05,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:05,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:05,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:05,854 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:05,855 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111681757]
[2022-02-10 23:49:05,855 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111681757] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:05,855 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:05,855 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:05,855 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134776581]
[2022-02-10 23:49:05,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:05,855 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:05,855 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:05,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:05,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:05,856 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-02-10 23:49:06,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:06,913 INFO  L93              Difference]: Finished difference Result 15052 states and 29603 transitions.
[2022-02-10 23:49:06,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:49:06,913 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-02-10 23:49:06,913 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:06,934 INFO  L225             Difference]: With dead ends: 15052
[2022-02-10 23:49:06,934 INFO  L226             Difference]: Without dead ends: 15052
[2022-02-10 23:49:06,934 INFO  L933         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-02-10 23:49:06,934 INFO  L934         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.9s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:06,934 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 2695 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2022-02-10 23:49:06,952 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15052 states.
[2022-02-10 23:49:07,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215.
[2022-02-10 23:49:07,093 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-02-10 23:49:07,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions.
[2022-02-10 23:49:07,116 INFO  L78                 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484
[2022-02-10 23:49:07,116 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:07,116 INFO  L470      AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions.
[2022-02-10 23:49:07,116 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-10 23:49:07,116 INFO  L276                IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions.
[2022-02-10 23:49:07,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:07,120 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:07,120 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:07,120 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2022-02-10 23:49:07,121 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-02-10 23:49:07,121 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:07,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times
[2022-02-10 23:49:07,121 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:07,121 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823486644]
[2022-02-10 23:49:07,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:07,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:07,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:07,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:07,364 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:07,364 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823486644]
[2022-02-10 23:49:07,364 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823486644] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:07,364 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:07,364 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:07,364 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999944616]
[2022-02-10 23:49:07,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:07,365 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:07,365 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:07,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:07,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:07,365 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-02-10 23:49:08,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:08,722 INFO  L93              Difference]: Finished difference Result 15095 states and 29689 transitions.
[2022-02-10 23:49:08,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:49:08,723 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-02-10 23:49:08,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:08,743 INFO  L225             Difference]: With dead ends: 15095
[2022-02-10 23:49:08,743 INFO  L226             Difference]: Without dead ends: 15095
[2022-02-10 23:49:08,743 INFO  L933         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-02-10 23:49:08,744 INFO  L934         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-02-10 23:49:08,744 INFO  L935         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-02-10 23:49:08,761 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15095 states.
[2022-02-10 23:49:08,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214.
[2022-02-10 23:49:08,901 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-02-10 23:49:08,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:08,923 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:08,923 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:08,923 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:08,923 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-10 23:49:08,924 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:08,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:08,927 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:08,927 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:08,927 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2022-02-10 23:49:08,927 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-02-10 23:49:08,927 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:08,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times
[2022-02-10 23:49:08,928 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:08,928 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889883938]
[2022-02-10 23:49:08,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:08,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:09,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:09,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:09,141 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:09,141 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889883938]
[2022-02-10 23:49:09,141 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889883938] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:09,141 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:09,141 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:09,142 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376081625]
[2022-02-10 23:49:09,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:09,142 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:09,142 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:09,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:09,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:09,142 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-02-10 23:49:10,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:10,806 INFO  L93              Difference]: Finished difference Result 25238 states and 49975 transitions.
[2022-02-10 23:49:10,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2022-02-10 23:49:10,807 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-02-10 23:49:10,807 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:10,846 INFO  L225             Difference]: With dead ends: 25238
[2022-02-10 23:49:10,846 INFO  L226             Difference]: Without dead ends: 25238
[2022-02-10 23:49:10,847 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406
[2022-02-10 23:49:10,847 INFO  L934         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-02-10 23:49:10,847 INFO  L935         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-02-10 23:49:10,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25238 states.
[2022-02-10 23:49:11,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987.
[2022-02-10 23:49:11,067 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-02-10 23:49:11,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions.
[2022-02-10 23:49:11,093 INFO  L78                 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484
[2022-02-10 23:49:11,093 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:11,093 INFO  L470      AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions.
[2022-02-10 23:49:11,093 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-02-10 23:49:11,093 INFO  L276                IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions.
[2022-02-10 23:49:11,096 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:11,096 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:11,097 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:11,097 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2022-02-10 23:49:11,097 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-02-10 23:49:11,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:11,098 INFO  L85        PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times
[2022-02-10 23:49:11,098 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:11,098 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758363547]
[2022-02-10 23:49:11,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:11,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:11,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:11,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:11,376 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:11,376 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758363547]
[2022-02-10 23:49:11,376 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758363547] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:11,376 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:11,376 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:11,376 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306691228]
[2022-02-10 23:49:11,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:11,377 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:11,377 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:11,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:11,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:11,377 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-02-10 23:49:12,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:12,570 INFO  L93              Difference]: Finished difference Result 24029 states and 47620 transitions.
[2022-02-10 23:49:12,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2022-02-10 23:49:12,570 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-02-10 23:49:12,571 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:12,605 INFO  L225             Difference]: With dead ends: 24029
[2022-02-10 23:49:12,605 INFO  L226             Difference]: Without dead ends: 24029
[2022-02-10 23:49:12,606 INFO  L933         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-02-10 23:49:12,606 INFO  L934         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-02-10 23:49:12,606 INFO  L935         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-02-10 23:49:12,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24029 states.
[2022-02-10 23:49:12,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215.
[2022-02-10 23:49:12,818 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-02-10 23:49:12,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions.
[2022-02-10 23:49:12,840 INFO  L78                 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484
[2022-02-10 23:49:12,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:12,840 INFO  L470      AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions.
[2022-02-10 23:49:12,840 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-02-10 23:49:12,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions.
[2022-02-10 23:49:12,844 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:12,844 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:12,844 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:12,844 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2022-02-10 23:49:12,844 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-02-10 23:49:12,844 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:12,844 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times
[2022-02-10 23:49:12,844 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:12,845 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009805045]
[2022-02-10 23:49:12,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:12,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:12,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:13,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:13,093 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:13,093 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009805045]
[2022-02-10 23:49:13,093 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009805045] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:13,093 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:13,094 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:13,094 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874181992]
[2022-02-10 23:49:13,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:13,094 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:13,094 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:13,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:13,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:13,094 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-02-10 23:49:13,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:13,836 INFO  L93              Difference]: Finished difference Result 13519 states and 26600 transitions.
[2022-02-10 23:49:13,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-10 23:49:13,837 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-02-10 23:49:13,837 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:13,856 INFO  L225             Difference]: With dead ends: 13519
[2022-02-10 23:49:13,856 INFO  L226             Difference]: Without dead ends: 13519
[2022-02-10 23:49:13,856 INFO  L933         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-02-10 23:49:13,857 INFO  L934         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-02-10 23:49:13,857 INFO  L935         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-02-10 23:49:13,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13519 states.
[2022-02-10 23:49:13,991 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214.
[2022-02-10 23:49:14,003 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-02-10 23:49:14,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:14,027 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:14,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:14,027 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:14,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-02-10 23:49:14,027 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:14,030 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:14,031 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:14,031 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:14,031 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2022-02-10 23:49:14,031 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-02-10 23:49:14,031 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:14,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times
[2022-02-10 23:49:14,031 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:14,031 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276375828]
[2022-02-10 23:49:14,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:14,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:14,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:14,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-02-10 23:49:14,277 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:14,277 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276375828]
[2022-02-10 23:49:14,277 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276375828] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:14,277 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:14,277 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:14,277 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626052704]
[2022-02-10 23:49:14,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:14,277 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:14,277 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:14,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:14,278 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:14,278 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-02-10 23:49:14,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:14,953 INFO  L93              Difference]: Finished difference Result 13573 states and 26708 transitions.
[2022-02-10 23:49:14,953 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-10 23:49:14,954 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-02-10 23:49:14,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:14,970 INFO  L225             Difference]: With dead ends: 13573
[2022-02-10 23:49:14,971 INFO  L226             Difference]: Without dead ends: 13573
[2022-02-10 23:49:14,971 INFO  L933         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-02-10 23:49:14,971 INFO  L934         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.6s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:14,971 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 2444 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-02-10 23:49:14,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13573 states.
[2022-02-10 23:49:15,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214.
[2022-02-10 23:49:15,124 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-02-10 23:49:15,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:15,146 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:15,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:15,146 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:15,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-02-10 23:49:15,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:15,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:15,150 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:15,150 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:15,150 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2022-02-10 23:49:15,150 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-02-10 23:49:15,155 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:15,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times
[2022-02-10 23:49:15,156 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:15,156 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334855187]
[2022-02-10 23:49:15,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:15,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:15,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:15,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:15,403 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:15,403 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334855187]
[2022-02-10 23:49:15,403 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334855187] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:15,403 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:15,403 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:15,403 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442458907]
[2022-02-10 23:49:15,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:15,404 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:15,404 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:15,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:15,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:15,404 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-02-10 23:49:16,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:16,486 INFO  L93              Difference]: Finished difference Result 13621 states and 26804 transitions.
[2022-02-10 23:49:16,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-10 23:49:16,486 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-02-10 23:49:16,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:16,505 INFO  L225             Difference]: With dead ends: 13621
[2022-02-10 23:49:16,506 INFO  L226             Difference]: Without dead ends: 13621
[2022-02-10 23:49:16,506 INFO  L933         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-02-10 23:49:16,506 INFO  L934         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, 1.0s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:16,506 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3333 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-02-10 23:49:16,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13621 states.
[2022-02-10 23:49:16,650 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214.
[2022-02-10 23:49:16,663 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-02-10 23:49:16,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:16,686 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:16,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:16,686 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:16,686 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-02-10 23:49:16,686 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:16,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:16,690 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:16,690 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:16,690 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2022-02-10 23:49:16,690 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-02-10 23:49:16,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:16,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times
[2022-02-10 23:49:16,690 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:16,690 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53207342]
[2022-02-10 23:49:16,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:16,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:16,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:16,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-02-10 23:49:16,928 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:16,928 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53207342]
[2022-02-10 23:49:16,928 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53207342] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:16,928 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:16,929 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:16,929 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012709556]
[2022-02-10 23:49:16,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:16,929 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:16,929 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:16,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:16,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:16,929 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-02-10 23:49:17,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:17,678 INFO  L93              Difference]: Finished difference Result 13675 states and 26912 transitions.
[2022-02-10 23:49:17,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-02-10 23:49:17,679 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-02-10 23:49:17,679 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:17,697 INFO  L225             Difference]: With dead ends: 13675
[2022-02-10 23:49:17,698 INFO  L226             Difference]: Without dead ends: 13675
[2022-02-10 23:49:17,698 INFO  L933         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-02-10 23:49:17,698 INFO  L934         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-02-10 23:49:17,698 INFO  L935         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-02-10 23:49:17,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13675 states.
[2022-02-10 23:49:17,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214.
[2022-02-10 23:49:17,844 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-02-10 23:49:17,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions.
[2022-02-10 23:49:17,868 INFO  L78                 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484
[2022-02-10 23:49:17,868 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:17,868 INFO  L470      AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions.
[2022-02-10 23:49:17,868 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-02-10 23:49:17,868 INFO  L276                IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions.
[2022-02-10 23:49:17,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:17,871 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:17,872 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:17,872 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2022-02-10 23:49:17,872 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-02-10 23:49:17,872 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:17,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times
[2022-02-10 23:49:17,872 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:17,872 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869966456]
[2022-02-10 23:49:17,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:17,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:17,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:18,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:18,071 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:18,071 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869966456]
[2022-02-10 23:49:18,072 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869966456] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:18,072 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:18,072 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:18,072 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693266267]
[2022-02-10 23:49:18,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:18,072 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:18,072 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:18,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:18,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:18,072 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-02-10 23:49:19,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:19,449 INFO  L93              Difference]: Finished difference Result 23827 states and 47216 transitions.
[2022-02-10 23:49:19,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2022-02-10 23:49:19,450 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-02-10 23:49:19,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:19,491 INFO  L225             Difference]: With dead ends: 23827
[2022-02-10 23:49:19,491 INFO  L226             Difference]: Without dead ends: 23827
[2022-02-10 23:49:19,491 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702
[2022-02-10 23:49:19,492 INFO  L934         BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:19,492 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 5442 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2022-02-10 23:49:19,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23827 states.
[2022-02-10 23:49:19,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971.
[2022-02-10 23:49:19,751 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-02-10 23:49:19,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions.
[2022-02-10 23:49:19,772 INFO  L78                 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484
[2022-02-10 23:49:19,772 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:19,773 INFO  L470      AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions.
[2022-02-10 23:49:19,773 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-02-10 23:49:19,773 INFO  L276                IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions.
[2022-02-10 23:49:19,776 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:19,776 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:19,776 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:19,776 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2022-02-10 23:49:19,776 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-02-10 23:49:19,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:19,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times
[2022-02-10 23:49:19,777 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:19,777 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030530840]
[2022-02-10 23:49:19,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:19,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:19,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:19,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:19,987 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:19,987 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030530840]
[2022-02-10 23:49:19,987 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030530840] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:19,987 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:19,987 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:19,987 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896100036]
[2022-02-10 23:49:19,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:19,987 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:19,987 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:19,988 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:19,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:19,988 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-02-10 23:49:21,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:21,240 INFO  L93              Difference]: Finished difference Result 23624 states and 46810 transitions.
[2022-02-10 23:49:21,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2022-02-10 23:49:21,240 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-02-10 23:49:21,240 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:21,279 INFO  L225             Difference]: With dead ends: 23624
[2022-02-10 23:49:21,279 INFO  L226             Difference]: Without dead ends: 23624
[2022-02-10 23:49:21,280 INFO  L933         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-02-10 23:49:21,282 INFO  L934         BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:21,282 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 4411 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:49:21,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23624 states.
[2022-02-10 23:49:21,481 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875.
[2022-02-10 23:49:21,492 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-02-10 23:49:21,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions.
[2022-02-10 23:49:21,516 INFO  L78                 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484
[2022-02-10 23:49:21,516 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:21,516 INFO  L470      AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions.
[2022-02-10 23:49:21,517 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-02-10 23:49:21,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions.
[2022-02-10 23:49:21,520 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2022-02-10 23:49:21,520 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:21,521 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:21,521 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2022-02-10 23:49:21,521 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-02-10 23:49:21,521 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:21,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times
[2022-02-10 23:49:21,521 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:21,521 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028502847]
[2022-02-10 23:49:21,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:21,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:21,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:21,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:21,728 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:21,728 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028502847]
[2022-02-10 23:49:21,728 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028502847] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:21,728 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:21,728 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-10 23:49:21,729 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288387090]
[2022-02-10 23:49:21,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:21,729 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:49:21,729 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:21,730 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:49:21,730 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2022-02-10 23:49:21,730 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-02-10 23:49:23,141 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:23,141 INFO  L93              Difference]: Finished difference Result 23548 states and 46658 transitions.
[2022-02-10 23:49:23,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2022-02-10 23:49:23,142 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-02-10 23:49:23,142 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:23,179 INFO  L225             Difference]: With dead ends: 23548
[2022-02-10 23:49:23,179 INFO  L226             Difference]: Without dead ends: 23548
[2022-02-10 23:49:23,180 INFO  L933         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-02-10 23:49:23,180 INFO  L934         BasicCegarLoop]: 960 mSDtfsCounter, 776 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:23,180 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5079 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2022-02-10 23:49:23,209 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23548 states.
[2022-02-10 23:49:23,378 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618.
[2022-02-10 23:49:23,390 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-02-10 23:49:23,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions.
[2022-02-10 23:49:23,412 INFO  L78                 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484
[2022-02-10 23:49:23,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:23,412 INFO  L470      AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions.
[2022-02-10 23:49:23,412 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-02-10 23:49:23,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions.
[2022-02-10 23:49:23,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2022-02-10 23:49:23,415 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:23,416 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:23,416 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2022-02-10 23:49:23,416 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-02-10 23:49:23,416 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:23,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times
[2022-02-10 23:49:23,416 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:23,416 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081311096]
[2022-02-10 23:49:23,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:23,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:23,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:23,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:23,586 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:23,586 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081311096]
[2022-02-10 23:49:23,586 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081311096] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:23,586 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:23,586 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:23,586 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965515142]
[2022-02-10 23:49:23,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:23,586 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:23,587 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:23,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:23,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:23,587 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-02-10 23:49:23,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:23,939 INFO  L93              Difference]: Finished difference Result 13358 states and 26280 transitions.
[2022-02-10 23:49:23,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:23,939 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-02-10 23:49:23,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:23,957 INFO  L225             Difference]: With dead ends: 13358
[2022-02-10 23:49:23,957 INFO  L226             Difference]: Without dead ends: 13358
[2022-02-10 23:49:23,957 INFO  L933         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-02-10 23:49:23,957 INFO  L934         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-02-10 23:49:23,957 INFO  L935         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-02-10 23:49:23,974 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13358 states.
[2022-02-10 23:49:24,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928.
[2022-02-10 23:49:24,097 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-02-10 23:49:24,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions.
[2022-02-10 23:49:24,204 INFO  L78                 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488
[2022-02-10 23:49:24,204 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:24,204 INFO  L470      AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions.
[2022-02-10 23:49:24,205 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-02-10 23:49:24,205 INFO  L276                IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions.
[2022-02-10 23:49:24,207 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2022-02-10 23:49:24,207 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:24,208 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:24,208 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86
[2022-02-10 23:49:24,208 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-02-10 23:49:24,208 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:24,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times
[2022-02-10 23:49:24,209 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:24,209 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006002047]
[2022-02-10 23:49:24,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:24,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:24,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:24,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-02-10 23:49:24,371 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:24,371 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006002047]
[2022-02-10 23:49:24,371 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006002047] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:24,371 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:24,371 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:24,371 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655311884]
[2022-02-10 23:49:24,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:24,372 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:24,372 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:24,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:24,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:24,372 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-02-10 23:49:24,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:24,893 INFO  L93              Difference]: Finished difference Result 13909 states and 27382 transitions.
[2022-02-10 23:49:24,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:24,893 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-02-10 23:49:24,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:24,914 INFO  L225             Difference]: With dead ends: 13909
[2022-02-10 23:49:24,915 INFO  L226             Difference]: Without dead ends: 13909
[2022-02-10 23:49:24,915 INFO  L933         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-02-10 23:49:24,915 INFO  L934         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-02-10 23:49:24,915 INFO  L935         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-02-10 23:49:24,933 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13909 states.
[2022-02-10 23:49:25,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339.
[2022-02-10 23:49:25,063 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-02-10 23:49:25,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions.
[2022-02-10 23:49:25,085 INFO  L78                 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488
[2022-02-10 23:49:25,086 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:25,086 INFO  L470      AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions.
[2022-02-10 23:49:25,086 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-02-10 23:49:25,086 INFO  L276                IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions.
[2022-02-10 23:49:25,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 495
[2022-02-10 23:49:25,090 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:25,090 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:25,090 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87
[2022-02-10 23:49:25,091 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-02-10 23:49:25,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:25,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times
[2022-02-10 23:49:25,091 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:25,091 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916652272]
[2022-02-10 23:49:25,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:25,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:25,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:26,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1294 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked.
[2022-02-10 23:49:26,103 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:26,103 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916652272]
[2022-02-10 23:49:26,103 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916652272] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:49:26,104 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107355744]
[2022-02-10 23:49:26,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:26,104 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:49:26,104 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:49:26,106 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-02-10 23:49:26,106 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-02-10 23:49:28,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:28,212 INFO  L263         TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-02-10 23:49:28,218 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:49:28,903 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-02-10 23:49:28,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:28,998 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:49:28,998 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107355744] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:28,999 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:49:28,999 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24
[2022-02-10 23:49:28,999 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110926460]
[2022-02-10 23:49:28,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:28,999 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-10 23:49:28,999 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:28,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-10 23:49:29,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552
[2022-02-10 23:49:29,000 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-02-10 23:49:29,093 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:29,093 INFO  L93              Difference]: Finished difference Result 23576 states and 46647 transitions.
[2022-02-10 23:49:29,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-02-10 23:49:29,094 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-02-10 23:49:29,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:29,129 INFO  L225             Difference]: With dead ends: 23576
[2022-02-10 23:49:29,129 INFO  L226             Difference]: Without dead ends: 23576
[2022-02-10 23:49:29,130 INFO  L933         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-02-10 23:49:29,130 INFO  L934         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-02-10 23:49:29,130 INFO  L935         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-02-10 23:49:29,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23576 states.
[2022-02-10 23:49:29,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23576 to 13477.
[2022-02-10 23:49:29,351 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-02-10 23:49:29,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 26449 transitions.
[2022-02-10 23:49:29,377 INFO  L78                 Accepts]: Start accepts. Automaton has 13477 states and 26449 transitions. Word has length 494
[2022-02-10 23:49:29,377 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:29,377 INFO  L470      AbstractCegarLoop]: Abstraction has 13477 states and 26449 transitions.
[2022-02-10 23:49:29,377 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-02-10 23:49:29,377 INFO  L276                IsEmpty]: Start isEmpty. Operand 13477 states and 26449 transitions.
[2022-02-10 23:49:29,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 495
[2022-02-10 23:49:29,381 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:29,381 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:29,409 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2022-02-10 23:49:29,586 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-02-10 23:49:29,587 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-02-10 23:49:29,587 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:29,588 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times
[2022-02-10 23:49:29,588 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:29,588 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772871857]
[2022-02-10 23:49:29,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:29,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:29,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:30,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1342 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked.
[2022-02-10 23:49:30,570 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:30,570 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772871857]
[2022-02-10 23:49:30,570 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772871857] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:49:30,570 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389806679]
[2022-02-10 23:49:30,570 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-10 23:49:30,570 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:49:30,570 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:49:30,571 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-02-10 23:49:30,572 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-02-10 23:49:32,773 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-02-10 23:49:32,773 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:49:32,775 INFO  L263         TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-02-10 23:49:32,780 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:49:33,437 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-02-10 23:49:33,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:33,499 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:49:33,499 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [389806679] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:33,499 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:49:33,499 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25
[2022-02-10 23:49:33,499 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18912441]
[2022-02-10 23:49:33,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:33,500 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-10 23:49:33,500 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:33,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-10 23:49:33,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600
[2022-02-10 23:49:33,500 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-02-10 23:49:33,638 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:33,639 INFO  L93              Difference]: Finished difference Result 24853 states and 49037 transitions.
[2022-02-10 23:49:33,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:33,639 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-02-10 23:49:33,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:33,677 INFO  L225             Difference]: With dead ends: 24853
[2022-02-10 23:49:33,678 INFO  L226             Difference]: Without dead ends: 24853
[2022-02-10 23:49:33,678 INFO  L933         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-02-10 23:49:33,678 INFO  L934         BasicCegarLoop]: 337 mSDtfsCounter, 694 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-10 23:49:33,678 INFO  L935         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-02-10 23:49:33,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24853 states.
[2022-02-10 23:49:33,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24853 to 14168.
[2022-02-10 23:49:33,888 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-02-10 23:49:33,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14168 states to 14168 states and 27832 transitions.
[2022-02-10 23:49:33,910 INFO  L78                 Accepts]: Start accepts. Automaton has 14168 states and 27832 transitions. Word has length 494
[2022-02-10 23:49:33,910 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:33,910 INFO  L470      AbstractCegarLoop]: Abstraction has 14168 states and 27832 transitions.
[2022-02-10 23:49:33,911 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-02-10 23:49:33,911 INFO  L276                IsEmpty]: Start isEmpty. Operand 14168 states and 27832 transitions.
[2022-02-10 23:49:33,913 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 498
[2022-02-10 23:49:33,913 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:33,913 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:33,940 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-02-10 23:49:34,126 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-02-10 23:49:34,126 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-02-10 23:49:34,126 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:34,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times
[2022-02-10 23:49:34,127 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:34,127 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680217101]
[2022-02-10 23:49:34,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:34,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:34,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:34,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:34,361 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:34,361 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680217101]
[2022-02-10 23:49:34,361 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680217101] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:34,361 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:34,361 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:34,361 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030201231]
[2022-02-10 23:49:34,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:34,361 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:34,361 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:34,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:34,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:34,362 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-02-10 23:49:34,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:34,736 INFO  L93              Difference]: Finished difference Result 14570 states and 28636 transitions.
[2022-02-10 23:49:34,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:34,737 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-02-10 23:49:34,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:34,756 INFO  L225             Difference]: With dead ends: 14570
[2022-02-10 23:49:34,756 INFO  L226             Difference]: Without dead ends: 14570
[2022-02-10 23:49:34,756 INFO  L933         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-02-10 23:49:34,756 INFO  L934         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.3s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:34,756 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 908 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-10 23:49:34,773 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14570 states.
[2022-02-10 23:49:34,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 14477.
[2022-02-10 23:49:34,904 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-02-10 23:49:34,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14477 states to 14477 states and 28450 transitions.
[2022-02-10 23:49:34,927 INFO  L78                 Accepts]: Start accepts. Automaton has 14477 states and 28450 transitions. Word has length 497
[2022-02-10 23:49:34,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:34,928 INFO  L470      AbstractCegarLoop]: Abstraction has 14477 states and 28450 transitions.
[2022-02-10 23:49:34,928 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-02-10 23:49:34,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 14477 states and 28450 transitions.
[2022-02-10 23:49:34,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 498
[2022-02-10 23:49:34,930 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:34,931 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:34,931 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90
[2022-02-10 23:49:34,931 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-02-10 23:49:34,931 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:34,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times
[2022-02-10 23:49:34,931 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:34,931 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008134545]
[2022-02-10 23:49:34,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:34,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:35,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:35,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:35,119 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:35,119 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008134545]
[2022-02-10 23:49:35,119 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008134545] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:35,119 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:35,119 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:35,119 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992976080]
[2022-02-10 23:49:35,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:35,120 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:35,120 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:35,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:35,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:35,120 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-02-10 23:49:35,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:35,734 INFO  L93              Difference]: Finished difference Result 15039 states and 29575 transitions.
[2022-02-10 23:49:35,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:35,735 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-02-10 23:49:35,735 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:35,754 INFO  L225             Difference]: With dead ends: 15039
[2022-02-10 23:49:35,755 INFO  L226             Difference]: Without dead ends: 15039
[2022-02-10 23:49:35,755 INFO  L933         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-02-10 23:49:35,755 INFO  L934         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-02-10 23:49:35,755 INFO  L935         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-02-10 23:49:35,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15039 states.
[2022-02-10 23:49:36,006 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15039 to 14910.
[2022-02-10 23:49:36,022 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-02-10 23:49:36,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 29317 transitions.
[2022-02-10 23:49:36,048 INFO  L78                 Accepts]: Start accepts. Automaton has 14910 states and 29317 transitions. Word has length 497
[2022-02-10 23:49:36,049 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:36,049 INFO  L470      AbstractCegarLoop]: Abstraction has 14910 states and 29317 transitions.
[2022-02-10 23:49:36,049 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-02-10 23:49:36,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 14910 states and 29317 transitions.
[2022-02-10 23:49:36,051 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 506
[2022-02-10 23:49:36,052 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:36,052 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:36,052 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91
[2022-02-10 23:49:36,052 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-02-10 23:49:36,053 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:36,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times
[2022-02-10 23:49:36,053 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:36,053 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617427332]
[2022-02-10 23:49:36,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:36,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:36,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:36,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:36,275 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:36,275 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617427332]
[2022-02-10 23:49:36,275 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617427332] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:36,275 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:36,275 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:36,275 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253690237]
[2022-02-10 23:49:36,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:36,276 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:36,276 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:36,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:36,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:36,276 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-02-10 23:49:36,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:36,776 INFO  L93              Difference]: Finished difference Result 15314 states and 30125 transitions.
[2022-02-10 23:49:36,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:36,776 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-02-10 23:49:36,777 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:36,802 INFO  L225             Difference]: With dead ends: 15314
[2022-02-10 23:49:36,802 INFO  L226             Difference]: Without dead ends: 15314
[2022-02-10 23:49:36,802 INFO  L933         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-02-10 23:49:36,803 INFO  L934         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-02-10 23:49:36,803 INFO  L935         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-02-10 23:49:36,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15314 states.
[2022-02-10 23:49:36,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15218.
[2022-02-10 23:49:36,977 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-02-10 23:49:37,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 29933 transitions.
[2022-02-10 23:49:37,004 INFO  L78                 Accepts]: Start accepts. Automaton has 15218 states and 29933 transitions. Word has length 505
[2022-02-10 23:49:37,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:37,004 INFO  L470      AbstractCegarLoop]: Abstraction has 15218 states and 29933 transitions.
[2022-02-10 23:49:37,004 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-02-10 23:49:37,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 15218 states and 29933 transitions.
[2022-02-10 23:49:37,007 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 506
[2022-02-10 23:49:37,007 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:37,007 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:37,007 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92
[2022-02-10 23:49:37,007 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-02-10 23:49:37,008 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:37,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times
[2022-02-10 23:49:37,008 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:37,008 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000326967]
[2022-02-10 23:49:37,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:37,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:37,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:37,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:37,194 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:37,194 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000326967]
[2022-02-10 23:49:37,194 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000326967] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:37,194 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:37,194 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:37,194 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227888932]
[2022-02-10 23:49:37,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:37,194 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:37,194 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:37,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:37,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:37,195 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-02-10 23:49:37,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:37,624 INFO  L93              Difference]: Finished difference Result 15782 states and 31062 transitions.
[2022-02-10 23:49:37,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:37,625 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-02-10 23:49:37,625 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:37,652 INFO  L225             Difference]: With dead ends: 15782
[2022-02-10 23:49:37,653 INFO  L226             Difference]: Without dead ends: 15250
[2022-02-10 23:49:37,653 INFO  L933         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-02-10 23:49:37,653 INFO  L934         BasicCegarLoop]: 502 mSDtfsCounter, 315 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:37,653 INFO  L935         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-02-10 23:49:37,671 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15250 states.
[2022-02-10 23:49:37,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15250 to 15125.
[2022-02-10 23:49:37,837 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-02-10 23:49:37,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 29706 transitions.
[2022-02-10 23:49:37,863 INFO  L78                 Accepts]: Start accepts. Automaton has 15125 states and 29706 transitions. Word has length 505
[2022-02-10 23:49:37,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:37,863 INFO  L470      AbstractCegarLoop]: Abstraction has 15125 states and 29706 transitions.
[2022-02-10 23:49:37,863 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-02-10 23:49:37,863 INFO  L276                IsEmpty]: Start isEmpty. Operand 15125 states and 29706 transitions.
[2022-02-10 23:49:37,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 522
[2022-02-10 23:49:37,866 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:37,866 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:37,866 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93
[2022-02-10 23:49:37,867 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-02-10 23:49:37,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:37,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times
[2022-02-10 23:49:37,867 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:37,867 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110620705]
[2022-02-10 23:49:37,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:37,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:37,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:38,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:38,072 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:38,072 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110620705]
[2022-02-10 23:49:38,072 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110620705] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:38,072 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:38,072 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:38,072 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006364300]
[2022-02-10 23:49:38,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:38,072 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:38,072 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:38,072 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:38,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:38,073 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-02-10 23:49:38,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:38,389 INFO  L93              Difference]: Finished difference Result 15598 states and 30652 transitions.
[2022-02-10 23:49:38,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:38,389 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-02-10 23:49:38,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:38,415 INFO  L225             Difference]: With dead ends: 15598
[2022-02-10 23:49:38,415 INFO  L226             Difference]: Without dead ends: 15598
[2022-02-10 23:49:38,415 INFO  L933         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-02-10 23:49:38,416 INFO  L934         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-02-10 23:49:38,416 INFO  L935         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-02-10 23:49:38,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15598 states.
[2022-02-10 23:49:38,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 15416.
[2022-02-10 23:49:38,583 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-02-10 23:49:38,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 30288 transitions.
[2022-02-10 23:49:38,610 INFO  L78                 Accepts]: Start accepts. Automaton has 15416 states and 30288 transitions. Word has length 521
[2022-02-10 23:49:38,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:38,610 INFO  L470      AbstractCegarLoop]: Abstraction has 15416 states and 30288 transitions.
[2022-02-10 23:49:38,610 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-02-10 23:49:38,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 15416 states and 30288 transitions.
[2022-02-10 23:49:38,613 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 532
[2022-02-10 23:49:38,613 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:38,614 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-10 23:49:38,614 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94
[2022-02-10 23:49:38,615 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-02-10 23:49:38,615 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:38,615 INFO  L85        PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times
[2022-02-10 23:49:38,615 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:38,615 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448140929]
[2022-02-10 23:49:38,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:38,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:38,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:38,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:38,820 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:38,820 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448140929]
[2022-02-10 23:49:38,820 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448140929] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:49:38,820 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-10 23:49:38,820 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-10 23:49:38,821 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506722719]
[2022-02-10 23:49:38,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:49:38,821 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-10 23:49:38,821 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:49:38,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-10 23:49:38,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2022-02-10 23:49:38,821 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-02-10 23:49:39,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:49:39,339 INFO  L93              Difference]: Finished difference Result 17548 states and 34524 transitions.
[2022-02-10 23:49:39,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-02-10 23:49:39,339 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-02-10 23:49:39,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:49:39,361 INFO  L225             Difference]: With dead ends: 17548
[2022-02-10 23:49:39,361 INFO  L226             Difference]: Without dead ends: 17197
[2022-02-10 23:49:39,361 INFO  L933         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-02-10 23:49:39,362 INFO  L934         BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.5s IncrementalHoareTripleChecker+Time
[2022-02-10 23:49:39,362 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 876 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-02-10 23:49:39,380 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17197 states.
[2022-02-10 23:49:39,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17197 to 15413.
[2022-02-10 23:49:39,533 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-02-10 23:49:39,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 30163 transitions.
[2022-02-10 23:49:39,557 INFO  L78                 Accepts]: Start accepts. Automaton has 15413 states and 30163 transitions. Word has length 531
[2022-02-10 23:49:39,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:49:39,558 INFO  L470      AbstractCegarLoop]: Abstraction has 15413 states and 30163 transitions.
[2022-02-10 23:49:39,559 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-02-10 23:49:39,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 15413 states and 30163 transitions.
[2022-02-10 23:49:39,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 590
[2022-02-10 23:49:39,564 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:49:39,564 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-02-10 23:49:39,564 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95
[2022-02-10 23:49:39,564 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-02-10 23:49:39,564 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:49:39,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -208741065, now seen corresponding path program 1 times
[2022-02-10 23:49:39,564 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:49:39,564 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843577603]
[2022-02-10 23:49:39,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:39,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:49:39,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:40,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:49:40,100 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:49:40,100 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843577603]
[2022-02-10 23:49:40,100 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843577603] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:49:40,100 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065971927]
[2022-02-10 23:49:40,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:49:40,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:49:40,101 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:49:40,109 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-02-10 23:49:40,132 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-02-10 23:49:42,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:49:42,861 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 91 conjunts are in the unsatisfiable core
[2022-02-10 23:49:42,869 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:49:42,945 INFO  L353             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2022-02-10 23:49:42,945 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-02-10 23:49:43,036 INFO  L353             Elim1Store]: treesize reduction 10, result has 64.3 percent of original size
[2022-02-10 23:49:43,036 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-02-10 23:49:43,328 INFO  L353             Elim1Store]: treesize reduction 10, result has 64.3 percent of original size
[2022-02-10 23:49:43,328 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-02-10 23:49:43,615 INFO  L353             Elim1Store]: treesize reduction 10, result has 64.3 percent of original size
[2022-02-10 23:49:43,615 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-02-10 23:49:43,903 INFO  L353             Elim1Store]: treesize reduction 10, result has 64.3 percent of original size
[2022-02-10 23:49:43,903 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-02-10 23:49:44,171 INFO  L353             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2022-02-10 23:49:44,172 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-02-10 23:49:44,571 INFO  L353             Elim1Store]: treesize reduction 24, result has 48.9 percent of original size
[2022-02-10 23:49:44,572 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-02-10 23:49:44,976 INFO  L353             Elim1Store]: treesize reduction 24, result has 48.9 percent of original size
[2022-02-10 23:49:44,976 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-02-10 23:49:45,354 INFO  L353             Elim1Store]: treesize reduction 24, result has 48.9 percent of original size
[2022-02-10 23:49:45,355 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-02-10 23:49:45,735 INFO  L353             Elim1Store]: treesize reduction 24, result has 48.9 percent of original size
[2022-02-10 23:49:45,735 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-02-10 23:49:46,128 INFO  L353             Elim1Store]: treesize reduction 24, result has 48.9 percent of original size
[2022-02-10 23:49:46,128 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-02-10 23:49:46,657 INFO  L353             Elim1Store]: treesize reduction 36, result has 42.9 percent of original size
[2022-02-10 23:49:46,658 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-02-10 23:49:55,842 INFO  L353             Elim1Store]: treesize reduction 38, result has 48.6 percent of original size
[2022-02-10 23:49:55,842 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-02-10 23:50:01,787 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-02-10 23:50:02,126 INFO  L353             Elim1Store]: treesize reduction 39, result has 22.0 percent of original size
[2022-02-10 23:50:02,127 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-02-10 23:50:02,453 INFO  L353             Elim1Store]: treesize reduction 96, result has 20.0 percent of original size
[2022-02-10 23:50:02,453 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-02-10 23:50:03,782 INFO  L353             Elim1Store]: treesize reduction 12, result has 70.7 percent of original size
[2022-02-10 23:50:03,783 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-02-10 23:50:03,948 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-02-10 23:50:04,000 INFO  L353             Elim1Store]: treesize reduction 172, result has 17.3 percent of original size
[2022-02-10 23:50:04,000 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-02-10 23:50:04,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked.
[2022-02-10 23:50:04,035 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-10 23:50:04,103 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-02-10 23:50:04,141 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-02-10 23:50:04,539 INFO  L353             Elim1Store]: treesize reduction 132, result has 22.8 percent of original size
[2022-02-10 23:50:04,539 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-02-10 23:50:04,546 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-02-10 23:50:04,554 INFO  L353             Elim1Store]: treesize reduction 52, result has 1.9 percent of original size
[2022-02-10 23:50:04,554 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-02-10 23:50:04,564 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-02-10 23:50:04,568 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-02-10 23:50:04,571 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-02-10 23:50:09,203 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:09,215 INFO  L353             Elim1Store]: treesize reduction 13, result has 48.0 percent of original size
[2022-02-10 23:50:09,215 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-02-10 23:50:09,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked.
[2022-02-10 23:50:09,252 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065971927] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-10 23:50:09,252 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-10 23:50:09,252 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 37
[2022-02-10 23:50:09,253 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446582513]
[2022-02-10 23:50:09,253 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-10 23:50:09,253 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2022-02-10 23:50:09,253 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:50:09,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2022-02-10 23:50:09,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1068, Unknown=10, NotChecked=138, Total=1406
[2022-02-10 23:50:09,254 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-02-10 23:50:10,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:50:10,714 INFO  L93              Difference]: Finished difference Result 17784 states and 34899 transitions.
[2022-02-10 23:50:10,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2022-02-10 23:50:10,714 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-02-10 23:50:10,715 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:50:10,741 INFO  L225             Difference]: With dead ends: 17784
[2022-02-10 23:50:10,741 INFO  L226             Difference]: Without dead ends: 17784
[2022-02-10 23:50:10,741 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1139 SyntacticMatches, 33 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=593, Invalid=3308, Unknown=13, NotChecked=246, Total=4160
[2022-02-10 23:50:10,742 INFO  L934         BasicCegarLoop]: 500 mSDtfsCounter, 2234 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-02-10 23:50:10,742 INFO  L935         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-02-10 23:50:10,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17784 states.
[2022-02-10 23:50:10,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17784 to 17146.
[2022-02-10 23:50:10,946 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-02-10 23:50:10,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 33629 transitions.
[2022-02-10 23:50:10,977 INFO  L78                 Accepts]: Start accepts. Automaton has 17146 states and 33629 transitions. Word has length 589
[2022-02-10 23:50:10,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:50:10,977 INFO  L470      AbstractCegarLoop]: Abstraction has 17146 states and 33629 transitions.
[2022-02-10 23:50:10,978 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-02-10 23:50:10,978 INFO  L276                IsEmpty]: Start isEmpty. Operand 17146 states and 33629 transitions.
[2022-02-10 23:50:10,983 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 590
[2022-02-10 23:50:10,983 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:50:10,983 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-02-10 23:50:11,015 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2022-02-10 23:50:11,195 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-02-10 23:50:11,196 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-02-10 23:50:11,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:50:11,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -208808955, now seen corresponding path program 2 times
[2022-02-10 23:50:11,196 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:50:11,196 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206815511]
[2022-02-10 23:50:11,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:50:11,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:50:11,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:50:12,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:50:12,350 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:50:12,350 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206815511]
[2022-02-10 23:50:12,350 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206815511] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:50:12,351 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502764268]
[2022-02-10 23:50:12,351 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-02-10 23:50:12,351 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:50:12,351 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:50:12,361 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-02-10 23:50:12,362 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-02-10 23:50:14,543 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-02-10 23:50:14,543 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:50:14,546 INFO  L263         TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core
[2022-02-10 23:50:14,565 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:50:15,248 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-02-10 23:50:15,271 INFO  L353             Elim1Store]: treesize reduction 6, result has 50.0 percent of original size
[2022-02-10 23:50:15,272 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-02-10 23:50:15,375 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-02-10 23:50:15,400 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,401 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-02-10 23:50:15,425 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,428 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:15,428 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-02-10 23:50:15,589 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,608 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,608 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,609 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,610 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,611 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,613 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:15,613 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-02-10 23:50:15,656 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,657 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,657 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:15,662 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:15,663 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-02-10 23:50:15,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked.
[2022-02-10 23:50:15,695 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:50:15,695 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [502764268] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:50:15,695 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:50:15,695 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27
[2022-02-10 23:50:15,695 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997898964]
[2022-02-10 23:50:15,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:50:15,695 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-10 23:50:15,695 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:50:15,696 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-10 23:50:15,696 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756
[2022-02-10 23:50:15,696 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-02-10 23:50:17,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:50:17,459 INFO  L93              Difference]: Finished difference Result 46055 states and 91420 transitions.
[2022-02-10 23:50:17,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2022-02-10 23:50:17,460 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-02-10 23:50:17,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:50:17,538 INFO  L225             Difference]: With dead ends: 46055
[2022-02-10 23:50:17,539 INFO  L226             Difference]: Without dead ends: 46055
[2022-02-10 23:50:17,539 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640
[2022-02-10 23:50:17,539 INFO  L934         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-02-10 23:50:17,539 INFO  L935         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-02-10 23:50:17,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46055 states.
[2022-02-10 23:50:17,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 26239.
[2022-02-10 23:50:18,016 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-02-10 23:50:18,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26239 states to 26239 states and 52799 transitions.
[2022-02-10 23:50:18,235 INFO  L78                 Accepts]: Start accepts. Automaton has 26239 states and 52799 transitions. Word has length 589
[2022-02-10 23:50:18,235 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:50:18,235 INFO  L470      AbstractCegarLoop]: Abstraction has 26239 states and 52799 transitions.
[2022-02-10 23:50:18,235 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-02-10 23:50:18,235 INFO  L276                IsEmpty]: Start isEmpty. Operand 26239 states and 52799 transitions.
[2022-02-10 23:50:18,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 590
[2022-02-10 23:50:18,241 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:50:18,241 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-02-10 23:50:18,267 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2022-02-10 23:50:18,467 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-02-10 23:50:18,468 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-02-10 23:50:18,469 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:50:18,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -895811763, now seen corresponding path program 3 times
[2022-02-10 23:50:18,469 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:50:18,469 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36351526]
[2022-02-10 23:50:18,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:50:18,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:50:18,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:50:19,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:50:19,127 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:50:19,127 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36351526]
[2022-02-10 23:50:19,127 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36351526] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:50:19,127 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981100604]
[2022-02-10 23:50:19,127 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-02-10 23:50:19,127 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:50:19,128 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:50:19,136 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-02-10 23:50:19,137 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-02-10 23:50:21,549 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2022-02-10 23:50:21,550 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:50:21,552 INFO  L263         TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core
[2022-02-10 23:50:21,558 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:50:22,315 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-02-10 23:50:22,338 INFO  L353             Elim1Store]: treesize reduction 6, result has 50.0 percent of original size
[2022-02-10 23:50:22,338 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-02-10 23:50:22,440 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-02-10 23:50:22,461 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,461 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-02-10 23:50:22,605 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,608 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:22,608 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-02-10 23:50:22,625 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,626 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,626 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,628 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:22,628 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-02-10 23:50:22,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:22,663 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:22,663 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-02-10 23:50:22,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked.
[2022-02-10 23:50:22,694 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-10 23:50:22,694 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [981100604] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-10 23:50:22,694 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-10 23:50:22,694 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19
[2022-02-10 23:50:22,694 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163881487]
[2022-02-10 23:50:22,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-10 23:50:22,695 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-10 23:50:22,695 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:50:22,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-10 23:50:22,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380
[2022-02-10 23:50:22,695 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-02-10 23:50:24,036 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:50:24,036 INFO  L93              Difference]: Finished difference Result 46138 states and 91586 transitions.
[2022-02-10 23:50:24,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2022-02-10 23:50:24,037 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-02-10 23:50:24,037 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:50:24,110 INFO  L225             Difference]: With dead ends: 46138
[2022-02-10 23:50:24,110 INFO  L226             Difference]: Without dead ends: 46138
[2022-02-10 23:50:24,111 INFO  L933         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-02-10 23:50:24,111 INFO  L934         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-02-10 23:50:24,111 INFO  L935         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-02-10 23:50:24,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46138 states.
[2022-02-10 23:50:24,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46138 to 26263.
[2022-02-10 23:50:24,724 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-02-10 23:50:24,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26263 states to 26263 states and 52847 transitions.
[2022-02-10 23:50:24,769 INFO  L78                 Accepts]: Start accepts. Automaton has 26263 states and 52847 transitions. Word has length 589
[2022-02-10 23:50:24,769 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:50:24,769 INFO  L470      AbstractCegarLoop]: Abstraction has 26263 states and 52847 transitions.
[2022-02-10 23:50:24,769 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-02-10 23:50:24,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 26263 states and 52847 transitions.
[2022-02-10 23:50:24,775 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 590
[2022-02-10 23:50:24,775 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:50:24,776 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-02-10 23:50:24,802 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-02-10 23:50:24,982 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-02-10 23:50:24,982 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-02-10 23:50:24,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:50:24,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -361079955, now seen corresponding path program 4 times
[2022-02-10 23:50:24,983 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:50:24,983 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115274967]
[2022-02-10 23:50:24,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:50:24,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:50:25,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:50:25,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:50:25,679 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:50:25,679 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115274967]
[2022-02-10 23:50:25,679 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115274967] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:50:25,679 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060808462]
[2022-02-10 23:50:25,679 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-02-10 23:50:25,680 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:50:25,680 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:50:25,688 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-02-10 23:50:25,717 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-02-10 23:50:28,874 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-02-10 23:50:28,875 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-02-10 23:50:28,885 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 37 conjunts are in the unsatisfiable core
[2022-02-10 23:50:28,892 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-10 23:50:30,073 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-02-10 23:50:30,148 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,148 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-02-10 23:50:30,238 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,241 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:30,241 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-02-10 23:50:30,269 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,269 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,270 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,272 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:30,272 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-02-10 23:50:30,321 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,322 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,322 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,323 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-02-10 23:50:30,326 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-02-10 23:50:30,326 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-02-10 23:50:30,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked.
[2022-02-10 23:50:30,353 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-02-10 23:50:32,423 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-02-10 23:50:34,180 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-02-10 23:50:35,182 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-02-10 23:50:36,382 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-02-10 23:50:36,438 INFO  L353             Elim1Store]: treesize reduction 124, result has 23.5 percent of original size
[2022-02-10 23:50:36,439 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-02-10 23:50:36,441 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-02-10 23:50:36,442 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,443 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,444 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,444 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-02-10 23:50:36,448 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,450 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,466 INFO  L353             Elim1Store]: treesize reduction 40, result has 45.9 percent of original size
[2022-02-10 23:50:36,466 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-10 23:50:36,469 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-02-10 23:50:36,471 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,471 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,472 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-02-10 23:50:36,472 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-02-10 23:50:38,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1855 trivial. 1 not checked.
[2022-02-10 23:50:38,629 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060808462] provided 0 perfect and 2 imperfect interpolant sequences
[2022-02-10 23:50:38,629 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-02-10 23:50:38,629 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 32
[2022-02-10 23:50:38,629 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187309499]
[2022-02-10 23:50:38,629 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-02-10 23:50:38,630 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2022-02-10 23:50:38,630 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-10 23:50:38,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2022-02-10 23:50:38,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=620, Unknown=4, NotChecked=228, Total=1056
[2022-02-10 23:50:38,631 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-02-10 23:50:40,357 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-02-10 23:50:41,228 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-02-10 23:50:41,958 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-02-10 23:50:42,699 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-02-10 23:50:46,964 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-02-10 23:50:49,079 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-02-10 23:50:49,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-10 23:50:49,693 INFO  L93              Difference]: Finished difference Result 136660 states and 278972 transitions.
[2022-02-10 23:50:49,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. 
[2022-02-10 23:50:49,694 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-02-10 23:50:49,694 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-10 23:50:49,988 INFO  L225             Difference]: With dead ends: 136660
[2022-02-10 23:50:49,988 INFO  L226             Difference]: Without dead ends: 136660
[2022-02-10 23:50:49,989 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=709, Invalid=2401, Unknown=10, NotChecked=1170, Total=4290
[2022-02-10 23:50:49,989 INFO  L934         BasicCegarLoop]: 711 mSDtfsCounter, 4008 mSDsluCounter, 6661 mSDsCounter, 0 mSdLazyCounter, 4649 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time
[2022-02-10 23:50:49,989 INFO  L935         BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 7365 Invalid, 13837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 4649 Invalid, 0 Unknown, 8559 Unchecked, 2.8s Time]
[2022-02-10 23:50:50,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136660 states.
[2022-02-10 23:50:51,823 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136660 to 64021.
[2022-02-10 23:50:51,889 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-02-10 23:50:52,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64021 states to 64021 states and 132783 transitions.
[2022-02-10 23:50:52,025 INFO  L78                 Accepts]: Start accepts. Automaton has 64021 states and 132783 transitions. Word has length 589
[2022-02-10 23:50:52,026 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-10 23:50:52,026 INFO  L470      AbstractCegarLoop]: Abstraction has 64021 states and 132783 transitions.
[2022-02-10 23:50:52,026 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-02-10 23:50:52,026 INFO  L276                IsEmpty]: Start isEmpty. Operand 64021 states and 132783 transitions.
[2022-02-10 23:50:52,033 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 590
[2022-02-10 23:50:52,033 INFO  L507         BasicCegarLoop]: Found error trace
[2022-02-10 23:50:52,034 INFO  L515         BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-02-10 23:50:52,067 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-02-10 23:50:52,251 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-02-10 23:50:52,252 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-02-10 23:50:52,252 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-10 23:50:52,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -364683705, now seen corresponding path program 5 times
[2022-02-10 23:50:52,252 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-10 23:50:52,252 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188623085]
[2022-02-10 23:50:52,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-10 23:50:52,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-10 23:50:52,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-10 23:50:53,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked.
[2022-02-10 23:50:53,181 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-10 23:50:53,181 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188623085]
[2022-02-10 23:50:53,181 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188623085] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-10 23:50:53,181 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256656371]
[2022-02-10 23:50:53,181 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-02-10 23:50:53,181 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-10 23:50:53,181 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-10 23:50:53,182 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-02-10 23:50:53,183 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-02-11 00:01:16,469 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-02-11 00:01:16,504 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-02-11 00:01:17,553 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
[2022-02-11 00:01:17,705 WARN  L435       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process
[2022-02-11 00:01:17,751 WARN  L317   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-02-11 00:01:17,751 INFO  L191   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-02-11 00:01:17,751 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2022-02-11 00:01:17,751 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760354482]
[2022-02-11 00:01:17,751 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2022-02-11 00:01:17,751 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-02-11 00:01:17,752 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-11 00:01:17,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-02-11 00:01:17,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2022-02-11 00:01:17,752 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-02-11 00:01:17,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-02-11 00:01:17,753 INFO  L933         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2022-02-11 00:01:17,753 INFO  L934         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-02-11 00:01:17,753 INFO  L935         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-02-11 00:01:17,754 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining)
[2022-02-11 00:01:17,754 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100
[2022-02-11 00:01:17,755 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-02-11 00:01:17,756 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining)
[2022-02-11 00:01:17,756 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining)
[2022-02-11 00:01:17,756 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining)
[2022-02-11 00:01:17,756 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining)
[2022-02-11 00:01:17,757 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining)
[2022-02-11 00:01:17,758 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining)
[2022-02-11 00:01:17,758 INFO  L764   garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining)
[2022-02-11 00:01:17,760 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-02-11 00:01:17,761 INFO  L733         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-02-11 00:01:17,774 INFO  L234   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-11 00:01:17,774 INFO  L184   ceAbstractionStarter]: Computing trace abstraction results
[2022-02-11 00:01:17,775 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 12:01:17 BasicIcfg
[2022-02-11 00:01:17,776 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: Toolchain (without parser) took 853677.24ms. Allocated memory was 177.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 117.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 813.7MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory was 136.7MB in the beginning and 136.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 541.02ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 117.2MB in the beginning and 180.7MB in the end (delta: -63.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: Boogie Procedure Inliner took 61.13ms. Allocated memory is still 235.9MB. Free memory was 180.7MB in the beginning and 176.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 235.9MB. Free memory was 176.5MB in the beginning and 172.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: RCFGBuilder took 540.16ms. Allocated memory is still 235.9MB. Free memory was 172.8MB in the beginning and 145.0MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 INFO  L158              Benchmark]: TraceAbstraction took 852498.04ms. Allocated memory was 235.9MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 144.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 782.8MB. Max. memory is 8.0GB.
[2022-02-11 00:01:17,776 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.12ms. Allocated memory is still 177.2MB. Free memory was 136.7MB in the beginning and 136.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 541.02ms. Allocated memory was 177.2MB in the beginning and 235.9MB in the end (delta: 58.7MB). Free memory was 117.2MB in the beginning and 180.7MB in the end (delta: -63.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 61.13ms. Allocated memory is still 235.9MB. Free memory was 180.7MB in the beginning and 176.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 33.16ms. Allocated memory is still 235.9MB. Free memory was 176.5MB in the beginning and 172.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 540.16ms. Allocated memory is still 235.9MB. Free memory was 172.8MB in the beginning and 145.0MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB.
 * TraceAbstraction took 852498.04ms. Allocated memory was 235.9MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 144.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 782.8MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction)
    Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa).
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 354 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 852.4s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.4s, AutomataDifference: 115.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71725 SdHoareTripleChecker+Valid, 87.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71725 mSDsluCounter, 314842 SdHoareTripleChecker+Invalid, 72.0s 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.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8721 GetRequests, 6638 SyntacticMatches, 35 SemanticMatches, 2048 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12315 ImplicationChecksByTransitivity, 30.3s 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: 21.6s AutomataMinimizationTime, 100 MinimizatonAttempts, 488637 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 60.3s InterpolantComputationTime, 50757 NumberOfCodeBlocks, 48910 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 52441 ConstructedInterpolants, 844 QuantifiedInterpolants, 149015 SizeOfPredicates, 82 NumberOfNonLiveVariables, 9835 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 183612/190869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Completed graceful shutdown