/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_01-list_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-aed12abd52951161f3584c1e4a16827ff4d06934-aed12ab [2021-10-14 11:55:11,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-14 11:55:11,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-14 11:55:11,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-14 11:55:11,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-14 11:55:11,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-14 11:55:11,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-14 11:55:11,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-14 11:55:11,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-14 11:55:11,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-14 11:55:11,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-14 11:55:11,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-14 11:55:11,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-14 11:55:11,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-14 11:55:11,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-14 11:55:11,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-14 11:55:11,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-14 11:55:11,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-14 11:55:11,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-14 11:55:11,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-14 11:55:11,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-14 11:55:11,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-14 11:55:11,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-14 11:55:11,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-14 11:55:11,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-14 11:55:11,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-14 11:55:11,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-14 11:55:11,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-14 11:55:11,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-14 11:55:11,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-14 11:55:11,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-14 11:55:11,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-14 11:55:11,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-14 11:55:11,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-14 11:55:11,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-14 11:55:11,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-14 11:55:11,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-14 11:55:11,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-14 11:55:11,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-14 11:55:11,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-14 11:55:11,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-14 11:55:11,454 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 [2021-10-14 11:55:11,471 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-14 11:55:11,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-14 11:55:11,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-14 11:55:11,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-14 11:55:11,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-14 11:55:11,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-14 11:55:11,472 INFO L138 SettingsManager]: * Use SBE=true [2021-10-14 11:55:11,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-14 11:55:11,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-14 11:55:11,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-14 11:55:11,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-14 11:55:11,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-14 11:55:11,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:55:11,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-14 11:55:11,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-14 11:55:11,474 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 [2021-10-14 11:55:11,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-14 11:55:11,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-14 11:55:11,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-14 11:55:11,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-14 11:55:11,659 INFO L275 PluginConnector]: CDTParser initialized [2021-10-14 11:55:11,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.i [2021-10-14 11:55:11,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e4950c2/349beda6b693438f8c84ae7f9b48bd0b/FLAG011b401d1 [2021-10-14 11:55:12,158 INFO L306 CDTParser]: Found 1 translation units. [2021-10-14 11:55:12,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.i [2021-10-14 11:55:12,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e4950c2/349beda6b693438f8c84ae7f9b48bd0b/FLAG011b401d1 [2021-10-14 11:55:12,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e4950c2/349beda6b693438f8c84ae7f9b48bd0b [2021-10-14 11:55:12,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-14 11:55:12,191 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-14 11:55:12,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-14 11:55:12,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-14 11:55:12,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-14 11:55:12,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63debbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12, skipping insertion in model container [2021-10-14 11:55:12,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-14 11:55:12,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-14 11:55:12,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:55:12,589 INFO L203 MainTranslator]: Completed pre-run [2021-10-14 11:55:12,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:55:12,668 INFO L208 MainTranslator]: Completed translation [2021-10-14 11:55:12,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12 WrapperNode [2021-10-14 11:55:12,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-14 11:55:12,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-14 11:55:12,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-14 11:55:12,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-14 11:55:12,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-14 11:55:12,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-14 11:55:12,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-14 11:55:12,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-14 11:55:12,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-14 11:55:12,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-14 11:55:12,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-14 11:55:12,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-14 11:55:12,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (1/1) ... [2021-10-14 11:55:12,759 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:55:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-14 11:55:12,789 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) [2021-10-14 11:55:12,794 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 [2021-10-14 11:55:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-14 11:55:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-14 11:55:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-14 11:55:12,845 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-14 11:55:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-14 11:55:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-14 11:55:12,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-14 11:55:12,846 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-14 11:55:13,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-14 11:55:13,213 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-14 11:55:13,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:13 BoogieIcfgContainer [2021-10-14 11:55:13,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-14 11:55:13,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-14 11:55:13,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-14 11:55:13,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-14 11:55:13,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:55:12" (1/3) ... [2021-10-14 11:55:13,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c18dccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:13, skipping insertion in model container [2021-10-14 11:55:13,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:12" (2/3) ... [2021-10-14 11:55:13,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c18dccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:13, skipping insertion in model container [2021-10-14 11:55:13,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:13" (3/3) ... [2021-10-14 11:55:13,219 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2021-10-14 11:55:13,223 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-14 11:55:13,223 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-14 11:55:13,223 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-10-14 11:55:13,237 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,263 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,264 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,265 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,266 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,267 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,268 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,269 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,270 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,271 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,272 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,273 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,274 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,275 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,276 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,277 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,278 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,279 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,280 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,281 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,282 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,283 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,284 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,285 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,286 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,287 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,288 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,289 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,290 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,291 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,292 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,294 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,294 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,295 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,296 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,297 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:13,313 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-14 11:55:13,343 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-14 11:55:13,350 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, mConcurrency=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 [2021-10-14 11:55:13,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2021-10-14 11:55:13,360 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 199 places, 195 transitions, 395 flow [2021-10-14 11:55:13,426 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2050 states, 2040 states have (on average 1.9161764705882354) internal successors, (3909), 2049 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 2050 states, 2040 states have (on average 1.9161764705882354) internal successors, (3909), 2049 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-14 11:55:13,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:13,435 INFO L512 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] [2021-10-14 11:55:13,436 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1689251034, now seen corresponding path program 1 times [2021-10-14 11:55:13,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:13,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679574294] [2021-10-14 11:55:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:13,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:13,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:13,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679574294] [2021-10-14 11:55:13,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679574294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:13,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:13,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:13,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967635668] [2021-10-14 11:55:13,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:13,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:13,732 INFO L87 Difference]: Start difference. First operand has 2050 states, 2040 states have (on average 1.9161764705882354) internal successors, (3909), 2049 states have internal predecessors, (3909), 0 states have call successors, (0), 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 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:13,951 INFO L93 Difference]: Finished difference Result 2048 states and 3907 transitions. [2021-10-14 11:55:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-14 11:55:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:13,972 INFO L225 Difference]: With dead ends: 2048 [2021-10-14 11:55:13,972 INFO L226 Difference]: Without dead ends: 2048 [2021-10-14 11:55:13,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2021-10-14 11:55:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2021-10-14 11:55:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 2040 states have (on average 1.9151960784313726) internal successors, (3907), 2047 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3907 transitions. [2021-10-14 11:55:14,052 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3907 transitions. Word has length 38 [2021-10-14 11:55:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:14,053 INFO L470 AbstractCegarLoop]: Abstraction has 2048 states and 3907 transitions. [2021-10-14 11:55:14,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3907 transitions. [2021-10-14 11:55:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-14 11:55:14,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:14,054 INFO L512 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] [2021-10-14 11:55:14,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-14 11:55:14,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:14,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1789698529, now seen corresponding path program 1 times [2021-10-14 11:55:14,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:14,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266530812] [2021-10-14 11:55:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:14,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:14,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:14,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266530812] [2021-10-14 11:55:14,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266530812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:14,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:14,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:14,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130885181] [2021-10-14 11:55:14,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:14,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:14,226 INFO L87 Difference]: Start difference. First operand 2048 states and 3907 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:14,373 INFO L93 Difference]: Finished difference Result 2046 states and 3905 transitions. [2021-10-14 11:55:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-14 11:55:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:14,381 INFO L225 Difference]: With dead ends: 2046 [2021-10-14 11:55:14,381 INFO L226 Difference]: Without dead ends: 2046 [2021-10-14 11:55:14,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-10-14 11:55:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2021-10-14 11:55:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2040 states have (on average 1.9142156862745099) internal successors, (3905), 2045 states have internal predecessors, (3905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3905 transitions. [2021-10-14 11:55:14,423 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3905 transitions. Word has length 46 [2021-10-14 11:55:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:14,424 INFO L470 AbstractCegarLoop]: Abstraction has 2046 states and 3905 transitions. [2021-10-14 11:55:14,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3905 transitions. [2021-10-14 11:55:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-14 11:55:14,426 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:14,426 INFO L512 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] [2021-10-14 11:55:14,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-14 11:55:14,426 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1105213705, now seen corresponding path program 1 times [2021-10-14 11:55:14,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:14,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937985894] [2021-10-14 11:55:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:14,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:14,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:14,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937985894] [2021-10-14 11:55:14,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937985894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:14,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:14,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-14 11:55:14,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144913696] [2021-10-14 11:55:14,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 11:55:14,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 11:55:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:14,474 INFO L87 Difference]: Start difference. First operand 2046 states and 3905 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:14,494 INFO L93 Difference]: Finished difference Result 2045 states and 3904 transitions. [2021-10-14 11:55:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 11:55:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-14 11:55:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:14,501 INFO L225 Difference]: With dead ends: 2045 [2021-10-14 11:55:14,501 INFO L226 Difference]: Without dead ends: 2045 [2021-10-14 11:55:14,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2021-10-14 11:55:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2021-10-14 11:55:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2040 states have (on average 1.9137254901960785) internal successors, (3904), 2044 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3904 transitions. [2021-10-14 11:55:14,537 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3904 transitions. Word has length 52 [2021-10-14 11:55:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:14,537 INFO L470 AbstractCegarLoop]: Abstraction has 2045 states and 3904 transitions. [2021-10-14 11:55:14,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3904 transitions. [2021-10-14 11:55:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-14 11:55:14,538 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:14,538 INFO L512 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] [2021-10-14 11:55:14,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-14 11:55:14,539 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2094164371, now seen corresponding path program 1 times [2021-10-14 11:55:14,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:14,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744537706] [2021-10-14 11:55:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:14,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:14,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:14,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744537706] [2021-10-14 11:55:14,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744537706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:14,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:14,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:14,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393320680] [2021-10-14 11:55:14,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:14,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:14,634 INFO L87 Difference]: Start difference. First operand 2045 states and 3904 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:14,772 INFO L93 Difference]: Finished difference Result 2044 states and 3903 transitions. [2021-10-14 11:55:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-10-14 11:55:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:14,778 INFO L225 Difference]: With dead ends: 2044 [2021-10-14 11:55:14,779 INFO L226 Difference]: Without dead ends: 2044 [2021-10-14 11:55:14,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2021-10-14 11:55:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2021-10-14 11:55:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2040 states have (on average 1.9132352941176471) internal successors, (3903), 2043 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3903 transitions. [2021-10-14 11:55:14,831 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3903 transitions. Word has length 86 [2021-10-14 11:55:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:14,831 INFO L470 AbstractCegarLoop]: Abstraction has 2044 states and 3903 transitions. [2021-10-14 11:55:14,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3903 transitions. [2021-10-14 11:55:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-14 11:55:14,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:14,837 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:14,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-14 11:55:14,838 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1451903986, now seen corresponding path program 1 times [2021-10-14 11:55:14,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:14,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421380538] [2021-10-14 11:55:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:14,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:14,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:14,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421380538] [2021-10-14 11:55:14,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421380538] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:14,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:14,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:14,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482552802] [2021-10-14 11:55:14,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:14,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:14,991 INFO L87 Difference]: Start difference. First operand 2044 states and 3903 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) [2021-10-14 11:55:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:15,205 INFO L93 Difference]: Finished difference Result 2150 states and 4110 transitions. [2021-10-14 11:55:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:15,205 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 108 [2021-10-14 11:55:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:15,213 INFO L225 Difference]: With dead ends: 2150 [2021-10-14 11:55:15,214 INFO L226 Difference]: Without dead ends: 2150 [2021-10-14 11:55:15,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2021-10-14 11:55:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2127. [2021-10-14 11:55:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2123 states have (on average 1.9147432878002826) internal successors, (4065), 2126 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4065 transitions. [2021-10-14 11:55:15,255 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4065 transitions. Word has length 108 [2021-10-14 11:55:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:15,255 INFO L470 AbstractCegarLoop]: Abstraction has 2127 states and 4065 transitions. [2021-10-14 11:55:15,256 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) [2021-10-14 11:55:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4065 transitions. [2021-10-14 11:55:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-14 11:55:15,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:15,261 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:15,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-14 11:55:15,261 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash 416460279, now seen corresponding path program 1 times [2021-10-14 11:55:15,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:15,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778376060] [2021-10-14 11:55:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:15,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:15,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:15,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778376060] [2021-10-14 11:55:15,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778376060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:15,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:15,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:15,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566642281] [2021-10-14 11:55:15,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:15,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:15,371 INFO L87 Difference]: Start difference. First operand 2127 states and 4065 transitions. Second operand has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:15,487 INFO L93 Difference]: Finished difference Result 2233 states and 4272 transitions. [2021-10-14 11:55:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-10-14 11:55:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:15,496 INFO L225 Difference]: With dead ends: 2233 [2021-10-14 11:55:15,496 INFO L226 Difference]: Without dead ends: 2233 [2021-10-14 11:55:15,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2021-10-14 11:55:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2210. [2021-10-14 11:55:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 2206 states have (on average 1.9161378059836809) internal successors, (4227), 2209 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 4227 transitions. [2021-10-14 11:55:15,544 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 4227 transitions. Word has length 116 [2021-10-14 11:55:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:15,545 INFO L470 AbstractCegarLoop]: Abstraction has 2210 states and 4227 transitions. [2021-10-14 11:55:15,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 4227 transitions. [2021-10-14 11:55:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-14 11:55:15,546 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:15,546 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:15,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-14 11:55:15,546 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1303815973, now seen corresponding path program 1 times [2021-10-14 11:55:15,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:15,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497737522] [2021-10-14 11:55:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:15,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:15,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:15,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497737522] [2021-10-14 11:55:15,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497737522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:15,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:15,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:55:15,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145140171] [2021-10-14 11:55:15,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:55:15,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:15,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:55:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:55:15,714 INFO L87 Difference]: Start difference. First operand 2210 states and 4227 transitions. Second operand has 13 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:16,470 INFO L93 Difference]: Finished difference Result 2439 states and 4623 transitions. [2021-10-14 11:55:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-14 11:55:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-10-14 11:55:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:16,478 INFO L225 Difference]: With dead ends: 2439 [2021-10-14 11:55:16,478 INFO L226 Difference]: Without dead ends: 2439 [2021-10-14 11:55:16,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 253.9ms TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:55:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2021-10-14 11:55:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2155. [2021-10-14 11:55:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2151 states have (on average 1.913993491399349) internal successors, (4117), 2154 states have internal predecessors, (4117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 4117 transitions. [2021-10-14 11:55:16,532 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 4117 transitions. Word has length 117 [2021-10-14 11:55:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:16,533 INFO L470 AbstractCegarLoop]: Abstraction has 2155 states and 4117 transitions. [2021-10-14 11:55:16,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 4117 transitions. [2021-10-14 11:55:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-10-14 11:55:16,534 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:16,534 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:16,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-14 11:55:16,535 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1273001226, now seen corresponding path program 1 times [2021-10-14 11:55:16,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:16,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691591964] [2021-10-14 11:55:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:16,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:16,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:16,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691591964] [2021-10-14 11:55:16,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691591964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:16,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:16,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:55:16,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032746869] [2021-10-14 11:55:16,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:55:16,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:55:16,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:55:16,680 INFO L87 Difference]: Start difference. First operand 2155 states and 4117 transitions. Second operand has 13 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 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) [2021-10-14 11:55:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:17,251 INFO L93 Difference]: Finished difference Result 2384 states and 4513 transitions. [2021-10-14 11:55:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-14 11:55:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 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 125 [2021-10-14 11:55:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:17,258 INFO L225 Difference]: With dead ends: 2384 [2021-10-14 11:55:17,259 INFO L226 Difference]: Without dead ends: 2384 [2021-10-14 11:55:17,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 233.5ms TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:55:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2021-10-14 11:55:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2100. [2021-10-14 11:55:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2096 states have (on average 1.911736641221374) internal successors, (4007), 2099 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4007 transitions. [2021-10-14 11:55:17,296 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4007 transitions. Word has length 125 [2021-10-14 11:55:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:17,296 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 4007 transitions. [2021-10-14 11:55:17,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.416666666666666) internal successors, (125), 13 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) [2021-10-14 11:55:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4007 transitions. [2021-10-14 11:55:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:17,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:17,299 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:17,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-14 11:55:17,299 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -576257509, now seen corresponding path program 1 times [2021-10-14 11:55:17,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:17,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646538110] [2021-10-14 11:55:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:17,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:17,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:17,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646538110] [2021-10-14 11:55:17,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646538110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:17,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:17,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:55:17,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328512071] [2021-10-14 11:55:17,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:55:17,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:55:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:55:17,619 INFO L87 Difference]: Start difference. First operand 2100 states and 4007 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:55:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:19,966 INFO L93 Difference]: Finished difference Result 4788 states and 9206 transitions. [2021-10-14 11:55:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-10-14 11:55:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:55:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:19,980 INFO L225 Difference]: With dead ends: 4788 [2021-10-14 11:55:19,980 INFO L226 Difference]: Without dead ends: 4788 [2021-10-14 11:55:19,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 1189.6ms TimeCoverageRelationStatistics Valid=1021, Invalid=8099, Unknown=0, NotChecked=0, Total=9120 [2021-10-14 11:55:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2021-10-14 11:55:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 2212. [2021-10-14 11:55:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2208 states have (on average 1.9162137681159421) internal successors, (4231), 2211 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 4231 transitions. [2021-10-14 11:55:20,026 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 4231 transitions. Word has length 128 [2021-10-14 11:55:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:20,026 INFO L470 AbstractCegarLoop]: Abstraction has 2212 states and 4231 transitions. [2021-10-14 11:55:20,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:55:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 4231 transitions. [2021-10-14 11:55:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:20,028 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:20,028 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:20,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-14 11:55:20,028 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1979274625, now seen corresponding path program 2 times [2021-10-14 11:55:20,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:20,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006482280] [2021-10-14 11:55:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:20,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:20,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:20,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006482280] [2021-10-14 11:55:20,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006482280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:20,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:20,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:55:20,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833516758] [2021-10-14 11:55:20,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:55:20,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:55:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:55:20,313 INFO L87 Difference]: Start difference. First operand 2212 states and 4231 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:21,894 INFO L93 Difference]: Finished difference Result 4261 states and 8219 transitions. [2021-10-14 11:55:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:55:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:55:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:21,915 INFO L225 Difference]: With dead ends: 4261 [2021-10-14 11:55:21,915 INFO L226 Difference]: Without dead ends: 4261 [2021-10-14 11:55:21,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 674.2ms TimeCoverageRelationStatistics Valid=579, Invalid=3977, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:55:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2021-10-14 11:55:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 2236. [2021-10-14 11:55:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2232 states have (on average 1.9171146953405018) internal successors, (4279), 2235 states have internal predecessors, (4279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 4279 transitions. [2021-10-14 11:55:21,974 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 4279 transitions. Word has length 128 [2021-10-14 11:55:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:21,974 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 4279 transitions. [2021-10-14 11:55:21,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 4279 transitions. [2021-10-14 11:55:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:21,977 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:21,977 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:21,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-14 11:55:21,978 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash -271892765, now seen corresponding path program 3 times [2021-10-14 11:55:21,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:21,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938578622] [2021-10-14 11:55:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:21,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:22,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:22,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938578622] [2021-10-14 11:55:22,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938578622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:22,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:22,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:55:22,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021279504] [2021-10-14 11:55:22,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:55:22,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:55:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:55:22,255 INFO L87 Difference]: Start difference. First operand 2236 states and 4279 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:23,882 INFO L93 Difference]: Finished difference Result 3267 states and 6307 transitions. [2021-10-14 11:55:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-10-14 11:55:23,883 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:55:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:23,893 INFO L225 Difference]: With dead ends: 3267 [2021-10-14 11:55:23,893 INFO L226 Difference]: Without dead ends: 3267 [2021-10-14 11:55:23,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 701.2ms TimeCoverageRelationStatistics Valid=519, Invalid=3513, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:55:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2021-10-14 11:55:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2237. [2021-10-14 11:55:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2233 states have (on average 1.917151813703538) internal successors, (4281), 2236 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 4281 transitions. [2021-10-14 11:55:23,932 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 4281 transitions. Word has length 128 [2021-10-14 11:55:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:23,933 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 4281 transitions. [2021-10-14 11:55:23,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 4281 transitions. [2021-10-14 11:55:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:23,934 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:23,935 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:23,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-14 11:55:23,936 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -612724835, now seen corresponding path program 4 times [2021-10-14 11:55:23,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:23,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20390786] [2021-10-14 11:55:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:23,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:24,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:24,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20390786] [2021-10-14 11:55:24,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20390786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:24,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:24,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:55:24,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109851318] [2021-10-14 11:55:24,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:55:24,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:55:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:55:24,235 INFO L87 Difference]: Start difference. First operand 2237 states and 4281 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:25,740 INFO L93 Difference]: Finished difference Result 3229 states and 6233 transitions. [2021-10-14 11:55:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-10-14 11:55:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:55:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:25,745 INFO L225 Difference]: With dead ends: 3229 [2021-10-14 11:55:25,745 INFO L226 Difference]: Without dead ends: 3229 [2021-10-14 11:55:25,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 702.6ms TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:55:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2021-10-14 11:55:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2238. [2021-10-14 11:55:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 2234 states have (on average 1.9171888988361683) internal successors, (4283), 2237 states have internal predecessors, (4283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 4283 transitions. [2021-10-14 11:55:25,779 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 4283 transitions. Word has length 128 [2021-10-14 11:55:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:25,779 INFO L470 AbstractCegarLoop]: Abstraction has 2238 states and 4283 transitions. [2021-10-14 11:55:25,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 4283 transitions. [2021-10-14 11:55:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:25,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:25,781 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:25,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-14 11:55:25,781 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1254325947, now seen corresponding path program 5 times [2021-10-14 11:55:25,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:25,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177563827] [2021-10-14 11:55:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:25,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:26,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:26,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177563827] [2021-10-14 11:55:26,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177563827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:26,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:26,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:55:26,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342803285] [2021-10-14 11:55:26,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:55:26,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:55:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:55:26,051 INFO L87 Difference]: Start difference. First operand 2238 states and 4283 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:27,684 INFO L93 Difference]: Finished difference Result 3165 states and 6109 transitions. [2021-10-14 11:55:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-14 11:55:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:55:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:27,690 INFO L225 Difference]: With dead ends: 3165 [2021-10-14 11:55:27,690 INFO L226 Difference]: Without dead ends: 3165 [2021-10-14 11:55:27,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 723.9ms TimeCoverageRelationStatistics Valid=541, Invalid=3491, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:55:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2021-10-14 11:55:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2240. [2021-10-14 11:55:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2236 states have (on average 1.917262969588551) internal successors, (4287), 2239 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 4287 transitions. [2021-10-14 11:55:27,724 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 4287 transitions. Word has length 128 [2021-10-14 11:55:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:27,724 INFO L470 AbstractCegarLoop]: Abstraction has 2240 states and 4287 transitions. [2021-10-14 11:55:27,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:55:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 4287 transitions. [2021-10-14 11:55:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:27,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:27,726 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:27,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-14 11:55:27,726 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash -710066103, now seen corresponding path program 6 times [2021-10-14 11:55:27,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:27,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990202764] [2021-10-14 11:55:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:27,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:28,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:28,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990202764] [2021-10-14 11:55:28,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990202764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:28,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:28,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:55:28,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578689010] [2021-10-14 11:55:28,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:55:28,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:55:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:55:28,106 INFO L87 Difference]: Start difference. First operand 2240 states and 4287 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:30,098 INFO L93 Difference]: Finished difference Result 3848 states and 7432 transitions. [2021-10-14 11:55:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:30,098 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:55:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:30,104 INFO L225 Difference]: With dead ends: 3848 [2021-10-14 11:55:30,104 INFO L226 Difference]: Without dead ends: 3848 [2021-10-14 11:55:30,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 1202.9ms TimeCoverageRelationStatistics Valid=780, Invalid=4476, Unknown=0, NotChecked=0, Total=5256 [2021-10-14 11:55:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2021-10-14 11:55:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 2263. [2021-10-14 11:55:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2259 states have (on average 1.9181053563523682) internal successors, (4333), 2262 states have internal predecessors, (4333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 4333 transitions. [2021-10-14 11:55:30,140 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 4333 transitions. Word has length 128 [2021-10-14 11:55:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:30,140 INFO L470 AbstractCegarLoop]: Abstraction has 2263 states and 4333 transitions. [2021-10-14 11:55:30,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 4333 transitions. [2021-10-14 11:55:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:30,142 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:30,142 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:30,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-14 11:55:30,142 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash 40048829, now seen corresponding path program 7 times [2021-10-14 11:55:30,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:30,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792550054] [2021-10-14 11:55:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:30,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:30,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:30,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792550054] [2021-10-14 11:55:30,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792550054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:30,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:30,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:30,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376442299] [2021-10-14 11:55:30,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:30,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:30,487 INFO L87 Difference]: Start difference. First operand 2263 states and 4333 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:32,575 INFO L93 Difference]: Finished difference Result 3885 states and 7504 transitions. [2021-10-14 11:55:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:32,581 INFO L225 Difference]: With dead ends: 3885 [2021-10-14 11:55:32,581 INFO L226 Difference]: Without dead ends: 3885 [2021-10-14 11:55:32,582 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 1142.8ms TimeCoverageRelationStatistics Valid=811, Invalid=4301, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2021-10-14 11:55:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 2262. [2021-10-14 11:55:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 2258 states have (on average 1.9180690876882196) internal successors, (4331), 2261 states have internal predecessors, (4331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 4331 transitions. [2021-10-14 11:55:32,618 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 4331 transitions. Word has length 128 [2021-10-14 11:55:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:32,618 INFO L470 AbstractCegarLoop]: Abstraction has 2262 states and 4331 transitions. [2021-10-14 11:55:32,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 4331 transitions. [2021-10-14 11:55:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:32,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:32,620 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:32,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-14 11:55:32,620 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2144371465, now seen corresponding path program 8 times [2021-10-14 11:55:32,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:32,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680855938] [2021-10-14 11:55:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:32,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:32,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:32,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680855938] [2021-10-14 11:55:32,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680855938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:32,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:32,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:32,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065146838] [2021-10-14 11:55:32,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:32,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:32,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:32,949 INFO L87 Difference]: Start difference. First operand 2262 states and 4331 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:34,995 INFO L93 Difference]: Finished difference Result 3950 states and 7630 transitions. [2021-10-14 11:55:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:55:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:35,000 INFO L225 Difference]: With dead ends: 3950 [2021-10-14 11:55:35,000 INFO L226 Difference]: Without dead ends: 3950 [2021-10-14 11:55:35,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1180.7ms TimeCoverageRelationStatistics Valid=828, Invalid=4574, Unknown=0, NotChecked=0, Total=5402 [2021-10-14 11:55:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-10-14 11:55:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 2261. [2021-10-14 11:55:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2257 states have (on average 1.9180327868852458) internal successors, (4329), 2260 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 4329 transitions. [2021-10-14 11:55:35,030 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 4329 transitions. Word has length 128 [2021-10-14 11:55:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:35,030 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 4329 transitions. [2021-10-14 11:55:35,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 4329 transitions. [2021-10-14 11:55:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:35,032 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:35,032 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:35,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-14 11:55:35,032 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash 162444797, now seen corresponding path program 9 times [2021-10-14 11:55:35,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:35,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248694650] [2021-10-14 11:55:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:35,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:35,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:35,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248694650] [2021-10-14 11:55:35,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248694650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:35,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:35,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:35,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746743005] [2021-10-14 11:55:35,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:35,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:35,356 INFO L87 Difference]: Start difference. First operand 2261 states and 4329 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:37,501 INFO L93 Difference]: Finished difference Result 3918 states and 7568 transitions. [2021-10-14 11:55:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-10-14 11:55:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:37,505 INFO L225 Difference]: With dead ends: 3918 [2021-10-14 11:55:37,505 INFO L226 Difference]: Without dead ends: 3918 [2021-10-14 11:55:37,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1184.2ms TimeCoverageRelationStatistics Valid=862, Invalid=4838, Unknown=0, NotChecked=0, Total=5700 [2021-10-14 11:55:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2021-10-14 11:55:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 2260. [2021-10-14 11:55:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:55:37,530 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:55:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:37,531 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:55:37,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:55:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:37,532 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:37,533 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:37,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-14 11:55:37,533 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1067568167, now seen corresponding path program 10 times [2021-10-14 11:55:37,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:37,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382504130] [2021-10-14 11:55:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:37,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:37,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:37,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382504130] [2021-10-14 11:55:37,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382504130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:37,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:37,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:55:37,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010680049] [2021-10-14 11:55:37,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:55:37,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:37,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:55:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:55:37,948 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:39,844 INFO L93 Difference]: Finished difference Result 2530 states and 4820 transitions. [2021-10-14 11:55:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-10-14 11:55:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:55:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:39,847 INFO L225 Difference]: With dead ends: 2530 [2021-10-14 11:55:39,847 INFO L226 Difference]: Without dead ends: 2530 [2021-10-14 11:55:39,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 1108.2ms TimeCoverageRelationStatistics Valid=868, Invalid=4244, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2021-10-14 11:55:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2260. [2021-10-14 11:55:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:55:39,884 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:55:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:39,884 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:55:39,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:55:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:39,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:39,886 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:39,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-14 11:55:39,886 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1177296791, now seen corresponding path program 11 times [2021-10-14 11:55:39,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:39,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831187786] [2021-10-14 11:55:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:39,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:40,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:40,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831187786] [2021-10-14 11:55:40,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831187786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:40,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:40,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:55:40,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068337063] [2021-10-14 11:55:40,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:55:40,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:40,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:55:40,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:55:40,340 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:42,588 INFO L93 Difference]: Finished difference Result 2567 states and 4893 transitions. [2021-10-14 11:55:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:55:42,589 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:55:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:42,591 INFO L225 Difference]: With dead ends: 2567 [2021-10-14 11:55:42,591 INFO L226 Difference]: Without dead ends: 2567 [2021-10-14 11:55:42,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 1373.7ms TimeCoverageRelationStatistics Valid=971, Invalid=4579, Unknown=0, NotChecked=0, Total=5550 [2021-10-14 11:55:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-10-14 11:55:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2266. [2021-10-14 11:55:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2262 states have (on average 1.9182139699381078) internal successors, (4339), 2265 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 4339 transitions. [2021-10-14 11:55:42,622 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 4339 transitions. Word has length 128 [2021-10-14 11:55:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:42,623 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 4339 transitions. [2021-10-14 11:55:42,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 4339 transitions. [2021-10-14 11:55:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:42,625 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:42,625 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:42,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-14 11:55:42,625 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 548347717, now seen corresponding path program 12 times [2021-10-14 11:55:42,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:42,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900257491] [2021-10-14 11:55:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:42,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:43,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:43,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900257491] [2021-10-14 11:55:43,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900257491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:43,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:43,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:43,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341027446] [2021-10-14 11:55:43,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:43,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:43,041 INFO L87 Difference]: Start difference. First operand 2266 states and 4339 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:44,880 INFO L93 Difference]: Finished difference Result 2574 states and 4906 transitions. [2021-10-14 11:55:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:44,883 INFO L225 Difference]: With dead ends: 2574 [2021-10-14 11:55:44,883 INFO L226 Difference]: Without dead ends: 2574 [2021-10-14 11:55:44,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 1168.2ms TimeCoverageRelationStatistics Valid=973, Invalid=4139, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2021-10-14 11:55:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2260. [2021-10-14 11:55:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:55:44,905 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:55:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:44,905 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:55:44,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:55:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:44,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:44,908 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:44,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-14 11:55:44,908 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1579927035, now seen corresponding path program 13 times [2021-10-14 11:55:44,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:44,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116461699] [2021-10-14 11:55:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:44,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:45,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:45,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116461699] [2021-10-14 11:55:45,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116461699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:45,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:45,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:55:45,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283183604] [2021-10-14 11:55:45,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:55:45,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:55:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:55:45,354 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:47,574 INFO L93 Difference]: Finished difference Result 2571 states and 4902 transitions. [2021-10-14 11:55:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:55:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:47,577 INFO L225 Difference]: With dead ends: 2571 [2021-10-14 11:55:47,577 INFO L226 Difference]: Without dead ends: 2571 [2021-10-14 11:55:47,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1356.6ms TimeCoverageRelationStatistics Valid=902, Invalid=4354, Unknown=0, NotChecked=0, Total=5256 [2021-10-14 11:55:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-10-14 11:55:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2272. [2021-10-14 11:55:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2268 states have (on average 1.9184303350970018) internal successors, (4351), 2271 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 4351 transitions. [2021-10-14 11:55:47,599 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 4351 transitions. Word has length 128 [2021-10-14 11:55:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:47,599 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 4351 transitions. [2021-10-14 11:55:47,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 4351 transitions. [2021-10-14 11:55:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:47,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:47,600 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:47,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-14 11:55:47,601 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:47,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:47,601 INFO L82 PathProgramCache]: Analyzing trace with hash -989395753, now seen corresponding path program 14 times [2021-10-14 11:55:47,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:47,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961696661] [2021-10-14 11:55:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:47,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:47,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:47,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961696661] [2021-10-14 11:55:47,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961696661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:47,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:47,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:47,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664172995] [2021-10-14 11:55:47,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:47,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:48,000 INFO L87 Difference]: Start difference. First operand 2272 states and 4351 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:50,125 INFO L93 Difference]: Finished difference Result 2609 states and 4976 transitions. [2021-10-14 11:55:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:50,128 INFO L225 Difference]: With dead ends: 2609 [2021-10-14 11:55:50,128 INFO L226 Difference]: Without dead ends: 2609 [2021-10-14 11:55:50,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 1368.8ms TimeCoverageRelationStatistics Valid=966, Invalid=4146, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2021-10-14 11:55:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2266. [2021-10-14 11:55:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2262 states have (on average 1.9182139699381078) internal successors, (4339), 2265 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 4339 transitions. [2021-10-14 11:55:50,149 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 4339 transitions. Word has length 128 [2021-10-14 11:55:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:50,149 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 4339 transitions. [2021-10-14 11:55:50,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 4339 transitions. [2021-10-14 11:55:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:50,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:50,153 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:50,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-14 11:55:50,153 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 651955771, now seen corresponding path program 15 times [2021-10-14 11:55:50,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:50,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707774862] [2021-10-14 11:55:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:50,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:50,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:50,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707774862] [2021-10-14 11:55:50,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707774862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:50,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:50,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:50,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281371907] [2021-10-14 11:55:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:50,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:50,543 INFO L87 Difference]: Start difference. First operand 2266 states and 4339 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:52,394 INFO L93 Difference]: Finished difference Result 2618 states and 4992 transitions. [2021-10-14 11:55:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:52,394 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:52,396 INFO L225 Difference]: With dead ends: 2618 [2021-10-14 11:55:52,396 INFO L226 Difference]: Without dead ends: 2618 [2021-10-14 11:55:52,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1196.3ms TimeCoverageRelationStatistics Valid=943, Invalid=4169, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-10-14 11:55:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2260. [2021-10-14 11:55:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:55:52,417 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:55:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:52,417 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:55:52,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:55:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:52,418 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:52,418 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:52,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-14 11:55:52,419 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1195862329, now seen corresponding path program 16 times [2021-10-14 11:55:52,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:52,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054085320] [2021-10-14 11:55:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:52,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:52,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:52,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054085320] [2021-10-14 11:55:52,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054085320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:52,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:52,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:55:52,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532167817] [2021-10-14 11:55:52,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:55:52,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:55:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:55:52,828 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:54,902 INFO L93 Difference]: Finished difference Result 2587 states and 4934 transitions. [2021-10-14 11:55:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-14 11:55:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:55:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:54,904 INFO L225 Difference]: With dead ends: 2587 [2021-10-14 11:55:54,904 INFO L226 Difference]: Without dead ends: 2587 [2021-10-14 11:55:54,905 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 1283.7ms TimeCoverageRelationStatistics Valid=836, Invalid=4134, Unknown=0, NotChecked=0, Total=4970 [2021-10-14 11:55:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2021-10-14 11:55:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2278. [2021-10-14 11:55:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2274 states have (on average 1.918645558487247) internal successors, (4363), 2277 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 4363 transitions. [2021-10-14 11:55:54,929 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 4363 transitions. Word has length 128 [2021-10-14 11:55:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:54,929 INFO L470 AbstractCegarLoop]: Abstraction has 2278 states and 4363 transitions. [2021-10-14 11:55:54,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:55:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 4363 transitions. [2021-10-14 11:55:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:54,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:54,931 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:54,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-14 11:55:54,931 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash 529782179, now seen corresponding path program 17 times [2021-10-14 11:55:54,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:54,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766752966] [2021-10-14 11:55:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:54,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:55,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:55,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766752966] [2021-10-14 11:55:55,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766752966] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:55,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:55,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:55,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377571645] [2021-10-14 11:55:55,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:55,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:55,307 INFO L87 Difference]: Start difference. First operand 2278 states and 4363 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:57,456 INFO L93 Difference]: Finished difference Result 2625 states and 5008 transitions. [2021-10-14 11:55:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-14 11:55:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:57,459 INFO L225 Difference]: With dead ends: 2625 [2021-10-14 11:55:57,459 INFO L226 Difference]: Without dead ends: 2625 [2021-10-14 11:55:57,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 1313.2ms TimeCoverageRelationStatistics Valid=888, Invalid=3942, Unknown=0, NotChecked=0, Total=4830 [2021-10-14 11:55:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2021-10-14 11:55:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2272. [2021-10-14 11:55:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2268 states have (on average 1.9184303350970018) internal successors, (4351), 2271 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 4351 transitions. [2021-10-14 11:55:57,477 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 4351 transitions. Word has length 128 [2021-10-14 11:55:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:57,478 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 4351 transitions. [2021-10-14 11:55:57,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 4351 transitions. [2021-10-14 11:55:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:57,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:57,479 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:57,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-14 11:55:57,479 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2123833593, now seen corresponding path program 18 times [2021-10-14 11:55:57,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:57,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062504322] [2021-10-14 11:55:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:57,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:55:57,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:57,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062504322] [2021-10-14 11:55:57,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062504322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:57,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:57,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:55:57,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668092615] [2021-10-14 11:55:57,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:55:57,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:55:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:55:57,847 INFO L87 Difference]: Start difference. First operand 2272 states and 4351 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:59,932 INFO L93 Difference]: Finished difference Result 2658 states and 5072 transitions. [2021-10-14 11:55:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:55:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:55:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:59,935 INFO L225 Difference]: With dead ends: 2658 [2021-10-14 11:55:59,935 INFO L226 Difference]: Without dead ends: 2658 [2021-10-14 11:55:59,936 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 1391.8ms TimeCoverageRelationStatistics Valid=924, Invalid=4188, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:55:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-10-14 11:55:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2266. [2021-10-14 11:55:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2262 states have (on average 1.9182139699381078) internal successors, (4339), 2265 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 4339 transitions. [2021-10-14 11:55:59,956 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 4339 transitions. Word has length 128 [2021-10-14 11:55:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:59,956 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 4339 transitions. [2021-10-14 11:55:59,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:55:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 4339 transitions. [2021-10-14 11:55:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:55:59,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:59,958 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:59,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-14 11:55:59,959 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:55:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 368717155, now seen corresponding path program 19 times [2021-10-14 11:55:59,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:59,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326992517] [2021-10-14 11:55:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:59,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:00,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:00,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326992517] [2021-10-14 11:56:00,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326992517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:00,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:00,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:00,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027698] [2021-10-14 11:56:00,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:00,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:00,310 INFO L87 Difference]: Start difference. First operand 2266 states and 4339 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:02,239 INFO L93 Difference]: Finished difference Result 2662 states and 5078 transitions. [2021-10-14 11:56:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:56:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:02,241 INFO L225 Difference]: With dead ends: 2662 [2021-10-14 11:56:02,241 INFO L226 Difference]: Without dead ends: 2662 [2021-10-14 11:56:02,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 1187.8ms TimeCoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:56:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-10-14 11:56:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2260. [2021-10-14 11:56:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:56:02,262 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:56:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:02,262 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:56:02,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:56:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:02,263 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:02,263 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:02,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-14 11:56:02,263 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1193386211, now seen corresponding path program 20 times [2021-10-14 11:56:02,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:02,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125262546] [2021-10-14 11:56:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:02,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:02,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:02,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125262546] [2021-10-14 11:56:02,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125262546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:02,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:02,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:56:02,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238612011] [2021-10-14 11:56:02,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:56:02,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:56:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:56:02,671 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:04,447 INFO L93 Difference]: Finished difference Result 2915 states and 5586 transitions. [2021-10-14 11:56:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-14 11:56:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:56:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:04,450 INFO L225 Difference]: With dead ends: 2915 [2021-10-14 11:56:04,450 INFO L226 Difference]: Without dead ends: 2915 [2021-10-14 11:56:04,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 1040.1ms TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2021-10-14 11:56:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2021-10-14 11:56:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2302. [2021-10-14 11:56:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2298 states have (on average 1.9194952132288947) internal successors, (4411), 2301 states have internal predecessors, (4411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 4411 transitions. [2021-10-14 11:56:04,470 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 4411 transitions. Word has length 128 [2021-10-14 11:56:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:04,470 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 4411 transitions. [2021-10-14 11:56:04,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 4411 transitions. [2021-10-14 11:56:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:04,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:04,472 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:04,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-14 11:56:04,472 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:04,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash 532258297, now seen corresponding path program 21 times [2021-10-14 11:56:04,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:04,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797762939] [2021-10-14 11:56:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:04,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:04,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:04,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797762939] [2021-10-14 11:56:04,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797762939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:04,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:04,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:04,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879317542] [2021-10-14 11:56:04,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:04,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:04,838 INFO L87 Difference]: Start difference. First operand 2302 states and 4411 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:06,677 INFO L93 Difference]: Finished difference Result 2953 states and 5660 transitions. [2021-10-14 11:56:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-14 11:56:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:06,680 INFO L225 Difference]: With dead ends: 2953 [2021-10-14 11:56:06,680 INFO L226 Difference]: Without dead ends: 2953 [2021-10-14 11:56:06,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1028.9ms TimeCoverageRelationStatistics Valid=842, Invalid=3988, Unknown=0, NotChecked=0, Total=4830 [2021-10-14 11:56:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2021-10-14 11:56:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2296. [2021-10-14 11:56:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2292 states have (on average 1.919284467713787) internal successors, (4399), 2295 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 4399 transitions. [2021-10-14 11:56:06,717 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 4399 transitions. Word has length 128 [2021-10-14 11:56:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:06,717 INFO L470 AbstractCegarLoop]: Abstraction has 2296 states and 4399 transitions. [2021-10-14 11:56:06,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 4399 transitions. [2021-10-14 11:56:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:06,719 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:06,719 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:06,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-14 11:56:06,719 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2121357475, now seen corresponding path program 22 times [2021-10-14 11:56:06,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:06,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630792256] [2021-10-14 11:56:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:06,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:07,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:07,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630792256] [2021-10-14 11:56:07,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630792256] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:07,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:07,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:07,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051751541] [2021-10-14 11:56:07,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:07,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:07,068 INFO L87 Difference]: Start difference. First operand 2296 states and 4399 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:08,858 INFO L93 Difference]: Finished difference Result 2986 states and 5724 transitions. [2021-10-14 11:56:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:56:08,859 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:08,861 INFO L225 Difference]: With dead ends: 2986 [2021-10-14 11:56:08,861 INFO L226 Difference]: Without dead ends: 2986 [2021-10-14 11:56:08,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1064.1ms TimeCoverageRelationStatistics Valid=868, Invalid=4244, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:56:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2021-10-14 11:56:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2290. [2021-10-14 11:56:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2286 states have (on average 1.9190726159230096) internal successors, (4387), 2289 states have internal predecessors, (4387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 4387 transitions. [2021-10-14 11:56:08,880 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 4387 transitions. Word has length 128 [2021-10-14 11:56:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:08,880 INFO L470 AbstractCegarLoop]: Abstraction has 2290 states and 4387 transitions. [2021-10-14 11:56:08,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4387 transitions. [2021-10-14 11:56:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:08,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:08,882 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:08,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-14 11:56:08,882 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash 371193273, now seen corresponding path program 23 times [2021-10-14 11:56:08,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:08,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288832400] [2021-10-14 11:56:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:08,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:09,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:09,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288832400] [2021-10-14 11:56:09,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288832400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:09,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:09,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:09,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346684163] [2021-10-14 11:56:09,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:09,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:09,224 INFO L87 Difference]: Start difference. First operand 2290 states and 4387 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:11,133 INFO L93 Difference]: Finished difference Result 3024 states and 5798 transitions. [2021-10-14 11:56:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:56:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:11,136 INFO L225 Difference]: With dead ends: 3024 [2021-10-14 11:56:11,136 INFO L226 Difference]: Without dead ends: 3024 [2021-10-14 11:56:11,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1096.5ms TimeCoverageRelationStatistics Valid=911, Invalid=4491, Unknown=0, NotChecked=0, Total=5402 [2021-10-14 11:56:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2021-10-14 11:56:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 2284. [2021-10-14 11:56:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2280 states have (on average 1.918859649122807) internal successors, (4375), 2283 states have internal predecessors, (4375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 4375 transitions. [2021-10-14 11:56:11,155 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 4375 transitions. Word has length 128 [2021-10-14 11:56:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:11,155 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 4375 transitions. [2021-10-14 11:56:11,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 4375 transitions. [2021-10-14 11:56:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:11,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:11,157 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:11,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-14 11:56:11,157 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -795299939, now seen corresponding path program 24 times [2021-10-14 11:56:11,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:11,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221717943] [2021-10-14 11:56:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:11,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:11,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:11,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221717943] [2021-10-14 11:56:11,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221717943] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:11,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:11,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:11,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894800468] [2021-10-14 11:56:11,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:11,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:11,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:11,569 INFO L87 Difference]: Start difference. First operand 2284 states and 4375 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:13,426 INFO L93 Difference]: Finished difference Result 3891 states and 7459 transitions. [2021-10-14 11:56:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-10-14 11:56:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:13,429 INFO L225 Difference]: With dead ends: 3891 [2021-10-14 11:56:13,429 INFO L226 Difference]: Without dead ends: 3891 [2021-10-14 11:56:13,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 1082.9ms TimeCoverageRelationStatistics Valid=936, Invalid=4614, Unknown=0, NotChecked=0, Total=5550 [2021-10-14 11:56:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2021-10-14 11:56:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 2260. [2021-10-14 11:56:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2256 states have (on average 1.9179964539007093) internal successors, (4327), 2259 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 4327 transitions. [2021-10-14 11:56:13,448 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 4327 transitions. Word has length 128 [2021-10-14 11:56:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:13,449 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 4327 transitions. [2021-10-14 11:56:13,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 4327 transitions. [2021-10-14 11:56:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:13,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:13,450 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:13,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-14 11:56:13,450 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 610585753, now seen corresponding path program 25 times [2021-10-14 11:56:13,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:13,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872498418] [2021-10-14 11:56:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:13,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:13,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:13,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872498418] [2021-10-14 11:56:13,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872498418] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:13,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:13,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:13,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729769222] [2021-10-14 11:56:13,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:13,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:13,688 INFO L87 Difference]: Start difference. First operand 2260 states and 4327 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:16,054 INFO L93 Difference]: Finished difference Result 5341 states and 10299 transitions. [2021-10-14 11:56:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-10-14 11:56:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:16,059 INFO L225 Difference]: With dead ends: 5341 [2021-10-14 11:56:16,059 INFO L226 Difference]: Without dead ends: 5341 [2021-10-14 11:56:16,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 1071.0ms TimeCoverageRelationStatistics Valid=1127, Invalid=8973, Unknown=0, NotChecked=0, Total=10100 [2021-10-14 11:56:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-10-14 11:56:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 2308. [2021-10-14 11:56:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2304 states have (on average 1.9197048611111112) internal successors, (4423), 2307 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4423 transitions. [2021-10-14 11:56:16,084 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4423 transitions. Word has length 128 [2021-10-14 11:56:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:16,085 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 4423 transitions. [2021-10-14 11:56:16,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4423 transitions. [2021-10-14 11:56:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:16,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:16,086 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:16,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-14 11:56:16,086 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash 119652025, now seen corresponding path program 26 times [2021-10-14 11:56:16,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:16,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230155580] [2021-10-14 11:56:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:16,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:16,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:16,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230155580] [2021-10-14 11:56:16,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230155580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:16,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:16,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:16,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869225502] [2021-10-14 11:56:16,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:16,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:16,327 INFO L87 Difference]: Start difference. First operand 2308 states and 4423 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:19,191 INFO L93 Difference]: Finished difference Result 5616 states and 10848 transitions. [2021-10-14 11:56:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-10-14 11:56:19,192 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:19,197 INFO L225 Difference]: With dead ends: 5616 [2021-10-14 11:56:19,197 INFO L226 Difference]: Without dead ends: 5616 [2021-10-14 11:56:19,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4323 ImplicationChecksByTransitivity, 1246.5ms TimeCoverageRelationStatistics Valid=1385, Invalid=11047, Unknown=0, NotChecked=0, Total=12432 [2021-10-14 11:56:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2021-10-14 11:56:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 2320. [2021-10-14 11:56:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2316 states have (on average 1.9201208981001727) internal successors, (4447), 2319 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4447 transitions. [2021-10-14 11:56:19,234 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4447 transitions. Word has length 128 [2021-10-14 11:56:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:19,234 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 4447 transitions. [2021-10-14 11:56:19,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4447 transitions. [2021-10-14 11:56:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:19,235 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:19,235 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:19,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-14 11:56:19,235 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1619783137, now seen corresponding path program 27 times [2021-10-14 11:56:19,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:19,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815706516] [2021-10-14 11:56:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:19,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:19,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:19,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815706516] [2021-10-14 11:56:19,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815706516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:19,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:19,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:19,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365971261] [2021-10-14 11:56:19,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:19,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:19,453 INFO L87 Difference]: Start difference. First operand 2320 states and 4447 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:20,925 INFO L93 Difference]: Finished difference Result 4373 states and 8443 transitions. [2021-10-14 11:56:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:56:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:20,930 INFO L225 Difference]: With dead ends: 4373 [2021-10-14 11:56:20,930 INFO L226 Difference]: Without dead ends: 4373 [2021-10-14 11:56:20,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 631.1ms TimeCoverageRelationStatistics Valid=603, Invalid=3953, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:56:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2021-10-14 11:56:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 2344. [2021-10-14 11:56:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2340 states have (on average 1.920940170940171) internal successors, (4495), 2343 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 4495 transitions. [2021-10-14 11:56:20,951 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 4495 transitions. Word has length 128 [2021-10-14 11:56:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:20,951 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 4495 transitions. [2021-10-14 11:56:20,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 4495 transitions. [2021-10-14 11:56:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:20,953 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:20,953 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:20,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-14 11:56:20,953 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash 424016769, now seen corresponding path program 28 times [2021-10-14 11:56:20,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:20,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84881428] [2021-10-14 11:56:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:20,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:21,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:21,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84881428] [2021-10-14 11:56:21,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84881428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:21,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:21,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:21,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898774294] [2021-10-14 11:56:21,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:21,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:21,177 INFO L87 Difference]: Start difference. First operand 2344 states and 4495 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:22,874 INFO L93 Difference]: Finished difference Result 3379 states and 6531 transitions. [2021-10-14 11:56:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-10-14 11:56:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:22,877 INFO L225 Difference]: With dead ends: 3379 [2021-10-14 11:56:22,877 INFO L226 Difference]: Without dead ends: 3379 [2021-10-14 11:56:22,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 648.7ms TimeCoverageRelationStatistics Valid=555, Invalid=3477, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:56:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2021-10-14 11:56:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2345. [2021-10-14 11:56:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2341 states have (on average 1.9209739427595045) internal successors, (4497), 2344 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4497 transitions. [2021-10-14 11:56:22,897 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4497 transitions. Word has length 128 [2021-10-14 11:56:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:22,898 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 4497 transitions. [2021-10-14 11:56:22,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4497 transitions. [2021-10-14 11:56:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:22,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:22,899 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:22,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-14 11:56:22,899 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash 83184699, now seen corresponding path program 29 times [2021-10-14 11:56:22,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:22,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417541165] [2021-10-14 11:56:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:22,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:23,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:23,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417541165] [2021-10-14 11:56:23,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417541165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:23,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:23,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:23,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480064816] [2021-10-14 11:56:23,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:23,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:23,127 INFO L87 Difference]: Start difference. First operand 2345 states and 4497 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:24,773 INFO L93 Difference]: Finished difference Result 3341 states and 6457 transitions. [2021-10-14 11:56:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-10-14 11:56:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:24,776 INFO L225 Difference]: With dead ends: 3341 [2021-10-14 11:56:24,776 INFO L226 Difference]: Without dead ends: 3341 [2021-10-14 11:56:24,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 665.6ms TimeCoverageRelationStatistics Valid=563, Invalid=3469, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:56:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2021-10-14 11:56:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 2346. [2021-10-14 11:56:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2342 states have (on average 1.9210076857386849) internal successors, (4499), 2345 states have internal predecessors, (4499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 4499 transitions. [2021-10-14 11:56:24,795 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 4499 transitions. Word has length 128 [2021-10-14 11:56:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:24,795 INFO L470 AbstractCegarLoop]: Abstraction has 2346 states and 4499 transitions. [2021-10-14 11:56:24,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 4499 transitions. [2021-10-14 11:56:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:24,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:24,797 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:24,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-14 11:56:24,797 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:24,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash -558416413, now seen corresponding path program 30 times [2021-10-14 11:56:24,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:24,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600710545] [2021-10-14 11:56:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:24,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:25,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:25,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600710545] [2021-10-14 11:56:25,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600710545] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:25,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:25,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:25,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699180995] [2021-10-14 11:56:25,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:25,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:25,020 INFO L87 Difference]: Start difference. First operand 2346 states and 4499 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:26,489 INFO L93 Difference]: Finished difference Result 3277 states and 6333 transitions. [2021-10-14 11:56:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-14 11:56:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:26,493 INFO L225 Difference]: With dead ends: 3277 [2021-10-14 11:56:26,493 INFO L226 Difference]: Without dead ends: 3277 [2021-10-14 11:56:26,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 663.8ms TimeCoverageRelationStatistics Valid=579, Invalid=3453, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:56:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2021-10-14 11:56:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2338. [2021-10-14 11:56:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2334 states have (on average 1.9207369323050556) internal successors, (4483), 2337 states have internal predecessors, (4483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 4483 transitions. [2021-10-14 11:56:26,512 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 4483 transitions. Word has length 128 [2021-10-14 11:56:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:26,512 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 4483 transitions. [2021-10-14 11:56:26,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 4483 transitions. [2021-10-14 11:56:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:26,513 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:26,513 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:26,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-14 11:56:26,513 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash -762433533, now seen corresponding path program 31 times [2021-10-14 11:56:26,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:26,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987930190] [2021-10-14 11:56:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:26,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:26,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:26,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987930190] [2021-10-14 11:56:26,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987930190] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:26,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:26,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:56:26,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255453495] [2021-10-14 11:56:26,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:56:26,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:56:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:56:26,821 INFO L87 Difference]: Start difference. First operand 2338 states and 4483 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:28,720 INFO L93 Difference]: Finished difference Result 3960 states and 7656 transitions. [2021-10-14 11:56:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:56:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:56:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:28,723 INFO L225 Difference]: With dead ends: 3960 [2021-10-14 11:56:28,723 INFO L226 Difference]: Without dead ends: 3960 [2021-10-14 11:56:28,723 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 1011.9ms TimeCoverageRelationStatistics Valid=772, Invalid=4484, Unknown=0, NotChecked=0, Total=5256 [2021-10-14 11:56:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2021-10-14 11:56:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2356. [2021-10-14 11:56:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2352 states have (on average 1.9213435374149659) internal successors, (4519), 2355 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 4519 transitions. [2021-10-14 11:56:28,743 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 4519 transitions. Word has length 128 [2021-10-14 11:56:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:28,743 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 4519 transitions. [2021-10-14 11:56:28,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 4519 transitions. [2021-10-14 11:56:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:28,745 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:28,745 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:28,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-14 11:56:28,745 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -12318601, now seen corresponding path program 32 times [2021-10-14 11:56:28,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:28,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932229704] [2021-10-14 11:56:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:28,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:29,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:29,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932229704] [2021-10-14 11:56:29,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932229704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:29,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:29,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:29,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167847637] [2021-10-14 11:56:29,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:29,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:29,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:29,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:29,030 INFO L87 Difference]: Start difference. First operand 2356 states and 4519 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:30,964 INFO L93 Difference]: Finished difference Result 3997 states and 7728 transitions. [2021-10-14 11:56:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:56:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:30,968 INFO L225 Difference]: With dead ends: 3997 [2021-10-14 11:56:30,968 INFO L226 Difference]: Without dead ends: 3997 [2021-10-14 11:56:30,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 1045.8ms TimeCoverageRelationStatistics Valid=792, Invalid=4320, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:56:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2021-10-14 11:56:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 2350. [2021-10-14 11:56:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2346 states have (on average 1.921142369991475) internal successors, (4507), 2349 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 4507 transitions. [2021-10-14 11:56:30,989 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 4507 transitions. Word has length 128 [2021-10-14 11:56:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:30,989 INFO L470 AbstractCegarLoop]: Abstraction has 2350 states and 4507 transitions. [2021-10-14 11:56:30,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 4507 transitions. [2021-10-14 11:56:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:30,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:30,991 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:30,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-14 11:56:30,991 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2092004035, now seen corresponding path program 33 times [2021-10-14 11:56:30,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:30,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817594622] [2021-10-14 11:56:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:30,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:31,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:31,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817594622] [2021-10-14 11:56:31,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817594622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:31,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:31,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:31,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019861236] [2021-10-14 11:56:31,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:31,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:31,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:31,285 INFO L87 Difference]: Start difference. First operand 2350 states and 4507 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:33,231 INFO L93 Difference]: Finished difference Result 4062 states and 7854 transitions. [2021-10-14 11:56:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-14 11:56:33,232 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:33,235 INFO L225 Difference]: With dead ends: 4062 [2021-10-14 11:56:33,235 INFO L226 Difference]: Without dead ends: 4062 [2021-10-14 11:56:33,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 1069.6ms TimeCoverageRelationStatistics Valid=802, Invalid=4600, Unknown=0, NotChecked=0, Total=5402 [2021-10-14 11:56:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2021-10-14 11:56:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 2344. [2021-10-14 11:56:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2340 states have (on average 1.920940170940171) internal successors, (4495), 2343 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 4495 transitions. [2021-10-14 11:56:33,257 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 4495 transitions. Word has length 128 [2021-10-14 11:56:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:33,257 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 4495 transitions. [2021-10-14 11:56:33,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 4495 transitions. [2021-10-14 11:56:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:33,258 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:33,258 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:33,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-14 11:56:33,259 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 110077367, now seen corresponding path program 34 times [2021-10-14 11:56:33,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:33,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591046780] [2021-10-14 11:56:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:33,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:33,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:33,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591046780] [2021-10-14 11:56:33,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591046780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:33,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:33,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:33,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677991650] [2021-10-14 11:56:33,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:33,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:33,539 INFO L87 Difference]: Start difference. First operand 2344 states and 4495 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:35,501 INFO L93 Difference]: Finished difference Result 4030 states and 7792 transitions. [2021-10-14 11:56:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-10-14 11:56:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:35,505 INFO L225 Difference]: With dead ends: 4030 [2021-10-14 11:56:35,505 INFO L226 Difference]: Without dead ends: 4030 [2021-10-14 11:56:35,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 1094.1ms TimeCoverageRelationStatistics Valid=829, Invalid=4871, Unknown=0, NotChecked=0, Total=5700 [2021-10-14 11:56:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2021-10-14 11:56:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 2308. [2021-10-14 11:56:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2304 states have (on average 1.9197048611111112) internal successors, (4423), 2307 states have internal predecessors, (4423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4423 transitions. [2021-10-14 11:56:35,524 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4423 transitions. Word has length 128 [2021-10-14 11:56:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:35,525 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 4423 transitions. [2021-10-14 11:56:35,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4423 transitions. [2021-10-14 11:56:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:35,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:35,527 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:35,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-14 11:56:35,527 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1740487033, now seen corresponding path program 35 times [2021-10-14 11:56:35,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:35,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087510881] [2021-10-14 11:56:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:35,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:35,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:35,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087510881] [2021-10-14 11:56:35,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087510881] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:35,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:35,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:35,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324926999] [2021-10-14 11:56:35,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:35,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:35,748 INFO L87 Difference]: Start difference. First operand 2308 states and 4423 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:38,040 INFO L93 Difference]: Finished difference Result 5297 states and 10219 transitions. [2021-10-14 11:56:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-10-14 11:56:38,041 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:38,046 INFO L225 Difference]: With dead ends: 5297 [2021-10-14 11:56:38,046 INFO L226 Difference]: Without dead ends: 5297 [2021-10-14 11:56:38,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3259 ImplicationChecksByTransitivity, 1052.8ms TimeCoverageRelationStatistics Valid=1128, Invalid=8574, Unknown=0, NotChecked=0, Total=9702 [2021-10-14 11:56:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2021-10-14 11:56:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 2332. [2021-10-14 11:56:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2328 states have (on average 1.92053264604811) internal successors, (4471), 2331 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 4471 transitions. [2021-10-14 11:56:38,079 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 4471 transitions. Word has length 128 [2021-10-14 11:56:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:38,080 INFO L470 AbstractCegarLoop]: Abstraction has 2332 states and 4471 transitions. [2021-10-14 11:56:38,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 4471 transitions. [2021-10-14 11:56:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:38,081 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:38,081 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:38,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-14 11:56:38,081 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:38,082 INFO L82 PathProgramCache]: Analyzing trace with hash -969069157, now seen corresponding path program 36 times [2021-10-14 11:56:38,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:38,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171352] [2021-10-14 11:56:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:38,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:38,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:38,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171352] [2021-10-14 11:56:38,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:38,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:38,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:38,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794396901] [2021-10-14 11:56:38,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:38,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:38,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:38,292 INFO L87 Difference]: Start difference. First operand 2332 states and 4471 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:40,417 INFO L93 Difference]: Finished difference Result 5228 states and 10086 transitions. [2021-10-14 11:56:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-10-14 11:56:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:40,422 INFO L225 Difference]: With dead ends: 5228 [2021-10-14 11:56:40,422 INFO L226 Difference]: Without dead ends: 5228 [2021-10-14 11:56:40,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 996.1ms TimeCoverageRelationStatistics Valid=1034, Invalid=7522, Unknown=0, NotChecked=0, Total=8556 [2021-10-14 11:56:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2021-10-14 11:56:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 2344. [2021-10-14 11:56:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2340 states have (on average 1.920940170940171) internal successors, (4495), 2343 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 4495 transitions. [2021-10-14 11:56:40,446 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 4495 transitions. Word has length 128 [2021-10-14 11:56:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:40,446 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 4495 transitions. [2021-10-14 11:56:40,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 4495 transitions. [2021-10-14 11:56:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:40,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:40,448 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:40,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-14 11:56:40,448 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1586462977, now seen corresponding path program 37 times [2021-10-14 11:56:40,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:40,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885771314] [2021-10-14 11:56:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:40,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:40,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:40,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885771314] [2021-10-14 11:56:40,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885771314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:40,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:40,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:40,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964764101] [2021-10-14 11:56:40,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:40,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:40,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:40,654 INFO L87 Difference]: Start difference. First operand 2344 states and 4495 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:42,022 INFO L93 Difference]: Finished difference Result 4009 states and 7729 transitions. [2021-10-14 11:56:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-14 11:56:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:42,026 INFO L225 Difference]: With dead ends: 4009 [2021-10-14 11:56:42,026 INFO L226 Difference]: Without dead ends: 4009 [2021-10-14 11:56:42,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 514.0ms TimeCoverageRelationStatistics Valid=445, Invalid=2747, Unknown=0, NotChecked=0, Total=3192 [2021-10-14 11:56:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2021-10-14 11:56:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 2368. [2021-10-14 11:56:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2364 states have (on average 1.9217428087986463) internal successors, (4543), 2367 states have internal predecessors, (4543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 4543 transitions. [2021-10-14 11:56:42,058 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 4543 transitions. Word has length 128 [2021-10-14 11:56:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:42,058 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 4543 transitions. [2021-10-14 11:56:42,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 4543 transitions. [2021-10-14 11:56:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:42,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:42,059 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:42,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-14 11:56:42,060 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash -664704413, now seen corresponding path program 38 times [2021-10-14 11:56:42,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:42,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113966223] [2021-10-14 11:56:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:42,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:42,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:42,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113966223] [2021-10-14 11:56:42,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113966223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:42,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:42,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:42,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607943503] [2021-10-14 11:56:42,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:42,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:42,297 INFO L87 Difference]: Start difference. First operand 2368 states and 4543 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:43,548 INFO L93 Difference]: Finished difference Result 3015 states and 5817 transitions. [2021-10-14 11:56:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-14 11:56:43,549 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:43,551 INFO L225 Difference]: With dead ends: 3015 [2021-10-14 11:56:43,551 INFO L226 Difference]: Without dead ends: 3015 [2021-10-14 11:56:43,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 557.5ms TimeCoverageRelationStatistics Valid=418, Invalid=2552, Unknown=0, NotChecked=0, Total=2970 [2021-10-14 11:56:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2021-10-14 11:56:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2369. [2021-10-14 11:56:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2365 states have (on average 1.9217758985200846) internal successors, (4545), 2368 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4545 transitions. [2021-10-14 11:56:43,569 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4545 transitions. Word has length 128 [2021-10-14 11:56:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:43,569 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4545 transitions. [2021-10-14 11:56:43,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4545 transitions. [2021-10-14 11:56:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:43,571 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:43,571 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:43,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-14 11:56:43,571 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1005536483, now seen corresponding path program 39 times [2021-10-14 11:56:43,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:43,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739556719] [2021-10-14 11:56:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:43,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:43,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:43,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739556719] [2021-10-14 11:56:43,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739556719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:43,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:43,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:43,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330994013] [2021-10-14 11:56:43,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:43,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:43,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:43,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:43,791 INFO L87 Difference]: Start difference. First operand 2369 states and 4545 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:45,016 INFO L93 Difference]: Finished difference Result 2977 states and 5743 transitions. [2021-10-14 11:56:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:56:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:45,019 INFO L225 Difference]: With dead ends: 2977 [2021-10-14 11:56:45,019 INFO L226 Difference]: Without dead ends: 2977 [2021-10-14 11:56:45,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 567.8ms TimeCoverageRelationStatistics Valid=424, Invalid=2546, Unknown=0, NotChecked=0, Total=2970 [2021-10-14 11:56:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2021-10-14 11:56:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2370. [2021-10-14 11:56:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2366 states have (on average 1.9218089602704986) internal successors, (4547), 2369 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 4547 transitions. [2021-10-14 11:56:45,037 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 4547 transitions. Word has length 128 [2021-10-14 11:56:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:45,037 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 4547 transitions. [2021-10-14 11:56:45,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 4547 transitions. [2021-10-14 11:56:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:45,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:45,039 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:45,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-14 11:56:45,039 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1647137595, now seen corresponding path program 40 times [2021-10-14 11:56:45,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:45,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064384036] [2021-10-14 11:56:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:45,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:45,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:45,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064384036] [2021-10-14 11:56:45,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064384036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:45,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:45,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:56:45,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427595476] [2021-10-14 11:56:45,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:56:45,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:56:45,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:56:45,277 INFO L87 Difference]: Start difference. First operand 2370 states and 4547 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:46,464 INFO L93 Difference]: Finished difference Result 2918 states and 5629 transitions. [2021-10-14 11:56:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-14 11:56:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:56:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:46,467 INFO L225 Difference]: With dead ends: 2918 [2021-10-14 11:56:46,467 INFO L226 Difference]: Without dead ends: 2918 [2021-10-14 11:56:46,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 579.6ms TimeCoverageRelationStatistics Valid=438, Invalid=2532, Unknown=0, NotChecked=0, Total=2970 [2021-10-14 11:56:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2021-10-14 11:56:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2359. [2021-10-14 11:56:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2355 states have (on average 1.921443736730361) internal successors, (4525), 2358 states have internal predecessors, (4525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4525 transitions. [2021-10-14 11:56:46,485 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4525 transitions. Word has length 128 [2021-10-14 11:56:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:46,485 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4525 transitions. [2021-10-14 11:56:46,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:56:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4525 transitions. [2021-10-14 11:56:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:46,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:46,486 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:46,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-14 11:56:46,487 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 101888039, now seen corresponding path program 41 times [2021-10-14 11:56:46,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:46,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154248525] [2021-10-14 11:56:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:46,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:46,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:46,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154248525] [2021-10-14 11:56:46,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154248525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:46,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:46,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:56:46,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036594562] [2021-10-14 11:56:46,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:56:46,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:56:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:56:46,829 INFO L87 Difference]: Start difference. First operand 2359 states and 4525 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:48,351 INFO L93 Difference]: Finished difference Result 3444 states and 6681 transitions. [2021-10-14 11:56:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:56:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:56:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:48,355 INFO L225 Difference]: With dead ends: 3444 [2021-10-14 11:56:48,355 INFO L226 Difference]: Without dead ends: 3444 [2021-10-14 11:56:48,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 833.9ms TimeCoverageRelationStatistics Valid=560, Invalid=3100, Unknown=0, NotChecked=0, Total=3660 [2021-10-14 11:56:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2021-10-14 11:56:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 2377. [2021-10-14 11:56:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 2373 states have (on average 1.9220396123050991) internal successors, (4561), 2376 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 4561 transitions. [2021-10-14 11:56:48,375 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 4561 transitions. Word has length 128 [2021-10-14 11:56:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:48,375 INFO L470 AbstractCegarLoop]: Abstraction has 2377 states and 4561 transitions. [2021-10-14 11:56:48,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:56:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 4561 transitions. [2021-10-14 11:56:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:48,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:48,376 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:48,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-14 11:56:48,377 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash 852002971, now seen corresponding path program 42 times [2021-10-14 11:56:48,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:48,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698312155] [2021-10-14 11:56:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:48,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:48,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:48,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698312155] [2021-10-14 11:56:48,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698312155] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:48,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:48,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:48,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645325281] [2021-10-14 11:56:48,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:48,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:48,680 INFO L87 Difference]: Start difference. First operand 2377 states and 4561 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:50,296 INFO L93 Difference]: Finished difference Result 3481 states and 6753 transitions. [2021-10-14 11:56:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:56:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:50,300 INFO L225 Difference]: With dead ends: 3481 [2021-10-14 11:56:50,300 INFO L226 Difference]: Without dead ends: 3481 [2021-10-14 11:56:50,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 833.5ms TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2021-10-14 11:56:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2021-10-14 11:56:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 2371. [2021-10-14 11:56:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2367 states have (on average 1.9218419940853402) internal successors, (4549), 2370 states have internal predecessors, (4549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4549 transitions. [2021-10-14 11:56:50,319 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4549 transitions. Word has length 128 [2021-10-14 11:56:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:50,319 INFO L470 AbstractCegarLoop]: Abstraction has 2371 states and 4549 transitions. [2021-10-14 11:56:50,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4549 transitions. [2021-10-14 11:56:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:50,320 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:50,320 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:50,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-14 11:56:50,321 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1338641689, now seen corresponding path program 43 times [2021-10-14 11:56:50,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:50,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768173901] [2021-10-14 11:56:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:50,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:50,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:50,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768173901] [2021-10-14 11:56:50,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768173901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:50,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:50,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:50,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256897371] [2021-10-14 11:56:50,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:50,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:50,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:50,593 INFO L87 Difference]: Start difference. First operand 2371 states and 4549 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:52,400 INFO L93 Difference]: Finished difference Result 3546 states and 6879 transitions. [2021-10-14 11:56:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-14 11:56:52,401 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:52,404 INFO L225 Difference]: With dead ends: 3546 [2021-10-14 11:56:52,404 INFO L226 Difference]: Without dead ends: 3546 [2021-10-14 11:56:52,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 845.2ms TimeCoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2021-10-14 11:56:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2021-10-14 11:56:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 2365. [2021-10-14 11:56:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 2361 states have (on average 1.9216433714527743) internal successors, (4537), 2364 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 4537 transitions. [2021-10-14 11:56:52,425 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 4537 transitions. Word has length 128 [2021-10-14 11:56:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:52,425 INFO L470 AbstractCegarLoop]: Abstraction has 2365 states and 4537 transitions. [2021-10-14 11:56:52,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 4537 transitions. [2021-10-14 11:56:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:52,427 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:52,427 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:52,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-14 11:56:52,427 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash 974398939, now seen corresponding path program 44 times [2021-10-14 11:56:52,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:52,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800287562] [2021-10-14 11:56:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:52,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:52,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:52,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800287562] [2021-10-14 11:56:52,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800287562] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:52,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:52,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:56:52,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583251354] [2021-10-14 11:56:52,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:56:52,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:56:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:56:52,696 INFO L87 Difference]: Start difference. First operand 2365 states and 4537 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:54,439 INFO L93 Difference]: Finished difference Result 3602 states and 6988 transitions. [2021-10-14 11:56:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-10-14 11:56:54,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:56:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:54,442 INFO L225 Difference]: With dead ends: 3602 [2021-10-14 11:56:54,442 INFO L226 Difference]: Without dead ends: 3602 [2021-10-14 11:56:54,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 827.3ms TimeCoverageRelationStatistics Valid=559, Invalid=3101, Unknown=0, NotChecked=0, Total=3660 [2021-10-14 11:56:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2021-10-14 11:56:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2314. [2021-10-14 11:56:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2310 states have (on average 1.91991341991342) internal successors, (4435), 2313 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 4435 transitions. [2021-10-14 11:56:54,461 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 4435 transitions. Word has length 128 [2021-10-14 11:56:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:54,462 INFO L470 AbstractCegarLoop]: Abstraction has 2314 states and 4435 transitions. [2021-10-14 11:56:54,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:56:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 4435 transitions. [2021-10-14 11:56:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:54,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:54,463 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:54,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-14 11:56:54,463 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash 619910841, now seen corresponding path program 45 times [2021-10-14 11:56:54,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:54,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401387363] [2021-10-14 11:56:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:54,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:54,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:54,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401387363] [2021-10-14 11:56:54,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401387363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:54,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:54,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:54,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044594319] [2021-10-14 11:56:54,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:54,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:54,698 INFO L87 Difference]: Start difference. First operand 2314 states and 4435 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:56,416 INFO L93 Difference]: Finished difference Result 3681 states and 7076 transitions. [2021-10-14 11:56:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-10-14 11:56:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:56,420 INFO L225 Difference]: With dead ends: 3681 [2021-10-14 11:56:56,420 INFO L226 Difference]: Without dead ends: 3681 [2021-10-14 11:56:56,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 746.2ms TimeCoverageRelationStatistics Valid=727, Invalid=4529, Unknown=0, NotChecked=0, Total=5256 [2021-10-14 11:56:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2021-10-14 11:56:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2324. [2021-10-14 11:56:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2320 states have (on average 1.9202586206896552) internal successors, (4455), 2323 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 4455 transitions. [2021-10-14 11:56:56,440 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 4455 transitions. Word has length 128 [2021-10-14 11:56:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:56,440 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 4455 transitions. [2021-10-14 11:56:56,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 4455 transitions. [2021-10-14 11:56:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:56,441 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:56,441 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:56,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-14 11:56:56,441 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1367690897, now seen corresponding path program 46 times [2021-10-14 11:56:56,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:56,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60532509] [2021-10-14 11:56:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:56,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:56,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:56,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60532509] [2021-10-14 11:56:56,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60532509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:56,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:56,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:56,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247161623] [2021-10-14 11:56:56,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:56,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:56,650 INFO L87 Difference]: Start difference. First operand 2324 states and 4455 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:59,330 INFO L93 Difference]: Finished difference Result 6313 states and 12232 transitions. [2021-10-14 11:56:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-10-14 11:56:59,330 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:56:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:59,336 INFO L225 Difference]: With dead ends: 6313 [2021-10-14 11:56:59,336 INFO L226 Difference]: Without dead ends: 6313 [2021-10-14 11:56:59,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 1246.4ms TimeCoverageRelationStatistics Valid=1511, Invalid=8389, Unknown=0, NotChecked=0, Total=9900 [2021-10-14 11:56:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2021-10-14 11:56:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 2324. [2021-10-14 11:56:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2320 states have (on average 1.9202586206896552) internal successors, (4455), 2323 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:56:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 4455 transitions. [2021-10-14 11:56:59,363 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 4455 transitions. Word has length 128 [2021-10-14 11:56:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:59,363 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 4455 transitions. [2021-10-14 11:56:59,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:56:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 4455 transitions. [2021-10-14 11:56:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:56:59,364 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:59,364 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-14 11:56:59,364 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:56:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1341865293, now seen corresponding path program 47 times [2021-10-14 11:56:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:59,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315614612] [2021-10-14 11:56:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:59,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:56:59,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:59,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315614612] [2021-10-14 11:56:59,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315614612] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:59,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:59,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:56:59,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544688400] [2021-10-14 11:56:59,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:56:59,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:59,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:56:59,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:56:59,581 INFO L87 Difference]: Start difference. First operand 2324 states and 4455 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:57:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:02,066 INFO L93 Difference]: Finished difference Result 6244 states and 12099 transitions. [2021-10-14 11:57:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-10-14 11:57:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:57:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:02,072 INFO L225 Difference]: With dead ends: 6244 [2021-10-14 11:57:02,072 INFO L226 Difference]: Without dead ends: 6244 [2021-10-14 11:57:02,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 1217.7ms TimeCoverageRelationStatistics Valid=1404, Invalid=7716, Unknown=0, NotChecked=0, Total=9120 [2021-10-14 11:57:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6244 states. [2021-10-14 11:57:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6244 to 2324. [2021-10-14 11:57:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2320 states have (on average 1.9202586206896552) internal successors, (4455), 2323 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 4455 transitions. [2021-10-14 11:57:02,101 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 4455 transitions. Word has length 128 [2021-10-14 11:57:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:02,101 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 4455 transitions. [2021-10-14 11:57:02,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:57:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 4455 transitions. [2021-10-14 11:57:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:02,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:02,102 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:02,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-14 11:57:02,102 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1213666841, now seen corresponding path program 48 times [2021-10-14 11:57:02,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:02,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832026914] [2021-10-14 11:57:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:02,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:02,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:02,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832026914] [2021-10-14 11:57:02,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832026914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:02,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:02,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:02,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789400120] [2021-10-14 11:57:02,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:02,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:02,306 INFO L87 Difference]: Start difference. First operand 2324 states and 4455 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:03,831 INFO L93 Difference]: Finished difference Result 4993 states and 9678 transitions. [2021-10-14 11:57:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:57:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:57:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:03,836 INFO L225 Difference]: With dead ends: 4993 [2021-10-14 11:57:03,836 INFO L226 Difference]: Without dead ends: 4993 [2021-10-14 11:57:03,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 526.1ms TimeCoverageRelationStatistics Valid=496, Invalid=2366, Unknown=0, NotChecked=0, Total=2862 [2021-10-14 11:57:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2021-10-14 11:57:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 2324. [2021-10-14 11:57:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2320 states have (on average 1.9202586206896552) internal successors, (4455), 2323 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 4455 transitions. [2021-10-14 11:57:03,867 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 4455 transitions. Word has length 128 [2021-10-14 11:57:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:03,868 INFO L470 AbstractCegarLoop]: Abstraction has 2324 states and 4455 transitions. [2021-10-14 11:57:03,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 4455 transitions. [2021-10-14 11:57:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:03,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:03,869 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:03,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-14 11:57:03,869 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1037500549, now seen corresponding path program 49 times [2021-10-14 11:57:03,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:03,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079880659] [2021-10-14 11:57:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:03,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:04,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:04,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079880659] [2021-10-14 11:57:04,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079880659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:04,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:04,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:04,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44592225] [2021-10-14 11:57:04,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:04,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:04,110 INFO L87 Difference]: Start difference. First operand 2324 states and 4455 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:05,369 INFO L93 Difference]: Finished difference Result 3999 states and 7766 transitions. [2021-10-14 11:57:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-14 11:57:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:57:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:05,373 INFO L225 Difference]: With dead ends: 3999 [2021-10-14 11:57:05,373 INFO L226 Difference]: Without dead ends: 3999 [2021-10-14 11:57:05,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 570.1ms TimeCoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2021-10-14 11:57:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2021-10-14 11:57:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 2325. [2021-10-14 11:57:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2321 states have (on average 1.920292977165015) internal successors, (4457), 2324 states have internal predecessors, (4457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4457 transitions. [2021-10-14 11:57:05,393 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4457 transitions. Word has length 128 [2021-10-14 11:57:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:05,393 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4457 transitions. [2021-10-14 11:57:05,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4457 transitions. [2021-10-14 11:57:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:05,394 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:05,394 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:05,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-14 11:57:05,395 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1378332619, now seen corresponding path program 50 times [2021-10-14 11:57:05,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:05,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808315438] [2021-10-14 11:57:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:05,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:05,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:05,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808315438] [2021-10-14 11:57:05,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808315438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:05,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:05,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:05,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720753176] [2021-10-14 11:57:05,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:05,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:05,600 INFO L87 Difference]: Start difference. First operand 2325 states and 4457 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:06,845 INFO L93 Difference]: Finished difference Result 3961 states and 7692 transitions. [2021-10-14 11:57:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-14 11:57:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:57:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:06,849 INFO L225 Difference]: With dead ends: 3961 [2021-10-14 11:57:06,849 INFO L226 Difference]: Without dead ends: 3961 [2021-10-14 11:57:06,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 519.0ms TimeCoverageRelationStatistics Valid=383, Invalid=1873, Unknown=0, NotChecked=0, Total=2256 [2021-10-14 11:57:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2021-10-14 11:57:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 2326. [2021-10-14 11:57:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2322 states have (on average 1.9203273040482343) internal successors, (4459), 2325 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 4459 transitions. [2021-10-14 11:57:06,869 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 4459 transitions. Word has length 128 [2021-10-14 11:57:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:06,869 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 4459 transitions. [2021-10-14 11:57:06,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 4459 transitions. [2021-10-14 11:57:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:06,870 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:06,870 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:06,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-14 11:57:06,871 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2019933731, now seen corresponding path program 51 times [2021-10-14 11:57:06,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:06,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610829896] [2021-10-14 11:57:06,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:06,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:07,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:07,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610829896] [2021-10-14 11:57:07,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610829896] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:07,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:07,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:07,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230942686] [2021-10-14 11:57:07,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:07,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:07,086 INFO L87 Difference]: Start difference. First operand 2326 states and 4459 transitions. Second operand has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:08,309 INFO L93 Difference]: Finished difference Result 3902 states and 7578 transitions. [2021-10-14 11:57:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-14 11:57:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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 128 [2021-10-14 11:57:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:08,313 INFO L225 Difference]: With dead ends: 3902 [2021-10-14 11:57:08,313 INFO L226 Difference]: Without dead ends: 3902 [2021-10-14 11:57:08,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 487.6ms TimeCoverageRelationStatistics Valid=358, Invalid=1712, Unknown=0, NotChecked=0, Total=2070 [2021-10-14 11:57:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2021-10-14 11:57:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 2315. [2021-10-14 11:57:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2311 states have (on average 1.919948074426655) internal successors, (4437), 2314 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 4437 transitions. [2021-10-14 11:57:08,334 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 4437 transitions. Word has length 128 [2021-10-14 11:57:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:08,335 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 4437 transitions. [2021-10-14 11:57:08,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 20 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) [2021-10-14 11:57:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 4437 transitions. [2021-10-14 11:57:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:08,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:08,336 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:08,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-14 11:57:08,336 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -270908097, now seen corresponding path program 52 times [2021-10-14 11:57:08,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:08,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619739940] [2021-10-14 11:57:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:08,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:08,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:08,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619739940] [2021-10-14 11:57:08,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619739940] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:08,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:08,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:57:08,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076550614] [2021-10-14 11:57:08,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:57:08,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:08,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:57:08,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:57:08,631 INFO L87 Difference]: Start difference. First operand 2315 states and 4437 transitions. Second operand has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:57:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:09,992 INFO L93 Difference]: Finished difference Result 4428 states and 8630 transitions. [2021-10-14 11:57:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-14 11:57:09,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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 128 [2021-10-14 11:57:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:09,997 INFO L225 Difference]: With dead ends: 4428 [2021-10-14 11:57:09,997 INFO L226 Difference]: Without dead ends: 4428 [2021-10-14 11:57:09,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 668.8ms TimeCoverageRelationStatistics Valid=420, Invalid=2030, Unknown=0, NotChecked=0, Total=2450 [2021-10-14 11:57:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2021-10-14 11:57:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 2309. [2021-10-14 11:57:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2305 states have (on average 1.9197396963123645) internal successors, (4425), 2308 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 4425 transitions. [2021-10-14 11:57:10,018 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 4425 transitions. Word has length 128 [2021-10-14 11:57:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:10,018 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 4425 transitions. [2021-10-14 11:57:10,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 23 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) [2021-10-14 11:57:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 4425 transitions. [2021-10-14 11:57:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:10,020 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:10,020 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:10,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-14 11:57:10,020 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash 479206835, now seen corresponding path program 53 times [2021-10-14 11:57:10,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:10,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028314516] [2021-10-14 11:57:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:10,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:10,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:10,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028314516] [2021-10-14 11:57:10,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028314516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:10,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:10,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:10,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138838275] [2021-10-14 11:57:10,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:10,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:10,313 INFO L87 Difference]: Start difference. First operand 2309 states and 4425 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:11,753 INFO L93 Difference]: Finished difference Result 4465 states and 8702 transitions. [2021-10-14 11:57:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-14 11:57:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:57:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:11,758 INFO L225 Difference]: With dead ends: 4465 [2021-10-14 11:57:11,759 INFO L226 Difference]: Without dead ends: 4465 [2021-10-14 11:57:11,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 671.7ms TimeCoverageRelationStatistics Valid=428, Invalid=1828, Unknown=0, NotChecked=0, Total=2256 [2021-10-14 11:57:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2021-10-14 11:57:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 2303. [2021-10-14 11:57:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2299 states have (on average 1.9195302305350153) internal successors, (4413), 2302 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4413 transitions. [2021-10-14 11:57:11,780 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4413 transitions. Word has length 128 [2021-10-14 11:57:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:11,780 INFO L470 AbstractCegarLoop]: Abstraction has 2303 states and 4413 transitions. [2021-10-14 11:57:11,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4413 transitions. [2021-10-14 11:57:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:11,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:11,781 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:11,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-14 11:57:11,781 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1711437825, now seen corresponding path program 54 times [2021-10-14 11:57:11,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:11,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576205365] [2021-10-14 11:57:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:11,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:12,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:12,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576205365] [2021-10-14 11:57:12,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576205365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:12,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:12,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:12,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98758843] [2021-10-14 11:57:12,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:12,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:12,056 INFO L87 Difference]: Start difference. First operand 2303 states and 4413 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:13,773 INFO L93 Difference]: Finished difference Result 4530 states and 8828 transitions. [2021-10-14 11:57:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:57:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:57:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:13,777 INFO L225 Difference]: With dead ends: 4530 [2021-10-14 11:57:13,777 INFO L226 Difference]: Without dead ends: 4530 [2021-10-14 11:57:13,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 701.8ms TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2021-10-14 11:57:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2021-10-14 11:57:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 2297. [2021-10-14 11:57:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2293 states have (on average 1.9193196685564762) internal successors, (4401), 2296 states have internal predecessors, (4401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 4401 transitions. [2021-10-14 11:57:13,798 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 4401 transitions. Word has length 128 [2021-10-14 11:57:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:13,798 INFO L470 AbstractCegarLoop]: Abstraction has 2297 states and 4401 transitions. [2021-10-14 11:57:13,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 4401 transitions. [2021-10-14 11:57:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:13,800 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:13,800 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:13,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-14 11:57:13,800 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 601602803, now seen corresponding path program 55 times [2021-10-14 11:57:13,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:13,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730873139] [2021-10-14 11:57:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:13,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:14,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:14,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730873139] [2021-10-14 11:57:14,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730873139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:14,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:14,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:14,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323977398] [2021-10-14 11:57:14,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:14,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:14,061 INFO L87 Difference]: Start difference. First operand 2297 states and 4401 transitions. Second operand has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:15,454 INFO L93 Difference]: Finished difference Result 4586 states and 8937 transitions. [2021-10-14 11:57:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-14 11:57:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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 128 [2021-10-14 11:57:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:15,458 INFO L225 Difference]: With dead ends: 4586 [2021-10-14 11:57:15,458 INFO L226 Difference]: Without dead ends: 4586 [2021-10-14 11:57:15,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 715.5ms TimeCoverageRelationStatistics Valid=495, Invalid=2157, Unknown=0, NotChecked=0, Total=2652 [2021-10-14 11:57:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2021-10-14 11:57:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 2246. [2021-10-14 11:57:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2242 states have (on average 1.9174843889384479) internal successors, (4299), 2245 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 4299 transitions. [2021-10-14 11:57:15,478 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 4299 transitions. Word has length 128 [2021-10-14 11:57:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:15,478 INFO L470 AbstractCegarLoop]: Abstraction has 2246 states and 4299 transitions. [2021-10-14 11:57:15,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.4) internal successors, (128), 21 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) [2021-10-14 11:57:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 4299 transitions. [2021-10-14 11:57:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-14 11:57:15,480 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:15,480 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:15,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-14 11:57:15,480 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash 247114705, now seen corresponding path program 56 times [2021-10-14 11:57:15,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:15,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986781400] [2021-10-14 11:57:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:15,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:15,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:15,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986781400] [2021-10-14 11:57:15,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986781400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:15,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:15,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 11:57:15,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906696552] [2021-10-14 11:57:15,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 11:57:15,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 11:57:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:57:15,700 INFO L87 Difference]: Start difference. First operand 2246 states and 4299 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:57:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:17,755 INFO L93 Difference]: Finished difference Result 4541 states and 8782 transitions. [2021-10-14 11:57:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-10-14 11:57:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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 128 [2021-10-14 11:57:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:17,760 INFO L225 Difference]: With dead ends: 4541 [2021-10-14 11:57:17,760 INFO L226 Difference]: Without dead ends: 4541 [2021-10-14 11:57:17,760 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 914.2ms TimeCoverageRelationStatistics Valid=981, Invalid=5661, Unknown=0, NotChecked=0, Total=6642 [2021-10-14 11:57:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2021-10-14 11:57:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 2040. [2021-10-14 11:57:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2037 states have (on average 1.9106529209621994) internal successors, (3892), 2039 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3892 transitions. [2021-10-14 11:57:17,781 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3892 transitions. Word has length 128 [2021-10-14 11:57:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:17,781 INFO L470 AbstractCegarLoop]: Abstraction has 2040 states and 3892 transitions. [2021-10-14 11:57:17,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 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) [2021-10-14 11:57:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3892 transitions. [2021-10-14 11:57:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:17,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:17,782 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:17,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-14 11:57:17,782 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 945280310, now seen corresponding path program 1 times [2021-10-14 11:57:17,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:17,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478565634] [2021-10-14 11:57:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:17,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:18,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:18,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478565634] [2021-10-14 11:57:18,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478565634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:18,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:18,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:18,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147594416] [2021-10-14 11:57:18,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:18,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:18,048 INFO L87 Difference]: Start difference. First operand 2040 states and 3892 transitions. Second operand has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:19,468 INFO L93 Difference]: Finished difference Result 3595 states and 6914 transitions. [2021-10-14 11:57:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-14 11:57:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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 136 [2021-10-14 11:57:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:19,471 INFO L225 Difference]: With dead ends: 3595 [2021-10-14 11:57:19,471 INFO L226 Difference]: Without dead ends: 3595 [2021-10-14 11:57:19,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 677.9ms TimeCoverageRelationStatistics Valid=550, Invalid=2990, Unknown=0, NotChecked=0, Total=3540 [2021-10-14 11:57:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2021-10-14 11:57:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 2308. [2021-10-14 11:57:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2305 states have (on average 1.9210412147505422) internal successors, (4428), 2307 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4428 transitions. [2021-10-14 11:57:19,499 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4428 transitions. Word has length 136 [2021-10-14 11:57:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:19,499 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 4428 transitions. [2021-10-14 11:57:19,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4428 transitions. [2021-10-14 11:57:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:19,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:19,501 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:19,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-14 11:57:19,501 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1300065866, now seen corresponding path program 2 times [2021-10-14 11:57:19,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:19,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571374389] [2021-10-14 11:57:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:19,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:19,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:19,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571374389] [2021-10-14 11:57:19,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571374389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:19,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:19,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:19,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054066860] [2021-10-14 11:57:19,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:19,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:19,752 INFO L87 Difference]: Start difference. First operand 2308 states and 4428 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:22,500 INFO L93 Difference]: Finished difference Result 3972 states and 7681 transitions. [2021-10-14 11:57:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-10-14 11:57:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:22,503 INFO L225 Difference]: With dead ends: 3972 [2021-10-14 11:57:22,503 INFO L226 Difference]: Without dead ends: 3972 [2021-10-14 11:57:22,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3319 ImplicationChecksByTransitivity, 1753.8ms TimeCoverageRelationStatistics Valid=1587, Invalid=8513, Unknown=0, NotChecked=0, Total=10100 [2021-10-14 11:57:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2021-10-14 11:57:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2388. [2021-10-14 11:57:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2385 states have (on average 1.9236897274633125) internal successors, (4588), 2387 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4588 transitions. [2021-10-14 11:57:22,524 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4588 transitions. Word has length 136 [2021-10-14 11:57:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:22,524 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 4588 transitions. [2021-10-14 11:57:22,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4588 transitions. [2021-10-14 11:57:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:22,526 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:22,526 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:22,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-14 11:57:22,526 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1056915934, now seen corresponding path program 3 times [2021-10-14 11:57:22,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:22,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509906486] [2021-10-14 11:57:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:22,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:22,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:22,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509906486] [2021-10-14 11:57:22,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509906486] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:22,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:22,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:22,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745941560] [2021-10-14 11:57:22,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:22,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:22,908 INFO L87 Difference]: Start difference. First operand 2388 states and 4588 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:24,641 INFO L93 Difference]: Finished difference Result 2658 states and 5081 transitions. [2021-10-14 11:57:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-14 11:57:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:24,643 INFO L225 Difference]: With dead ends: 2658 [2021-10-14 11:57:24,643 INFO L226 Difference]: Without dead ends: 2658 [2021-10-14 11:57:24,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 991.7ms TimeCoverageRelationStatistics Valid=829, Invalid=3593, Unknown=0, NotChecked=0, Total=4422 [2021-10-14 11:57:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-10-14 11:57:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2388. [2021-10-14 11:57:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2385 states have (on average 1.9236897274633125) internal successors, (4588), 2387 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4588 transitions. [2021-10-14 11:57:24,670 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4588 transitions. Word has length 136 [2021-10-14 11:57:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:24,671 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 4588 transitions. [2021-10-14 11:57:24,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4588 transitions. [2021-10-14 11:57:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:24,672 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:24,672 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:24,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-14 11:57:24,672 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1930092000, now seen corresponding path program 4 times [2021-10-14 11:57:24,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:24,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806748529] [2021-10-14 11:57:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:24,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:25,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:25,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806748529] [2021-10-14 11:57:25,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806748529] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:25,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:25,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:25,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667123915] [2021-10-14 11:57:25,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:25,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:25,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:25,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:25,061 INFO L87 Difference]: Start difference. First operand 2388 states and 4588 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:27,081 INFO L93 Difference]: Finished difference Result 2695 states and 5154 transitions. [2021-10-14 11:57:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-14 11:57:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:27,084 INFO L225 Difference]: With dead ends: 2695 [2021-10-14 11:57:27,084 INFO L226 Difference]: Without dead ends: 2695 [2021-10-14 11:57:27,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1275.5ms TimeCoverageRelationStatistics Valid=932, Invalid=3898, Unknown=0, NotChecked=0, Total=4830 [2021-10-14 11:57:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2021-10-14 11:57:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2394. [2021-10-14 11:57:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2391 states have (on average 1.9238812212463405) internal successors, (4600), 2393 states have internal predecessors, (4600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4600 transitions. [2021-10-14 11:57:27,101 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4600 transitions. Word has length 136 [2021-10-14 11:57:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:27,102 INFO L470 AbstractCegarLoop]: Abstraction has 2394 states and 4600 transitions. [2021-10-14 11:57:27,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4600 transitions. [2021-10-14 11:57:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:27,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:27,103 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:27,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-14 11:57:27,103 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -409516164, now seen corresponding path program 5 times [2021-10-14 11:57:27,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:27,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089415097] [2021-10-14 11:57:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:27,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:27,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:27,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089415097] [2021-10-14 11:57:27,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089415097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:27,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:27,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:27,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928178497] [2021-10-14 11:57:27,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:27,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:27,509 INFO L87 Difference]: Start difference. First operand 2394 states and 4600 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:29,379 INFO L93 Difference]: Finished difference Result 2702 states and 5167 transitions. [2021-10-14 11:57:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-14 11:57:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:29,381 INFO L225 Difference]: With dead ends: 2702 [2021-10-14 11:57:29,381 INFO L226 Difference]: Without dead ends: 2702 [2021-10-14 11:57:29,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 1170.1ms TimeCoverageRelationStatistics Valid=973, Invalid=4139, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:57:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2021-10-14 11:57:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2388. [2021-10-14 11:57:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2385 states have (on average 1.9236897274633125) internal successors, (4588), 2387 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4588 transitions. [2021-10-14 11:57:29,399 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4588 transitions. Word has length 136 [2021-10-14 11:57:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:29,399 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 4588 transitions. [2021-10-14 11:57:29,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4588 transitions. [2021-10-14 11:57:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:29,400 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:29,400 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:29,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-14 11:57:29,400 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1001681182, now seen corresponding path program 6 times [2021-10-14 11:57:29,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:29,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114042246] [2021-10-14 11:57:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:29,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:29,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:29,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114042246] [2021-10-14 11:57:29,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114042246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:29,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:29,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-14 11:57:29,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220558460] [2021-10-14 11:57:29,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-14 11:57:29,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-14 11:57:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:57:29,768 INFO L87 Difference]: Start difference. First operand 2388 states and 4588 transitions. Second operand has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 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) [2021-10-14 11:57:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:31,986 INFO L93 Difference]: Finished difference Result 2758 states and 5277 transitions. [2021-10-14 11:57:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-14 11:57:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 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 136 [2021-10-14 11:57:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:31,989 INFO L225 Difference]: With dead ends: 2758 [2021-10-14 11:57:31,989 INFO L226 Difference]: Without dead ends: 2758 [2021-10-14 11:57:31,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 1421.2ms TimeCoverageRelationStatistics Valid=1187, Invalid=5455, Unknown=0, NotChecked=0, Total=6642 [2021-10-14 11:57:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2021-10-14 11:57:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2388. [2021-10-14 11:57:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2385 states have (on average 1.9236897274633125) internal successors, (4588), 2387 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4588 transitions. [2021-10-14 11:57:32,006 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4588 transitions. Word has length 136 [2021-10-14 11:57:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:32,006 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 4588 transitions. [2021-10-14 11:57:32,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.181818181818182) internal successors, (136), 23 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) [2021-10-14 11:57:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4588 transitions. [2021-10-14 11:57:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:32,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:32,008 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:32,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-14 11:57:32,008 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash 59481414, now seen corresponding path program 7 times [2021-10-14 11:57:32,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:32,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712649021] [2021-10-14 11:57:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:32,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:32,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:32,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712649021] [2021-10-14 11:57:32,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712649021] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:32,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:32,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:32,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780586011] [2021-10-14 11:57:32,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:32,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:32,360 INFO L87 Difference]: Start difference. First operand 2388 states and 4588 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:34,838 INFO L93 Difference]: Finished difference Result 2808 states and 5375 transitions. [2021-10-14 11:57:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-10-14 11:57:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:34,841 INFO L225 Difference]: With dead ends: 2808 [2021-10-14 11:57:34,841 INFO L226 Difference]: Without dead ends: 2808 [2021-10-14 11:57:34,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 1577.8ms TimeCoverageRelationStatistics Valid=1384, Invalid=5756, Unknown=0, NotChecked=0, Total=7140 [2021-10-14 11:57:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2021-10-14 11:57:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2388. [2021-10-14 11:57:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2385 states have (on average 1.9236897274633125) internal successors, (4588), 2387 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4588 transitions. [2021-10-14 11:57:34,859 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4588 transitions. Word has length 136 [2021-10-14 11:57:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:34,859 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 4588 transitions. [2021-10-14 11:57:34,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4588 transitions. [2021-10-14 11:57:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:34,860 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:34,860 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:34,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-14 11:57:34,860 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2118675130, now seen corresponding path program 8 times [2021-10-14 11:57:34,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:34,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143484549] [2021-10-14 11:57:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:34,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:35,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:35,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143484549] [2021-10-14 11:57:35,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143484549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:35,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:35,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:35,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828297214] [2021-10-14 11:57:35,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:35,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:35,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:35,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:35,129 INFO L87 Difference]: Start difference. First operand 2388 states and 4588 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:37,632 INFO L93 Difference]: Finished difference Result 4095 states and 7877 transitions. [2021-10-14 11:57:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-10-14 11:57:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:37,636 INFO L225 Difference]: With dead ends: 4095 [2021-10-14 11:57:37,636 INFO L226 Difference]: Without dead ends: 4095 [2021-10-14 11:57:37,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2826 ImplicationChecksByTransitivity, 1499.0ms TimeCoverageRelationStatistics Valid=1539, Invalid=7017, Unknown=0, NotChecked=0, Total=8556 [2021-10-14 11:57:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2021-10-14 11:57:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2328. [2021-10-14 11:57:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2325 states have (on average 1.9217204301075268) internal successors, (4468), 2327 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 4468 transitions. [2021-10-14 11:57:37,656 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 4468 transitions. Word has length 136 [2021-10-14 11:57:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:37,656 INFO L470 AbstractCegarLoop]: Abstraction has 2328 states and 4468 transitions. [2021-10-14 11:57:37,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 4468 transitions. [2021-10-14 11:57:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:37,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:37,658 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:37,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-14 11:57:37,658 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1801077172, now seen corresponding path program 9 times [2021-10-14 11:57:37,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:37,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348545161] [2021-10-14 11:57:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:37,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:37,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:37,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348545161] [2021-10-14 11:57:37,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348545161] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:37,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:37,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:37,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45977820] [2021-10-14 11:57:37,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:37,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:37,893 INFO L87 Difference]: Start difference. First operand 2328 states and 4468 transitions. Second operand has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:39,457 INFO L93 Difference]: Finished difference Result 4508 states and 8723 transitions. [2021-10-14 11:57:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-10-14 11:57:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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 136 [2021-10-14 11:57:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:39,461 INFO L225 Difference]: With dead ends: 4508 [2021-10-14 11:57:39,461 INFO L226 Difference]: Without dead ends: 4508 [2021-10-14 11:57:39,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 723.4ms TimeCoverageRelationStatistics Valid=605, Invalid=3177, Unknown=0, NotChecked=0, Total=3782 [2021-10-14 11:57:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2021-10-14 11:57:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 2446. [2021-10-14 11:57:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2443 states have (on average 1.9255014326647564) internal successors, (4704), 2445 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4704 transitions. [2021-10-14 11:57:39,483 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4704 transitions. Word has length 136 [2021-10-14 11:57:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:39,483 INFO L470 AbstractCegarLoop]: Abstraction has 2446 states and 4704 transitions. [2021-10-14 11:57:39,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4704 transitions. [2021-10-14 11:57:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:39,484 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:39,484 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:39,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-14 11:57:39,484 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1824335728, now seen corresponding path program 10 times [2021-10-14 11:57:39,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:39,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793645168] [2021-10-14 11:57:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:39,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:39,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:39,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793645168] [2021-10-14 11:57:39,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793645168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:39,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:39,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:39,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269763738] [2021-10-14 11:57:39,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:39,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:39,735 INFO L87 Difference]: Start difference. First operand 2446 states and 4704 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:42,681 INFO L93 Difference]: Finished difference Result 4192 states and 8121 transitions. [2021-10-14 11:57:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-10-14 11:57:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:42,685 INFO L225 Difference]: With dead ends: 4192 [2021-10-14 11:57:42,685 INFO L226 Difference]: Without dead ends: 4192 [2021-10-14 11:57:42,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3304 ImplicationChecksByTransitivity, 1667.9ms TimeCoverageRelationStatistics Valid=1519, Invalid=8581, Unknown=0, NotChecked=0, Total=10100 [2021-10-14 11:57:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2021-10-14 11:57:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 2376. [2021-10-14 11:57:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2373 states have (on average 1.9233038348082596) internal successors, (4564), 2375 states have internal predecessors, (4564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4564 transitions. [2021-10-14 11:57:42,706 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4564 transitions. Word has length 136 [2021-10-14 11:57:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:42,706 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4564 transitions. [2021-10-14 11:57:42,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4564 transitions. [2021-10-14 11:57:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:42,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:42,707 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:42,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-14 11:57:42,708 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1461170540, now seen corresponding path program 11 times [2021-10-14 11:57:42,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:42,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013667479] [2021-10-14 11:57:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:42,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:42,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:42,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013667479] [2021-10-14 11:57:42,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013667479] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:42,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:42,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:42,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765249781] [2021-10-14 11:57:42,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:42,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:42,945 INFO L87 Difference]: Start difference. First operand 2376 states and 4564 transitions. Second operand has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:44,440 INFO L93 Difference]: Finished difference Result 4578 states and 8863 transitions. [2021-10-14 11:57:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:57:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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 136 [2021-10-14 11:57:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:44,444 INFO L225 Difference]: With dead ends: 4578 [2021-10-14 11:57:44,444 INFO L226 Difference]: Without dead ends: 4578 [2021-10-14 11:57:44,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 744.5ms TimeCoverageRelationStatistics Valid=572, Invalid=2968, Unknown=0, NotChecked=0, Total=3540 [2021-10-14 11:57:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2021-10-14 11:57:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 2477. [2021-10-14 11:57:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2474 states have (on average 1.9264349232012934) internal successors, (4766), 2476 states have internal predecessors, (4766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 4766 transitions. [2021-10-14 11:57:44,467 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 4766 transitions. Word has length 136 [2021-10-14 11:57:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:44,468 INFO L470 AbstractCegarLoop]: Abstraction has 2477 states and 4766 transitions. [2021-10-14 11:57:44,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 4766 transitions. [2021-10-14 11:57:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:44,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:44,469 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:44,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-10-14 11:57:44,469 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash -312392812, now seen corresponding path program 12 times [2021-10-14 11:57:44,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:44,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827980490] [2021-10-14 11:57:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:44,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:44,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:44,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827980490] [2021-10-14 11:57:44,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827980490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:44,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:44,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:44,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211605426] [2021-10-14 11:57:44,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:44,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:44,713 INFO L87 Difference]: Start difference. First operand 2477 states and 4766 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:47,008 INFO L93 Difference]: Finished difference Result 3638 states and 7064 transitions. [2021-10-14 11:57:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-10-14 11:57:47,009 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:47,012 INFO L225 Difference]: With dead ends: 3638 [2021-10-14 11:57:47,012 INFO L226 Difference]: Without dead ends: 3638 [2021-10-14 11:57:47,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1220.9ms TimeCoverageRelationStatistics Valid=923, Invalid=4929, Unknown=0, NotChecked=0, Total=5852 [2021-10-14 11:57:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2021-10-14 11:57:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2392. [2021-10-14 11:57:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2389 states have (on average 1.9238174968606112) internal successors, (4596), 2391 states have internal predecessors, (4596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 4596 transitions. [2021-10-14 11:57:47,031 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 4596 transitions. Word has length 136 [2021-10-14 11:57:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:47,031 INFO L470 AbstractCegarLoop]: Abstraction has 2392 states and 4596 transitions. [2021-10-14 11:57:47,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 4596 transitions. [2021-10-14 11:57:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:47,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:47,033 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:47,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-10-14 11:57:47,033 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1766503508, now seen corresponding path program 13 times [2021-10-14 11:57:47,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:47,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894849100] [2021-10-14 11:57:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:47,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:47,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:47,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894849100] [2021-10-14 11:57:47,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894849100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:47,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:47,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:47,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103867023] [2021-10-14 11:57:47,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:47,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:47,274 INFO L87 Difference]: Start difference. First operand 2392 states and 4596 transitions. Second operand has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:48,646 INFO L93 Difference]: Finished difference Result 4877 states and 9453 transitions. [2021-10-14 11:57:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-14 11:57:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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 136 [2021-10-14 11:57:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:48,651 INFO L225 Difference]: With dead ends: 4877 [2021-10-14 11:57:48,651 INFO L226 Difference]: Without dead ends: 4877 [2021-10-14 11:57:48,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 635.7ms TimeCoverageRelationStatistics Valid=504, Invalid=2252, Unknown=0, NotChecked=0, Total=2756 [2021-10-14 11:57:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2021-10-14 11:57:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 2341. [2021-10-14 11:57:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2338 states have (on average 1.9221556886227544) internal successors, (4494), 2340 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 4494 transitions. [2021-10-14 11:57:48,674 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 4494 transitions. Word has length 136 [2021-10-14 11:57:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:48,674 INFO L470 AbstractCegarLoop]: Abstraction has 2341 states and 4494 transitions. [2021-10-14 11:57:48,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 4494 transitions. [2021-10-14 11:57:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:48,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:48,675 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:48,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-10-14 11:57:48,675 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -617725780, now seen corresponding path program 14 times [2021-10-14 11:57:48,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:48,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501722835] [2021-10-14 11:57:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:48,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:48,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:48,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501722835] [2021-10-14 11:57:48,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501722835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:48,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:48,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-14 11:57:48,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907365940] [2021-10-14 11:57:48,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-14 11:57:48,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-14 11:57:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-10-14 11:57:48,935 INFO L87 Difference]: Start difference. First operand 2341 states and 4494 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:51,010 INFO L93 Difference]: Finished difference Result 4542 states and 8853 transitions. [2021-10-14 11:57:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-10-14 11:57:51,010 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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 136 [2021-10-14 11:57:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:51,014 INFO L225 Difference]: With dead ends: 4542 [2021-10-14 11:57:51,014 INFO L226 Difference]: Without dead ends: 4542 [2021-10-14 11:57:51,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1115.3ms TimeCoverageRelationStatistics Valid=897, Invalid=3795, Unknown=0, NotChecked=0, Total=4692 [2021-10-14 11:57:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2021-10-14 11:57:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 2224. [2021-10-14 11:57:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2221 states have (on average 1.9180549302116163) internal successors, (4260), 2223 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 4260 transitions. [2021-10-14 11:57:51,035 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 4260 transitions. Word has length 136 [2021-10-14 11:57:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:51,035 INFO L470 AbstractCegarLoop]: Abstraction has 2224 states and 4260 transitions. [2021-10-14 11:57:51,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 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) [2021-10-14 11:57:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 4260 transitions. [2021-10-14 11:57:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-10-14 11:57:51,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:51,037 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:51,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-10-14 11:57:51,037 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1328581844, now seen corresponding path program 15 times [2021-10-14 11:57:51,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:51,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710186127] [2021-10-14 11:57:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:51,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:51,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:51,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710186127] [2021-10-14 11:57:51,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710186127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:51,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:51,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-14 11:57:51,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875796470] [2021-10-14 11:57:51,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-14 11:57:51,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-14 11:57:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-10-14 11:57:51,271 INFO L87 Difference]: Start difference. First operand 2224 states and 4260 transitions. Second operand has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:52,696 INFO L93 Difference]: Finished difference Result 3821 states and 7358 transitions. [2021-10-14 11:57:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:57:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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 136 [2021-10-14 11:57:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:52,700 INFO L225 Difference]: With dead ends: 3821 [2021-10-14 11:57:52,700 INFO L226 Difference]: Without dead ends: 3821 [2021-10-14 11:57:52,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 718.7ms TimeCoverageRelationStatistics Valid=587, Invalid=3073, Unknown=0, NotChecked=0, Total=3660 [2021-10-14 11:57:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2021-10-14 11:57:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 1980. [2021-10-14 11:57:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1978 states have (on average 1.909504550050556) internal successors, (3777), 1979 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 3777 transitions. [2021-10-14 11:57:52,718 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 3777 transitions. Word has length 136 [2021-10-14 11:57:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:52,719 INFO L470 AbstractCegarLoop]: Abstraction has 1980 states and 3777 transitions. [2021-10-14 11:57:52,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.157894736842105) internal successors, (136), 20 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) [2021-10-14 11:57:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 3777 transitions. [2021-10-14 11:57:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-10-14 11:57:52,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:52,720 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:52,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-10-14 11:57:52,720 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash 228102788, now seen corresponding path program 1 times [2021-10-14 11:57:52,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:52,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278264483] [2021-10-14 11:57:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:52,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 11:57:52,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:52,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278264483] [2021-10-14 11:57:52,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278264483] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:52,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:52,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:57:52,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948860461] [2021-10-14 11:57:52,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:57:52,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:57:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:57:52,777 INFO L87 Difference]: Start difference. First operand 1980 states and 3777 transitions. Second operand has 6 states, 5 states have (on average 28.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:52,929 INFO L93 Difference]: Finished difference Result 2246 states and 4303 transitions. [2021-10-14 11:57:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:57:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-10-14 11:57:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:52,931 INFO L225 Difference]: With dead ends: 2246 [2021-10-14 11:57:52,931 INFO L226 Difference]: Without dead ends: 2246 [2021-10-14 11:57:52,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:57:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2021-10-14 11:57:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2063. [2021-10-14 11:57:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2061 states have (on average 1.9112081513828238) internal successors, (3939), 2062 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3939 transitions. [2021-10-14 11:57:52,946 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3939 transitions. Word has length 140 [2021-10-14 11:57:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:52,946 INFO L470 AbstractCegarLoop]: Abstraction has 2063 states and 3939 transitions. [2021-10-14 11:57:52,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3939 transitions. [2021-10-14 11:57:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-14 11:57:52,948 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:52,948 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:57:52,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-10-14 11:57:52,948 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 11:57:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1394646647, now seen corresponding path program 1 times [2021-10-14 11:57:52,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:52,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020466021] [2021-10-14 11:57:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:52,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-14 11:57:52,965 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-14 11:57:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-14 11:57:53,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-14 11:57:53,019 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-14 11:57:53,020 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:53,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-10-14 11:57:53,026 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-14 11:57:53,026 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-14 11:57:53,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:57:53 BasicIcfg [2021-10-14 11:57:53,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-14 11:57:53,082 INFO L168 Benchmark]: Toolchain (without parser) took 160891.20 ms. Allocated memory was 185.6 MB in the beginning and 333.4 MB in the end (delta: 147.8 MB). Free memory was 133.0 MB in the beginning and 190.5 MB in the end (delta: -57.5 MB). Peak memory consumption was 89.6 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,082 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 185.6 MB. Free memory is still 152.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 11:57:53,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.25 ms. Allocated memory is still 185.6 MB. Free memory was 132.9 MB in the beginning and 132.9 MB in the end (delta: -35.7 kB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 185.6 MB. Free memory was 132.7 MB in the beginning and 129.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,083 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 ms. Allocated memory is still 185.6 MB. Free memory was 129.0 MB in the beginning and 126.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,083 INFO L168 Benchmark]: RCFGBuilder took 463.39 ms. Allocated memory is still 185.6 MB. Free memory was 126.6 MB in the beginning and 106.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,083 INFO L168 Benchmark]: TraceAbstraction took 159866.09 ms. Allocated memory was 185.6 MB in the beginning and 333.4 MB in the end (delta: 147.8 MB). Free memory was 106.0 MB in the beginning and 190.5 MB in the end (delta: -84.4 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:53,084 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.13 ms. Allocated memory is still 185.6 MB. Free memory is still 152.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 477.25 ms. Allocated memory is still 185.6 MB. Free memory was 132.9 MB in the beginning and 132.9 MB in the end (delta: -35.7 kB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 185.6 MB. Free memory was 132.7 MB in the beginning and 129.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 28.43 ms. Allocated memory is still 185.6 MB. Free memory was 129.0 MB in the beginning and 126.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 463.39 ms. Allocated memory is still 185.6 MB. Free memory was 126.6 MB in the beginning and 106.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 159866.09 ms. Allocated memory was 185.6 MB in the beginning and 333.4 MB in the end (delta: 147.8 MB). Free memory was 106.0 MB in the beginning and 190.5 MB in the end (delta: -84.4 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1232]: the program contains a data race the program contains a data race We found a FailurePath: [L1216-L1219] 0 struct s { int datum; struct s *next; } *A; VAL [A={0:0}] [L1224] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={15:0}] [L1225] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={15:0}, B_mutex={17:0}] [L1238] 0 pthread_t t1; VAL [A={0:0}, A_mutex={15:0}, B_mutex={17:0}] [L1239] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={15:0}, B_mutex={17:0}] [L1221] 0 p -> datum = x VAL [A={0:0}, A_mutex={15:0}, B_mutex={17:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={15:0}, B_mutex={17:0}] [L1241] 0 A = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1221] 0 p -> datum = x VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1243] 0 A->next = p VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1244] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1227] 1 struct s *p = malloc(sizeof(struct s)); VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1246] EXPR 0 A->next VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1228] 1 struct s *t; VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1246] EXPR 0 A->next VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1221] 1 p -> datum = x VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1222] 1 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1232] 1 A->next = p VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1246] 0 p = A->next VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] [L1232] 1 A->next = p VAL [A={11:0}, A_mutex={15:0}, B_mutex={17:0}] - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1244]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1233]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 159682.5ms, OverallIterations: 81, TraceHistogramMax: 1, EmptinessCheckTime: 120.1ms, AutomataDifference: 135010.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 76.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24865 SDtfs, 93747 SDslu, 258526 SDs, 0 SdLazy, 180591 SolverSat, 10303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58513.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5131 GetRequests, 110 SyntacticMatches, 63 SemanticMatches, 4958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106698 ImplicationChecksByTransitivity, 70329.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2477occurred in iteration=75, InterpolantAutomatonStates: 4294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2046.9ms AutomataMinimizationTime, 80 MinimizatonAttempts, 102961 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 171.1ms SsaConstructionTime, 797.2ms SatisfiabilityAnalysisTime, 20819.3ms InterpolantComputationTime, 10185 NumberOfCodeBlocks, 10185 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 9956 ConstructedInterpolants, 0 QuantifiedInterpolants, 116477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 80 InterpolantComputations, 80 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2021-10-14 11:57:53,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...