/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/04-mutex_10-ptrmunge_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-aed12abd52951161f3584c1e4a16827ff4d06934-aed12ab [2021-10-14 11:54:37,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-14 11:54:37,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-14 11:54:37,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-14 11:54:37,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-14 11:54:37,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-14 11:54:37,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-14 11:54:37,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-14 11:54:37,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-14 11:54:37,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-14 11:54:37,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-14 11:54:37,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-14 11:54:37,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-14 11:54:37,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-14 11:54:37,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-14 11:54:37,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-14 11:54:37,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-14 11:54:37,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-14 11:54:37,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-14 11:54:37,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-14 11:54:37,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-14 11:54:37,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-14 11:54:37,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-14 11:54:37,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-14 11:54:37,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-14 11:54:37,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-14 11:54:37,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-14 11:54:37,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-14 11:54:37,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-14 11:54:37,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-14 11:54:37,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-14 11:54:37,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-14 11:54:37,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-14 11:54:37,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-14 11:54:37,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-14 11:54:37,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-14 11:54:37,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-14 11:54:37,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-14 11:54:37,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-14 11:54:37,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-14 11:54:37,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-14 11:54:37,822 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:54:37,841 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-14 11:54:37,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-14 11:54:37,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-14 11:54:37,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-14 11:54:37,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-14 11:54:37,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-14 11:54:37,842 INFO L138 SettingsManager]: * Use SBE=true [2021-10-14 11:54:37,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-14 11:54:37,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-14 11:54:37,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:54:37,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-14 11:54:37,844 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-14 11:54:37,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-14 11:54:37,845 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:54:38,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-14 11:54:38,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-14 11:54:38,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-14 11:54:38,050 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-14 11:54:38,051 INFO L275 PluginConnector]: CDTParser initialized [2021-10-14 11:54:38,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2021-10-14 11:54:38,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2022637/e26014ae33fe453c8fadf58eb8b2668b/FLAG00f3ea92a [2021-10-14 11:54:38,496 INFO L306 CDTParser]: Found 1 translation units. [2021-10-14 11:54:38,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2021-10-14 11:54:38,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2022637/e26014ae33fe453c8fadf58eb8b2668b/FLAG00f3ea92a [2021-10-14 11:54:38,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2022637/e26014ae33fe453c8fadf58eb8b2668b [2021-10-14 11:54:38,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-14 11:54:38,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-14 11:54:38,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-14 11:54:38,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-14 11:54:38,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-14 11:54:38,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:38,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbc4a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38, skipping insertion in model container [2021-10-14 11:54:38,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:38,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-14 11:54:38,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-14 11:54:38,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:54:38,886 INFO L203 MainTranslator]: Completed pre-run [2021-10-14 11:54:38,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:54:38,971 INFO L208 MainTranslator]: Completed translation [2021-10-14 11:54:38,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38 WrapperNode [2021-10-14 11:54:38,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-14 11:54:38,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-14 11:54:38,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-14 11:54:38,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-14 11:54:38,977 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:54:38" (1/1) ... [2021-10-14 11:54:39,001 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:54:38" (1/1) ... [2021-10-14 11:54:39,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-14 11:54:39,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-14 11:54:39,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-14 11:54:39,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-14 11:54:39,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-14 11:54:39,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-14 11:54:39,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-14 11:54:39,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-14 11:54:39,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (1/1) ... [2021-10-14 11:54:39,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:54:39,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-14 11:54:39,072 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:54:39,077 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:54:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-14 11:54:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-14 11:54:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-14 11:54:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-14 11:54:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-14 11:54:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-14 11:54:39,100 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-14 11:54:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-14 11:54:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-14 11:54:39,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-14 11:54:39,101 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:54:39,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-14 11:54:39,387 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-14 11:54:39,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:54:39 BoogieIcfgContainer [2021-10-14 11:54:39,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-14 11:54:39,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-14 11:54:39,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-14 11:54:39,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-14 11:54:39,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:54:38" (1/3) ... [2021-10-14 11:54:39,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ebef6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:54:39, skipping insertion in model container [2021-10-14 11:54:39,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:54:38" (2/3) ... [2021-10-14 11:54:39,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ebef6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:54:39, skipping insertion in model container [2021-10-14 11:54:39,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:54:39" (3/3) ... [2021-10-14 11:54:39,394 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_10-ptrmunge_nr.i [2021-10-14 11:54:39,397 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-14 11:54:39,397 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-14 11:54:39,397 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-14 11:54:39,397 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-14 11:54:39,425 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,425 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,425 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,425 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,426 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,426 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,426 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,427 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,428 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,429 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,430 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,430 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,430 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,430 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,430 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,431 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,432 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,433 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,434 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,434 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,435 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,435 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,436 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,437 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,437 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,438 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,438 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,439 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,440 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,441 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,441 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,442 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,443 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,445 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_munge_~m.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~m.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_munge_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:54:39,467 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-10-14 11:54:39,503 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-14 11:54:39,508 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:54:39,508 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-14 11:54:39,519 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 94 transitions, 196 flow [2021-10-14 11:54:39,564 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 873 states, 870 states have (on average 1.9068965517241379) internal successors, (1659), 872 states have internal predecessors, (1659), 0 states have call successors, (0), 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:54:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9068965517241379) internal successors, (1659), 872 states have internal predecessors, (1659), 0 states have call successors, (0), 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:54:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-14 11:54:39,578 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:39,578 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:54:39,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -8763120, now seen corresponding path program 1 times [2021-10-14 11:54:39,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:39,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865498013] [2021-10-14 11:54:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:39,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:39,838 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:54:39,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:39,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865498013] [2021-10-14 11:54:39,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865498013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:39,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:39,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:54:39,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845786703] [2021-10-14 11:54:39,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:54:39,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:39,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:54:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:54:39,858 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9068965517241379) internal successors, (1659), 872 states have internal predecessors, (1659), 0 states have call successors, (0), 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 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:54:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:40,176 INFO L93 Difference]: Finished difference Result 983 states and 1861 transitions. [2021-10-14 11:54:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:54:40,177 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:54:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:40,196 INFO L225 Difference]: With dead ends: 983 [2021-10-14 11:54:40,196 INFO L226 Difference]: Without dead ends: 963 [2021-10-14 11:54:40,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:54:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-10-14 11:54:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 930. [2021-10-14 11:54:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 927 states have (on average 1.9018338727076591) internal successors, (1763), 929 states have internal predecessors, (1763), 0 states have call successors, (0), 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:54:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1763 transitions. [2021-10-14 11:54:40,257 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1763 transitions. Word has length 46 [2021-10-14 11:54:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:40,258 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1763 transitions. [2021-10-14 11:54:40,258 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:54:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1763 transitions. [2021-10-14 11:54:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-14 11:54:40,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:40,260 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] [2021-10-14 11:54:40,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-14 11:54:40,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2026722573, now seen corresponding path program 1 times [2021-10-14 11:54:40,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:40,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680241850] [2021-10-14 11:54:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:40,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:40,404 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:54:40,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:40,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680241850] [2021-10-14 11:54:40,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680241850] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:40,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:40,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:54:40,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751761139] [2021-10-14 11:54:40,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:54:40,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:54:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:54:40,413 INFO L87 Difference]: Start difference. First operand 930 states and 1763 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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:54:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:40,551 INFO L93 Difference]: Finished difference Result 1033 states and 1952 transitions. [2021-10-14 11:54:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:54:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-14 11:54:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:40,556 INFO L225 Difference]: With dead ends: 1033 [2021-10-14 11:54:40,556 INFO L226 Difference]: Without dead ends: 886 [2021-10-14 11:54:40,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:54:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-10-14 11:54:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 844. [2021-10-14 11:54:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 841 states have (on average 1.8799048751486325) internal successors, (1581), 843 states have internal predecessors, (1581), 0 states have call successors, (0), 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:54:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1581 transitions. [2021-10-14 11:54:40,597 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1581 transitions. Word has length 47 [2021-10-14 11:54:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:40,598 INFO L470 AbstractCegarLoop]: Abstraction has 844 states and 1581 transitions. [2021-10-14 11:54:40,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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:54:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1581 transitions. [2021-10-14 11:54:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:40,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:40,605 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] [2021-10-14 11:54:40,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-14 11:54:40,606 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -41252380, now seen corresponding path program 1 times [2021-10-14 11:54:40,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:40,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822579960] [2021-10-14 11:54:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:40,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:40,857 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:54:40,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:40,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822579960] [2021-10-14 11:54:40,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822579960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:40,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:40,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:40,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107469029] [2021-10-14 11:54:40,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:40,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:40,859 INFO L87 Difference]: Start difference. First operand 844 states and 1581 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:41,415 INFO L93 Difference]: Finished difference Result 965 states and 1806 transitions. [2021-10-14 11:54:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-14 11:54:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:41,419 INFO L225 Difference]: With dead ends: 965 [2021-10-14 11:54:41,419 INFO L226 Difference]: Without dead ends: 958 [2021-10-14 11:54:41,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 214.0ms TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:54:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-10-14 11:54:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 862. [2021-10-14 11:54:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 859 states have (on average 1.881257275902212) internal successors, (1616), 861 states have internal predecessors, (1616), 0 states have call successors, (0), 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:54:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1616 transitions. [2021-10-14 11:54:41,437 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1616 transitions. Word has length 57 [2021-10-14 11:54:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:41,437 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1616 transitions. [2021-10-14 11:54:41,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1616 transitions. [2021-10-14 11:54:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:41,439 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:41,439 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] [2021-10-14 11:54:41,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-14 11:54:41,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1359465636, now seen corresponding path program 2 times [2021-10-14 11:54:41,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:41,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842561981] [2021-10-14 11:54:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:41,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:41,632 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:54:41,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:41,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842561981] [2021-10-14 11:54:41,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842561981] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:41,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:41,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:41,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469612691] [2021-10-14 11:54:41,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:41,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:41,637 INFO L87 Difference]: Start difference. First operand 862 states and 1616 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:42,194 INFO L93 Difference]: Finished difference Result 1028 states and 1927 transitions. [2021-10-14 11:54:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:54:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:42,198 INFO L225 Difference]: With dead ends: 1028 [2021-10-14 11:54:42,198 INFO L226 Difference]: Without dead ends: 1014 [2021-10-14 11:54:42,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 283.8ms TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2021-10-14 11:54:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-10-14 11:54:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 883. [2021-10-14 11:54:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 880 states have (on average 1.8829545454545455) internal successors, (1657), 882 states have internal predecessors, (1657), 0 states have call successors, (0), 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:54:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1657 transitions. [2021-10-14 11:54:42,214 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1657 transitions. Word has length 57 [2021-10-14 11:54:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:42,214 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1657 transitions. [2021-10-14 11:54:42,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1657 transitions. [2021-10-14 11:54:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:42,216 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:42,217 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] [2021-10-14 11:54:42,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-14 11:54:42,217 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash -634777676, now seen corresponding path program 3 times [2021-10-14 11:54:42,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:42,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154928281] [2021-10-14 11:54:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:42,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:42,400 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:54:42,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:42,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154928281] [2021-10-14 11:54:42,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154928281] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:42,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:42,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:42,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144095997] [2021-10-14 11:54:42,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:42,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:42,402 INFO L87 Difference]: Start difference. First operand 883 states and 1657 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:42,881 INFO L93 Difference]: Finished difference Result 1081 states and 2030 transitions. [2021-10-14 11:54:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:54:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:42,884 INFO L225 Difference]: With dead ends: 1081 [2021-10-14 11:54:42,884 INFO L226 Difference]: Without dead ends: 1060 [2021-10-14 11:54:42,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 257.3ms TimeCoverageRelationStatistics Valid=222, Invalid=428, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:54:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2021-10-14 11:54:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 904. [2021-10-14 11:54:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 901 states have (on average 1.8845726970033296) internal successors, (1698), 903 states have internal predecessors, (1698), 0 states have call successors, (0), 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:54:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1698 transitions. [2021-10-14 11:54:42,899 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1698 transitions. Word has length 57 [2021-10-14 11:54:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:42,899 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1698 transitions. [2021-10-14 11:54:42,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1698 transitions. [2021-10-14 11:54:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:42,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:42,900 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] [2021-10-14 11:54:42,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-14 11:54:42,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1074292708, now seen corresponding path program 4 times [2021-10-14 11:54:42,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:42,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738126258] [2021-10-14 11:54:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:42,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:43,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:54:43,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:43,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738126258] [2021-10-14 11:54:43,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738126258] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:43,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:43,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812182422] [2021-10-14 11:54:43,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:43,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:43,068 INFO L87 Difference]: Start difference. First operand 904 states and 1698 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:43,524 INFO L93 Difference]: Finished difference Result 1134 states and 2133 transitions. [2021-10-14 11:54:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-14 11:54:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:43,530 INFO L225 Difference]: With dead ends: 1134 [2021-10-14 11:54:43,530 INFO L226 Difference]: Without dead ends: 1106 [2021-10-14 11:54:43,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 287.3ms TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:54:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-10-14 11:54:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 925. [2021-10-14 11:54:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 922 states have (on average 1.886117136659436) internal successors, (1739), 924 states have internal predecessors, (1739), 0 states have call successors, (0), 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:54:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1739 transitions. [2021-10-14 11:54:43,546 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1739 transitions. Word has length 57 [2021-10-14 11:54:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:43,546 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1739 transitions. [2021-10-14 11:54:43,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1739 transitions. [2021-10-14 11:54:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:43,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:43,548 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] [2021-10-14 11:54:43,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-14 11:54:43,548 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1911830124, now seen corresponding path program 5 times [2021-10-14 11:54:43,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:43,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789030147] [2021-10-14 11:54:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:43,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:43,683 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:54:43,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:43,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789030147] [2021-10-14 11:54:43,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789030147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:43,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:43,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:43,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294876728] [2021-10-14 11:54:43,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:43,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:43,686 INFO L87 Difference]: Start difference. First operand 925 states and 1739 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:44,428 INFO L93 Difference]: Finished difference Result 1593 states and 2997 transitions. [2021-10-14 11:54:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-14 11:54:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:44,433 INFO L225 Difference]: With dead ends: 1593 [2021-10-14 11:54:44,433 INFO L226 Difference]: Without dead ends: 1565 [2021-10-14 11:54:44,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 276.0ms TimeCoverageRelationStatistics Valid=285, Invalid=585, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:54:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-10-14 11:54:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1133. [2021-10-14 11:54:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1130 states have (on average 1.907079646017699) internal successors, (2155), 1132 states have internal predecessors, (2155), 0 states have call successors, (0), 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:54:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2155 transitions. [2021-10-14 11:54:44,453 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 2155 transitions. Word has length 57 [2021-10-14 11:54:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:44,453 INFO L470 AbstractCegarLoop]: Abstraction has 1133 states and 2155 transitions. [2021-10-14 11:54:44,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 2155 transitions. [2021-10-14 11:54:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:44,454 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:44,454 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] [2021-10-14 11:54:44,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-14 11:54:44,455 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1839893383, now seen corresponding path program 1 times [2021-10-14 11:54:44,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:44,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622551437] [2021-10-14 11:54:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:44,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:44,574 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:54:44,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:44,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622551437] [2021-10-14 11:54:44,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622551437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:44,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:44,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:44,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511347925] [2021-10-14 11:54:44,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:44,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:44,576 INFO L87 Difference]: Start difference. First operand 1133 states and 2155 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:45,217 INFO L93 Difference]: Finished difference Result 1394 states and 2613 transitions. [2021-10-14 11:54:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-14 11:54:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:45,222 INFO L225 Difference]: With dead ends: 1394 [2021-10-14 11:54:45,222 INFO L226 Difference]: Without dead ends: 1394 [2021-10-14 11:54:45,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 309.8ms TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2021-10-14 11:54:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-10-14 11:54:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1114. [2021-10-14 11:54:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1111 states have (on average 1.8955895589558955) internal successors, (2106), 1113 states have internal predecessors, (2106), 0 states have call successors, (0), 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:54:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2106 transitions. [2021-10-14 11:54:45,237 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2106 transitions. Word has length 57 [2021-10-14 11:54:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:45,238 INFO L470 AbstractCegarLoop]: Abstraction has 1114 states and 2106 transitions. [2021-10-14 11:54:45,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2106 transitions. [2021-10-14 11:54:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:45,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:45,239 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] [2021-10-14 11:54:45,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-14 11:54:45,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash -218697551, now seen corresponding path program 2 times [2021-10-14 11:54:45,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:45,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706932860] [2021-10-14 11:54:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:45,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:45,345 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:54:45,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:45,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706932860] [2021-10-14 11:54:45,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706932860] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:45,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:45,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:45,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030522859] [2021-10-14 11:54:45,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:45,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:45,347 INFO L87 Difference]: Start difference. First operand 1114 states and 2106 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:45,881 INFO L93 Difference]: Finished difference Result 1999 states and 3752 transitions. [2021-10-14 11:54:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-14 11:54:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:45,887 INFO L225 Difference]: With dead ends: 1999 [2021-10-14 11:54:45,887 INFO L226 Difference]: Without dead ends: 1999 [2021-10-14 11:54:45,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 214.5ms TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2021-10-14 11:54:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2021-10-14 11:54:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1204. [2021-10-14 11:54:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1201 states have (on average 1.9009159034138219) internal successors, (2283), 1203 states have internal predecessors, (2283), 0 states have call successors, (0), 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:54:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2283 transitions. [2021-10-14 11:54:45,907 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2283 transitions. Word has length 57 [2021-10-14 11:54:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:45,907 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 2283 transitions. [2021-10-14 11:54:45,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2283 transitions. [2021-10-14 11:54:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:45,908 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:45,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] [2021-10-14 11:54:45,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-14 11:54:45,909 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash -131028747, now seen corresponding path program 3 times [2021-10-14 11:54:45,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:45,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606550241] [2021-10-14 11:54:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:45,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:46,023 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:54:46,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:46,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606550241] [2021-10-14 11:54:46,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606550241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:46,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:46,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:46,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471039629] [2021-10-14 11:54:46,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:46,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:46,025 INFO L87 Difference]: Start difference. First operand 1204 states and 2283 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:46,834 INFO L93 Difference]: Finished difference Result 2102 states and 3936 transitions. [2021-10-14 11:54:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:54:46,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:46,841 INFO L225 Difference]: With dead ends: 2102 [2021-10-14 11:54:46,841 INFO L226 Difference]: Without dead ends: 2102 [2021-10-14 11:54:46,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 257.7ms TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:54:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2021-10-14 11:54:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1222. [2021-10-14 11:54:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1219 states have (on average 1.9023789991796554) internal successors, (2319), 1221 states have internal predecessors, (2319), 0 states have call successors, (0), 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:54:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2319 transitions. [2021-10-14 11:54:46,867 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2319 transitions. Word has length 57 [2021-10-14 11:54:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:46,868 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 2319 transitions. [2021-10-14 11:54:46,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2319 transitions. [2021-10-14 11:54:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:46,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:46,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] [2021-10-14 11:54:46,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-14 11:54:46,870 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1697760015, now seen corresponding path program 4 times [2021-10-14 11:54:46,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:46,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296888620] [2021-10-14 11:54:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:46,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:47,022 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:54:47,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:47,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296888620] [2021-10-14 11:54:47,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296888620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:47,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:47,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:47,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924392658] [2021-10-14 11:54:47,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:47,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:47,024 INFO L87 Difference]: Start difference. First operand 1222 states and 2319 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:47,462 INFO L93 Difference]: Finished difference Result 2494 states and 4692 transitions. [2021-10-14 11:54:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:54:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:47,469 INFO L225 Difference]: With dead ends: 2494 [2021-10-14 11:54:47,470 INFO L226 Difference]: Without dead ends: 2494 [2021-10-14 11:54:47,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 214.2ms TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2021-10-14 11:54:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2021-10-14 11:54:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 1397. [2021-10-14 11:54:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1394 states have (on average 1.9146341463414633) internal successors, (2669), 1396 states have internal predecessors, (2669), 0 states have call successors, (0), 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:54:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2669 transitions. [2021-10-14 11:54:47,494 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2669 transitions. Word has length 57 [2021-10-14 11:54:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:47,494 INFO L470 AbstractCegarLoop]: Abstraction has 1397 states and 2669 transitions. [2021-10-14 11:54:47,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2669 transitions. [2021-10-14 11:54:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:47,496 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:47,496 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] [2021-10-14 11:54:47,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-14 11:54:47,496 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1322384412, now seen corresponding path program 6 times [2021-10-14 11:54:47,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:47,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503022504] [2021-10-14 11:54:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:47,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:47,610 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:54:47,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:47,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503022504] [2021-10-14 11:54:47,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503022504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:47,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:47,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:47,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046134080] [2021-10-14 11:54:47,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:47,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:47,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:47,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:47,612 INFO L87 Difference]: Start difference. First operand 1397 states and 2669 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:48,332 INFO L93 Difference]: Finished difference Result 2403 states and 4536 transitions. [2021-10-14 11:54:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-14 11:54:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:48,338 INFO L225 Difference]: With dead ends: 2403 [2021-10-14 11:54:48,338 INFO L226 Difference]: Without dead ends: 2375 [2021-10-14 11:54:48,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 308.8ms TimeCoverageRelationStatistics Valid=359, Invalid=763, Unknown=0, NotChecked=0, Total=1122 [2021-10-14 11:54:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2021-10-14 11:54:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1168. [2021-10-14 11:54:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1165 states have (on average 1.8978540772532189) internal successors, (2211), 1167 states have internal predecessors, (2211), 0 states have call successors, (0), 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:54:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2211 transitions. [2021-10-14 11:54:48,356 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2211 transitions. Word has length 57 [2021-10-14 11:54:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:48,356 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2211 transitions. [2021-10-14 11:54:48,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2211 transitions. [2021-10-14 11:54:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:48,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:48,357 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] [2021-10-14 11:54:48,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-14 11:54:48,358 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1675222901, now seen corresponding path program 5 times [2021-10-14 11:54:48,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:48,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481643266] [2021-10-14 11:54:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:48,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:48,466 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:54:48,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:48,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481643266] [2021-10-14 11:54:48,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481643266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:48,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:48,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:48,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365856550] [2021-10-14 11:54:48,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:48,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:48,468 INFO L87 Difference]: Start difference. First operand 1168 states and 2211 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:49,050 INFO L93 Difference]: Finished difference Result 2401 states and 4523 transitions. [2021-10-14 11:54:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-14 11:54:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:49,065 INFO L225 Difference]: With dead ends: 2401 [2021-10-14 11:54:49,065 INFO L226 Difference]: Without dead ends: 2401 [2021-10-14 11:54:49,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 159.4ms TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:54:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-10-14 11:54:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1439. [2021-10-14 11:54:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1436 states have (on average 1.9171309192200556) internal successors, (2753), 1438 states have internal predecessors, (2753), 0 states have call successors, (0), 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:54:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2753 transitions. [2021-10-14 11:54:49,085 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2753 transitions. Word has length 57 [2021-10-14 11:54:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:49,085 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 2753 transitions. [2021-10-14 11:54:49,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2753 transitions. [2021-10-14 11:54:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:49,087 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:49,087 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] [2021-10-14 11:54:49,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-14 11:54:49,087 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash -549338712, now seen corresponding path program 7 times [2021-10-14 11:54:49,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:49,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885064612] [2021-10-14 11:54:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:49,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:49,183 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:54:49,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:49,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885064612] [2021-10-14 11:54:49,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885064612] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:49,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:49,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:49,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617926534] [2021-10-14 11:54:49,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:49,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:49,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:49,185 INFO L87 Difference]: Start difference. First operand 1439 states and 2753 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:49,948 INFO L93 Difference]: Finished difference Result 2483 states and 4684 transitions. [2021-10-14 11:54:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-14 11:54:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:49,961 INFO L225 Difference]: With dead ends: 2483 [2021-10-14 11:54:49,961 INFO L226 Difference]: Without dead ends: 2455 [2021-10-14 11:54:49,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 316.9ms TimeCoverageRelationStatistics Valid=359, Invalid=763, Unknown=0, NotChecked=0, Total=1122 [2021-10-14 11:54:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2021-10-14 11:54:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 1168. [2021-10-14 11:54:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1165 states have (on average 1.8978540772532189) internal successors, (2211), 1167 states have internal predecessors, (2211), 0 states have call successors, (0), 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:54:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2211 transitions. [2021-10-14 11:54:49,984 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2211 transitions. Word has length 57 [2021-10-14 11:54:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:49,984 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2211 transitions. [2021-10-14 11:54:49,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2211 transitions. [2021-10-14 11:54:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:49,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:49,986 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] [2021-10-14 11:54:49,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-14 11:54:49,986 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -837110779, now seen corresponding path program 6 times [2021-10-14 11:54:49,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:49,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047174836] [2021-10-14 11:54:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:49,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:50,112 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:54:50,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:50,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047174836] [2021-10-14 11:54:50,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047174836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:50,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:50,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:50,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195949187] [2021-10-14 11:54:50,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:50,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:50,113 INFO L87 Difference]: Start difference. First operand 1168 states and 2211 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:50,585 INFO L93 Difference]: Finished difference Result 1933 states and 3629 transitions. [2021-10-14 11:54:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-14 11:54:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:50,589 INFO L225 Difference]: With dead ends: 1933 [2021-10-14 11:54:50,589 INFO L226 Difference]: Without dead ends: 1933 [2021-10-14 11:54:50,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 219.8ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-10-14 11:54:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2021-10-14 11:54:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1246. [2021-10-14 11:54:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1243 states have (on average 1.9042638777152052) internal successors, (2367), 1245 states have internal predecessors, (2367), 0 states have call successors, (0), 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:54:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2367 transitions. [2021-10-14 11:54:50,609 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2367 transitions. Word has length 57 [2021-10-14 11:54:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:50,609 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 2367 transitions. [2021-10-14 11:54:50,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2367 transitions. [2021-10-14 11:54:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:50,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:50,611 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] [2021-10-14 11:54:50,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-14 11:54:50,615 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash -749441975, now seen corresponding path program 7 times [2021-10-14 11:54:50,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:50,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980975618] [2021-10-14 11:54:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:50,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:50,729 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:54:50,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:50,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980975618] [2021-10-14 11:54:50,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980975618] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:50,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:50,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:50,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859625987] [2021-10-14 11:54:50,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:50,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:50,733 INFO L87 Difference]: Start difference. First operand 1246 states and 2367 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:51,407 INFO L93 Difference]: Finished difference Result 2036 states and 3813 transitions. [2021-10-14 11:54:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:54:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:51,412 INFO L225 Difference]: With dead ends: 2036 [2021-10-14 11:54:51,412 INFO L226 Difference]: Without dead ends: 2036 [2021-10-14 11:54:51,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 285.2ms TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:54:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2021-10-14 11:54:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1264. [2021-10-14 11:54:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1261 states have (on average 1.9056304520222045) internal successors, (2403), 1263 states have internal predecessors, (2403), 0 states have call successors, (0), 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:54:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2403 transitions. [2021-10-14 11:54:51,427 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2403 transitions. Word has length 57 [2021-10-14 11:54:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:51,428 INFO L470 AbstractCegarLoop]: Abstraction has 1264 states and 2403 transitions. [2021-10-14 11:54:51,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2403 transitions. [2021-10-14 11:54:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:51,429 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:51,429 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] [2021-10-14 11:54:51,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-14 11:54:51,430 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1978794053, now seen corresponding path program 8 times [2021-10-14 11:54:51,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:51,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614566611] [2021-10-14 11:54:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:51,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:51,547 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:54:51,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:51,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614566611] [2021-10-14 11:54:51,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614566611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:51,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:51,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:51,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293328171] [2021-10-14 11:54:51,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:51,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:51,548 INFO L87 Difference]: Start difference. First operand 1264 states and 2403 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:52,177 INFO L93 Difference]: Finished difference Result 2016 states and 3784 transitions. [2021-10-14 11:54:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-14 11:54:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:52,181 INFO L225 Difference]: With dead ends: 2016 [2021-10-14 11:54:52,182 INFO L226 Difference]: Without dead ends: 2016 [2021-10-14 11:54:52,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 161.7ms TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:54:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2021-10-14 11:54:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1439. [2021-10-14 11:54:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1436 states have (on average 1.9171309192200556) internal successors, (2753), 1438 states have internal predecessors, (2753), 0 states have call successors, (0), 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:54:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2753 transitions. [2021-10-14 11:54:52,199 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2753 transitions. Word has length 57 [2021-10-14 11:54:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:52,199 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 2753 transitions. [2021-10-14 11:54:52,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2753 transitions. [2021-10-14 11:54:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:52,201 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:52,201 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] [2021-10-14 11:54:52,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-14 11:54:52,201 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -5194568, now seen corresponding path program 8 times [2021-10-14 11:54:52,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:52,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732465601] [2021-10-14 11:54:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:52,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:52,297 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:54:52,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:52,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732465601] [2021-10-14 11:54:52,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732465601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:52,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:52,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:52,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893848134] [2021-10-14 11:54:52,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:52,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:52,298 INFO L87 Difference]: Start difference. First operand 1439 states and 2753 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:52,915 INFO L93 Difference]: Finished difference Result 1891 states and 3563 transitions. [2021-10-14 11:54:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-14 11:54:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:52,918 INFO L225 Difference]: With dead ends: 1891 [2021-10-14 11:54:52,918 INFO L226 Difference]: Without dead ends: 1863 [2021-10-14 11:54:52,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 298.1ms TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2021-10-14 11:54:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2021-10-14 11:54:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1222. [2021-10-14 11:54:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1219 states have (on average 1.9023789991796554) internal successors, (2319), 1221 states have internal predecessors, (2319), 0 states have call successors, (0), 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:54:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2319 transitions. [2021-10-14 11:54:52,933 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2319 transitions. Word has length 57 [2021-10-14 11:54:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:52,933 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 2319 transitions. [2021-10-14 11:54:52,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2319 transitions. [2021-10-14 11:54:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:52,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:52,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] [2021-10-14 11:54:52,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-14 11:54:52,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1653065823, now seen corresponding path program 9 times [2021-10-14 11:54:52,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:52,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313741601] [2021-10-14 11:54:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:52,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:53,042 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:54:53,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:53,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313741601] [2021-10-14 11:54:53,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313741601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:53,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:53,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:53,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971744341] [2021-10-14 11:54:53,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:53,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:53,044 INFO L87 Difference]: Start difference. First operand 1222 states and 2319 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:53,642 INFO L93 Difference]: Finished difference Result 1376 states and 2577 transitions. [2021-10-14 11:54:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-14 11:54:53,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:53,645 INFO L225 Difference]: With dead ends: 1376 [2021-10-14 11:54:53,645 INFO L226 Difference]: Without dead ends: 1376 [2021-10-14 11:54:53,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 303.4ms TimeCoverageRelationStatistics Valid=235, Invalid=467, Unknown=0, NotChecked=0, Total=702 [2021-10-14 11:54:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2021-10-14 11:54:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1216. [2021-10-14 11:54:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1213 states have (on average 1.9018961253091509) internal successors, (2307), 1215 states have internal predecessors, (2307), 0 states have call successors, (0), 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:54:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 2307 transitions. [2021-10-14 11:54:53,657 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 2307 transitions. Word has length 57 [2021-10-14 11:54:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:53,658 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 2307 transitions. [2021-10-14 11:54:53,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2307 transitions. [2021-10-14 11:54:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:53,659 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:53,659 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] [2021-10-14 11:54:53,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-14 11:54:53,659 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1565397019, now seen corresponding path program 10 times [2021-10-14 11:54:53,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:53,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334449303] [2021-10-14 11:54:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:53,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:53,766 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:54:53,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:53,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334449303] [2021-10-14 11:54:53,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334449303] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:53,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:53,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:53,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717688239] [2021-10-14 11:54:53,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:53,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:53,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:53,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:53,767 INFO L87 Difference]: Start difference. First operand 1216 states and 2307 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:54,523 INFO L93 Difference]: Finished difference Result 1414 states and 2636 transitions. [2021-10-14 11:54:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-14 11:54:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:54,526 INFO L225 Difference]: With dead ends: 1414 [2021-10-14 11:54:54,526 INFO L226 Difference]: Without dead ends: 1414 [2021-10-14 11:54:54,526 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 326.8ms TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:54:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-10-14 11:54:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1168. [2021-10-14 11:54:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1165 states have (on average 1.8978540772532189) internal successors, (2211), 1167 states have internal predecessors, (2211), 0 states have call successors, (0), 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:54:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2211 transitions. [2021-10-14 11:54:54,539 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2211 transitions. Word has length 57 [2021-10-14 11:54:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:54,539 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2211 transitions. [2021-10-14 11:54:54,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2211 transitions. [2021-10-14 11:54:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:54,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:54,541 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] [2021-10-14 11:54:54,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-14 11:54:54,541 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1251600807, now seen corresponding path program 11 times [2021-10-14 11:54:54,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:54,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212316263] [2021-10-14 11:54:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:54,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:54,646 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:54:54,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:54,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212316263] [2021-10-14 11:54:54,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212316263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:54,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:54,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:54,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055003906] [2021-10-14 11:54:54,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:54,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:54,648 INFO L87 Difference]: Start difference. First operand 1168 states and 2211 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:55,145 INFO L93 Difference]: Finished difference Result 1911 states and 3588 transitions. [2021-10-14 11:54:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:54:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:55,149 INFO L225 Difference]: With dead ends: 1911 [2021-10-14 11:54:55,149 INFO L226 Difference]: Without dead ends: 1911 [2021-10-14 11:54:55,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 194.5ms TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2021-10-14 11:54:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2021-10-14 11:54:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1201. [2021-10-14 11:54:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1198 states have (on average 1.9031719532554257) internal successors, (2280), 1200 states have internal predecessors, (2280), 0 states have call successors, (0), 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:54:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2280 transitions. [2021-10-14 11:54:55,163 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2280 transitions. Word has length 57 [2021-10-14 11:54:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:55,163 INFO L470 AbstractCegarLoop]: Abstraction has 1201 states and 2280 transitions. [2021-10-14 11:54:55,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2280 transitions. [2021-10-14 11:54:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:55,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:55,165 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] [2021-10-14 11:54:55,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-14 11:54:55,165 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1339269611, now seen corresponding path program 12 times [2021-10-14 11:54:55,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:55,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370696621] [2021-10-14 11:54:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:55,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:55,278 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:54:55,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:55,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370696621] [2021-10-14 11:54:55,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370696621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:55,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:55,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:55,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534548795] [2021-10-14 11:54:55,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:55,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:55,280 INFO L87 Difference]: Start difference. First operand 1201 states and 2280 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:56,037 INFO L93 Difference]: Finished difference Result 2014 states and 3772 transitions. [2021-10-14 11:54:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-14 11:54:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:56,040 INFO L225 Difference]: With dead ends: 2014 [2021-10-14 11:54:56,040 INFO L226 Difference]: Without dead ends: 2014 [2021-10-14 11:54:56,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 282.0ms TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2021-10-14 11:54:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2021-10-14 11:54:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1219. [2021-10-14 11:54:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1216 states have (on average 1.9046052631578947) internal successors, (2316), 1218 states have internal predecessors, (2316), 0 states have call successors, (0), 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:54:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2316 transitions. [2021-10-14 11:54:56,054 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2316 transitions. Word has length 57 [2021-10-14 11:54:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:56,054 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 2316 transitions. [2021-10-14 11:54:56,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2316 transitions. [2021-10-14 11:54:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:56,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:56,056 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] [2021-10-14 11:54:56,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-14 11:54:56,056 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash -227461657, now seen corresponding path program 13 times [2021-10-14 11:54:56,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:56,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907280966] [2021-10-14 11:54:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:56,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:56,162 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:54:56,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:56,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907280966] [2021-10-14 11:54:56,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907280966] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:56,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:56,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:56,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694789736] [2021-10-14 11:54:56,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:56,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:56,163 INFO L87 Difference]: Start difference. First operand 1219 states and 2316 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:56,729 INFO L93 Difference]: Finished difference Result 2474 states and 4647 transitions. [2021-10-14 11:54:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-14 11:54:56,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:56,734 INFO L225 Difference]: With dead ends: 2474 [2021-10-14 11:54:56,734 INFO L226 Difference]: Without dead ends: 2474 [2021-10-14 11:54:56,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 180.0ms TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2021-10-14 11:54:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2021-10-14 11:54:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1394. [2021-10-14 11:54:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1391 states have (on average 1.916606757728253) internal successors, (2666), 1393 states have internal predecessors, (2666), 0 states have call successors, (0), 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:54:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2666 transitions. [2021-10-14 11:54:56,750 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2666 transitions. Word has length 57 [2021-10-14 11:54:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:56,750 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2666 transitions. [2021-10-14 11:54:56,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2666 transitions. [2021-10-14 11:54:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:56,752 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:56,752 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] [2021-10-14 11:54:56,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-14 11:54:56,752 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2083517018, now seen corresponding path program 9 times [2021-10-14 11:54:56,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:56,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99488802] [2021-10-14 11:54:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:56,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:56,841 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:54:56,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:56,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99488802] [2021-10-14 11:54:56,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99488802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:56,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:56,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:56,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470664333] [2021-10-14 11:54:56,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:56,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:56,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:56,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:56,842 INFO L87 Difference]: Start difference. First operand 1394 states and 2666 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:57,715 INFO L93 Difference]: Finished difference Result 2453 states and 4624 transitions. [2021-10-14 11:54:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-14 11:54:57,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:57,719 INFO L225 Difference]: With dead ends: 2453 [2021-10-14 11:54:57,719 INFO L226 Difference]: Without dead ends: 2425 [2021-10-14 11:54:57,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 352.4ms TimeCoverageRelationStatistics Valid=435, Invalid=971, Unknown=0, NotChecked=0, Total=1406 [2021-10-14 11:54:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2021-10-14 11:54:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1123. [2021-10-14 11:54:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1120 states have (on average 1.8964285714285714) internal successors, (2124), 1122 states have internal predecessors, (2124), 0 states have call successors, (0), 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:54:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2124 transitions. [2021-10-14 11:54:57,732 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2124 transitions. Word has length 57 [2021-10-14 11:54:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:57,733 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 2124 transitions. [2021-10-14 11:54:57,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2124 transitions. [2021-10-14 11:54:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:57,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:57,734 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] [2021-10-14 11:54:57,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-14 11:54:57,734 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -357718223, now seen corresponding path program 14 times [2021-10-14 11:54:57,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:57,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312350066] [2021-10-14 11:54:57,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:57,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:57,834 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:54:57,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:57,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312350066] [2021-10-14 11:54:57,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312350066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:57,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:57,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:57,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043521621] [2021-10-14 11:54:57,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:57,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:57,835 INFO L87 Difference]: Start difference. First operand 1123 states and 2124 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:58,330 INFO L93 Difference]: Finished difference Result 1741 states and 3279 transitions. [2021-10-14 11:54:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-14 11:54:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:58,341 INFO L225 Difference]: With dead ends: 1741 [2021-10-14 11:54:58,341 INFO L226 Difference]: Without dead ends: 1741 [2021-10-14 11:54:58,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 162.8ms TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:54:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2021-10-14 11:54:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1015. [2021-10-14 11:54:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1013 states have (on average 1.9111549851924976) internal successors, (1936), 1014 states have internal predecessors, (1936), 0 states have call successors, (0), 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:54:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1936 transitions. [2021-10-14 11:54:58,352 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1936 transitions. Word has length 57 [2021-10-14 11:54:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:58,352 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1936 transitions. [2021-10-14 11:54:58,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1936 transitions. [2021-10-14 11:54:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-14 11:54:58,353 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:58,353 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] [2021-10-14 11:54:58,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-14 11:54:58,353 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1712687460, now seen corresponding path program 10 times [2021-10-14 11:54:58,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:58,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880573336] [2021-10-14 11:54:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:58,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:58,453 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:54:58,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:58,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880573336] [2021-10-14 11:54:58,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880573336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:58,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:58,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-14 11:54:58,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527089130] [2021-10-14 11:54:58,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-14 11:54:58,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-14 11:54:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-14 11:54:58,455 INFO L87 Difference]: Start difference. First operand 1015 states and 1936 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:59,195 INFO L93 Difference]: Finished difference Result 1793 states and 3383 transitions. [2021-10-14 11:54:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-14 11:54:59,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-14 11:54:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:59,197 INFO L225 Difference]: With dead ends: 1793 [2021-10-14 11:54:59,197 INFO L226 Difference]: Without dead ends: 1765 [2021-10-14 11:54:59,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 293.2ms TimeCoverageRelationStatistics Valid=343, Invalid=779, Unknown=0, NotChecked=0, Total=1122 [2021-10-14 11:54:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-10-14 11:54:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 666. [2021-10-14 11:54:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 1.8796992481203008) internal successors, (1250), 665 states have internal predecessors, (1250), 0 states have call successors, (0), 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:54:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1250 transitions. [2021-10-14 11:54:59,206 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1250 transitions. Word has length 57 [2021-10-14 11:54:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:59,206 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 1250 transitions. [2021-10-14 11:54:59,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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:54:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1250 transitions. [2021-10-14 11:54:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:54:59,207 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:59,207 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] [2021-10-14 11:54:59,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-14 11:54:59,207 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash -770341517, now seen corresponding path program 1 times [2021-10-14 11:54:59,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:59,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953922046] [2021-10-14 11:54:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:59,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:59,355 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:54:59,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:59,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953922046] [2021-10-14 11:54:59,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953922046] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:59,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:59,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-14 11:54:59,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248825171] [2021-10-14 11:54:59,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-14 11:54:59,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-14 11:54:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-10-14 11:54:59,358 INFO L87 Difference]: Start difference. First operand 666 states and 1250 transitions. Second operand has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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:54:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:54:59,767 INFO L93 Difference]: Finished difference Result 750 states and 1393 transitions. [2021-10-14 11:54:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-14 11:54:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:54:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:54:59,768 INFO L225 Difference]: With dead ends: 750 [2021-10-14 11:54:59,768 INFO L226 Difference]: Without dead ends: 514 [2021-10-14 11:54:59,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 303.4ms TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2021-10-14 11:54:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-14 11:54:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 478. [2021-10-14 11:54:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.8385744234800838) internal successors, (877), 477 states have internal predecessors, (877), 0 states have call successors, (0), 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:54:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 877 transitions. [2021-10-14 11:54:59,777 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 877 transitions. Word has length 74 [2021-10-14 11:54:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:54:59,778 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 877 transitions. [2021-10-14 11:54:59,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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:54:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 877 transitions. [2021-10-14 11:54:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:54:59,778 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:54:59,779 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] [2021-10-14 11:54:59,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-14 11:54:59,779 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:54:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:54:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash -14020197, now seen corresponding path program 2 times [2021-10-14 11:54:59,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:54:59,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687346899] [2021-10-14 11:54:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:54:59,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:54:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:54:59,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:54:59,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:54:59,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687346899] [2021-10-14 11:54:59,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687346899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:54:59,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:54:59,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:54:59,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25068785] [2021-10-14 11:54:59,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:54:59,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:54:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:54:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:54:59,999 INFO L87 Difference]: Start difference. First operand 478 states and 877 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:01,075 INFO L93 Difference]: Finished difference Result 814 states and 1496 transitions. [2021-10-14 11:55:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-14 11:55:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:01,076 INFO L225 Difference]: With dead ends: 814 [2021-10-14 11:55:01,076 INFO L226 Difference]: Without dead ends: 486 [2021-10-14 11:55:01,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 742.8ms TimeCoverageRelationStatistics Valid=418, Invalid=988, Unknown=0, NotChecked=0, Total=1406 [2021-10-14 11:55:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-10-14 11:55:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 450. [2021-10-14 11:55:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.8285077951002227) internal successors, (821), 449 states have internal predecessors, (821), 0 states have call successors, (0), 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:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 821 transitions. [2021-10-14 11:55:01,081 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 821 transitions. Word has length 74 [2021-10-14 11:55:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:01,081 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 821 transitions. [2021-10-14 11:55:01,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 821 transitions. [2021-10-14 11:55:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:01,082 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:01,082 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] [2021-10-14 11:55:01,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-14 11:55:01,082 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1248989697, now seen corresponding path program 3 times [2021-10-14 11:55:01,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:01,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334228905] [2021-10-14 11:55:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:01,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:01,429 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:01,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:01,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334228905] [2021-10-14 11:55:01,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334228905] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:01,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:01,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:01,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937317377] [2021-10-14 11:55:01,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:01,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:01,430 INFO L87 Difference]: Start difference. First operand 450 states and 821 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:02,238 INFO L93 Difference]: Finished difference Result 922 states and 1679 transitions. [2021-10-14 11:55:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:55:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:02,240 INFO L225 Difference]: With dead ends: 922 [2021-10-14 11:55:02,240 INFO L226 Difference]: Without dead ends: 835 [2021-10-14 11:55:02,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 589.1ms TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:55:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-10-14 11:55:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 495. [2021-10-14 11:55:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.8380566801619433) internal successors, (908), 494 states have internal predecessors, (908), 0 states have call successors, (0), 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:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 908 transitions. [2021-10-14 11:55:02,245 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 908 transitions. Word has length 74 [2021-10-14 11:55:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:02,246 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 908 transitions. [2021-10-14 11:55:02,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 908 transitions. [2021-10-14 11:55:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:02,247 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:02,247 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] [2021-10-14 11:55:02,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-14 11:55:02,247 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1335847485, now seen corresponding path program 4 times [2021-10-14 11:55:02,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:02,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824294523] [2021-10-14 11:55:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:02,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:02,614 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:02,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:02,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824294523] [2021-10-14 11:55:02,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824294523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:02,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:02,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:02,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035919247] [2021-10-14 11:55:02,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:02,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:02,616 INFO L87 Difference]: Start difference. First operand 495 states and 908 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:03,338 INFO L93 Difference]: Finished difference Result 939 states and 1712 transitions. [2021-10-14 11:55:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-14 11:55:03,338 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:03,339 INFO L225 Difference]: With dead ends: 939 [2021-10-14 11:55:03,339 INFO L226 Difference]: Without dead ends: 832 [2021-10-14 11:55:03,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 589.1ms TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-10-14 11:55:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 492. [2021-10-14 11:55:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.8370672097759675) internal successors, (902), 491 states have internal predecessors, (902), 0 states have call successors, (0), 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:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 902 transitions. [2021-10-14 11:55:03,345 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 902 transitions. Word has length 74 [2021-10-14 11:55:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:03,345 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 902 transitions. [2021-10-14 11:55:03,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 902 transitions. [2021-10-14 11:55:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:03,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:03,346 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] [2021-10-14 11:55:03,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-14 11:55:03,346 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash -552284735, now seen corresponding path program 5 times [2021-10-14 11:55:03,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:03,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078246619] [2021-10-14 11:55:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:03,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:03,663 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:03,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:03,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078246619] [2021-10-14 11:55:03,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078246619] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:03,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:03,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:03,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410271259] [2021-10-14 11:55:03,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:03,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:03,664 INFO L87 Difference]: Start difference. First operand 492 states and 902 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:04,252 INFO L93 Difference]: Finished difference Result 1054 states and 1940 transitions. [2021-10-14 11:55:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:55:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:04,253 INFO L225 Difference]: With dead ends: 1054 [2021-10-14 11:55:04,253 INFO L226 Difference]: Without dead ends: 763 [2021-10-14 11:55:04,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 436.1ms TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:55:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2021-10-14 11:55:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 459. [2021-10-14 11:55:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.8253275109170306) internal successors, (836), 458 states have internal predecessors, (836), 0 states have call successors, (0), 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:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 836 transitions. [2021-10-14 11:55:04,258 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 836 transitions. Word has length 74 [2021-10-14 11:55:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:04,259 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 836 transitions. [2021-10-14 11:55:04,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 836 transitions. [2021-10-14 11:55:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:04,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:04,260 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] [2021-10-14 11:55:04,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-14 11:55:04,260 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1715862595, now seen corresponding path program 6 times [2021-10-14 11:55:04,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:04,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028917253] [2021-10-14 11:55:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:04,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:04,602 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:04,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:04,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028917253] [2021-10-14 11:55:04,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028917253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:04,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:04,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-14 11:55:04,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509760024] [2021-10-14 11:55:04,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-14 11:55:04,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-14 11:55:04,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-10-14 11:55:04,604 INFO L87 Difference]: Start difference. First operand 459 states and 836 transitions. Second operand has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 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:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:05,199 INFO L93 Difference]: Finished difference Result 759 states and 1392 transitions. [2021-10-14 11:55:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:55:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:05,200 INFO L225 Difference]: With dead ends: 759 [2021-10-14 11:55:05,200 INFO L226 Difference]: Without dead ends: 444 [2021-10-14 11:55:05,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 319.5ms TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-10-14 11:55:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-14 11:55:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2021-10-14 11:55:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.8261851015801354) internal successors, (809), 443 states have internal predecessors, (809), 0 states have call successors, (0), 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:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 809 transitions. [2021-10-14 11:55:05,204 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 809 transitions. Word has length 74 [2021-10-14 11:55:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:05,205 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 809 transitions. [2021-10-14 11:55:05,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 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:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 809 transitions. [2021-10-14 11:55:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:05,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:05,205 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] [2021-10-14 11:55:05,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-14 11:55:05,206 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1489690925, now seen corresponding path program 7 times [2021-10-14 11:55:05,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:05,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995915808] [2021-10-14 11:55:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:05,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:05,573 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:05,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:05,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995915808] [2021-10-14 11:55:05,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995915808] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:05,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:05,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:05,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463814621] [2021-10-14 11:55:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:05,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:05,574 INFO L87 Difference]: Start difference. First operand 444 states and 809 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:06,556 INFO L93 Difference]: Finished difference Result 897 states and 1624 transitions. [2021-10-14 11:55:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:55:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:06,559 INFO L225 Difference]: With dead ends: 897 [2021-10-14 11:55:06,559 INFO L226 Difference]: Without dead ends: 810 [2021-10-14 11:55:06,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 814.1ms TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:55:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-10-14 11:55:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 480. [2021-10-14 11:55:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.8329853862212944) internal successors, (878), 479 states have internal predecessors, (878), 0 states have call successors, (0), 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:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 878 transitions. [2021-10-14 11:55:06,565 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 878 transitions. Word has length 74 [2021-10-14 11:55:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:06,565 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 878 transitions. [2021-10-14 11:55:06,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 878 transitions. [2021-10-14 11:55:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:06,566 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:06,566 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] [2021-10-14 11:55:06,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-14 11:55:06,566 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1576548713, now seen corresponding path program 8 times [2021-10-14 11:55:06,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:06,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072625810] [2021-10-14 11:55:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:06,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:06,880 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:06,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:06,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072625810] [2021-10-14 11:55:06,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072625810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:06,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:06,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:06,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928000425] [2021-10-14 11:55:06,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:06,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:06,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:06,882 INFO L87 Difference]: Start difference. First operand 480 states and 878 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:07,864 INFO L93 Difference]: Finished difference Result 914 states and 1657 transitions. [2021-10-14 11:55:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-14 11:55:07,865 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:07,866 INFO L225 Difference]: With dead ends: 914 [2021-10-14 11:55:07,866 INFO L226 Difference]: Without dead ends: 807 [2021-10-14 11:55:07,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 775.4ms TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-14 11:55:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 477. [2021-10-14 11:55:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.8319327731092436) internal successors, (872), 476 states have internal predecessors, (872), 0 states have call successors, (0), 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:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 872 transitions. [2021-10-14 11:55:07,871 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 872 transitions. Word has length 74 [2021-10-14 11:55:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:07,871 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 872 transitions. [2021-10-14 11:55:07,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 872 transitions. [2021-10-14 11:55:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:07,872 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:07,872 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] [2021-10-14 11:55:07,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-14 11:55:07,872 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -311583507, now seen corresponding path program 9 times [2021-10-14 11:55:07,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:07,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482446248] [2021-10-14 11:55:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:07,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:08,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:08,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:08,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482446248] [2021-10-14 11:55:08,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482446248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:08,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:08,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:08,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787210603] [2021-10-14 11:55:08,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:08,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:08,235 INFO L87 Difference]: Start difference. First operand 477 states and 872 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:08,912 INFO L93 Difference]: Finished difference Result 855 states and 1553 transitions. [2021-10-14 11:55:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:55:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:08,913 INFO L225 Difference]: With dead ends: 855 [2021-10-14 11:55:08,913 INFO L226 Difference]: Without dead ends: 564 [2021-10-14 11:55:08,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 558.9ms TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:55:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-10-14 11:55:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 444. [2021-10-14 11:55:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.8013544018058691) internal successors, (798), 443 states have internal predecessors, (798), 0 states have call successors, (0), 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:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 798 transitions. [2021-10-14 11:55:08,918 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 798 transitions. Word has length 74 [2021-10-14 11:55:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:08,918 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 798 transitions. [2021-10-14 11:55:08,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 798 transitions. [2021-10-14 11:55:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:08,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:08,919 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] [2021-10-14 11:55:08,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-14 11:55:08,919 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash -22443759, now seen corresponding path program 10 times [2021-10-14 11:55:08,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:08,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993434467] [2021-10-14 11:55:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:08,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:09,251 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:09,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:09,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993434467] [2021-10-14 11:55:09,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993434467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:09,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:09,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:09,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587099396] [2021-10-14 11:55:09,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:09,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:09,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:09,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:09,253 INFO L87 Difference]: Start difference. First operand 444 states and 798 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:10,354 INFO L93 Difference]: Finished difference Result 590 states and 1044 transitions. [2021-10-14 11:55:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-14 11:55:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:10,356 INFO L225 Difference]: With dead ends: 590 [2021-10-14 11:55:10,356 INFO L226 Difference]: Without dead ends: 494 [2021-10-14 11:55:10,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 816.7ms TimeCoverageRelationStatistics Valid=303, Invalid=627, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:55:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-10-14 11:55:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 438. [2021-10-14 11:55:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.791762013729977) internal successors, (783), 437 states have internal predecessors, (783), 0 states have call successors, (0), 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:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 783 transitions. [2021-10-14 11:55:10,360 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 783 transitions. Word has length 74 [2021-10-14 11:55:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:10,360 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 783 transitions. [2021-10-14 11:55:10,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 783 transitions. [2021-10-14 11:55:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:10,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:10,361 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] [2021-10-14 11:55:10,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-14 11:55:10,361 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 64414029, now seen corresponding path program 11 times [2021-10-14 11:55:10,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:10,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990156555] [2021-10-14 11:55:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:10,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:10,721 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:10,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:10,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990156555] [2021-10-14 11:55:10,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990156555] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:10,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:10,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:10,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697868783] [2021-10-14 11:55:10,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:10,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:10,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:10,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:10,722 INFO L87 Difference]: Start difference. First operand 438 states and 783 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:11,742 INFO L93 Difference]: Finished difference Result 578 states and 1024 transitions. [2021-10-14 11:55:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-14 11:55:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:11,743 INFO L225 Difference]: With dead ends: 578 [2021-10-14 11:55:11,744 INFO L226 Difference]: Without dead ends: 435 [2021-10-14 11:55:11,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 780.1ms TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-14 11:55:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 399. [2021-10-14 11:55:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.806532663316583) internal successors, (719), 398 states have internal predecessors, (719), 0 states have call successors, (0), 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:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 719 transitions. [2021-10-14 11:55:11,748 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 719 transitions. Word has length 74 [2021-10-14 11:55:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:11,748 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 719 transitions. [2021-10-14 11:55:11,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 719 transitions. [2021-10-14 11:55:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:11,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:11,749 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] [2021-10-14 11:55:11,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-14 11:55:11,749 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 575497163, now seen corresponding path program 12 times [2021-10-14 11:55:11,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:11,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215567409] [2021-10-14 11:55:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:11,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:12,076 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:12,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:12,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215567409] [2021-10-14 11:55:12,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215567409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:12,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:12,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:12,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503076934] [2021-10-14 11:55:12,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:12,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:12,078 INFO L87 Difference]: Start difference. First operand 399 states and 719 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:13,085 INFO L93 Difference]: Finished difference Result 513 states and 909 transitions. [2021-10-14 11:55:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-14 11:55:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:13,086 INFO L225 Difference]: With dead ends: 513 [2021-10-14 11:55:13,086 INFO L226 Difference]: Without dead ends: 426 [2021-10-14 11:55:13,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 745.6ms TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:55:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-10-14 11:55:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 390. [2021-10-14 11:55:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.8020565552699228) internal successors, (701), 389 states have internal predecessors, (701), 0 states have call successors, (0), 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,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 701 transitions. [2021-10-14 11:55:13,090 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 701 transitions. Word has length 74 [2021-10-14 11:55:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:13,090 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 701 transitions. [2021-10-14 11:55:13,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,090 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 701 transitions. [2021-10-14 11:55:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:13,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:13,091 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] [2021-10-14 11:55:13,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-14 11:55:13,091 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash 662354951, now seen corresponding path program 13 times [2021-10-14 11:55:13,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:13,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466396195] [2021-10-14 11:55:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:13,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:13,438 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,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:13,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466396195] [2021-10-14 11:55:13,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466396195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:13,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:13,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:13,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686226641] [2021-10-14 11:55:13,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:13,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:13,439 INFO L87 Difference]: Start difference. First operand 390 states and 701 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:14,358 INFO L93 Difference]: Finished difference Result 530 states and 942 transitions. [2021-10-14 11:55:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-14 11:55:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:14,359 INFO L225 Difference]: With dead ends: 530 [2021-10-14 11:55:14,359 INFO L226 Difference]: Without dead ends: 423 [2021-10-14 11:55:14,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 722.4ms TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-14 11:55:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 387. [2021-10-14 11:55:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.8005181347150259) internal successors, (695), 386 states have internal predecessors, (695), 0 states have call successors, (0), 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 695 transitions. [2021-10-14 11:55:14,372 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 695 transitions. Word has length 74 [2021-10-14 11:55:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:14,372 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 695 transitions. [2021-10-14 11:55:14,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,372 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 695 transitions. [2021-10-14 11:55:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:14,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:14,373 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] [2021-10-14 11:55:14,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-14 11:55:14,373 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1225777269, now seen corresponding path program 14 times [2021-10-14 11:55:14,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:14,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013327564] [2021-10-14 11:55:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:14,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:14,698 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,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:14,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013327564] [2021-10-14 11:55:14,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013327564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:14,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:14,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-14 11:55:14,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089029314] [2021-10-14 11:55:14,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-14 11:55:14,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-14 11:55:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-14 11:55:14,700 INFO L87 Difference]: Start difference. First operand 387 states and 695 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:15,439 INFO L93 Difference]: Finished difference Result 645 states and 1170 transitions. [2021-10-14 11:55:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:55:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:15,440 INFO L225 Difference]: With dead ends: 645 [2021-10-14 11:55:15,440 INFO L226 Difference]: Without dead ends: 354 [2021-10-14 11:55:15,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 548.8ms TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:55:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-14 11:55:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-10-14 11:55:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.7818696883852692) internal successors, (629), 353 states have internal predecessors, (629), 0 states have call successors, (0), 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 629 transitions. [2021-10-14 11:55:15,443 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 629 transitions. Word has length 74 [2021-10-14 11:55:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:15,444 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 629 transitions. [2021-10-14 11:55:15,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 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,444 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 629 transitions. [2021-10-14 11:55:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-10-14 11:55:15,445 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:15,445 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] [2021-10-14 11:55:15,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-14 11:55:15,445 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2021-10-14 11:55:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash -181458047, now seen corresponding path program 15 times [2021-10-14 11:55:15,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:15,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262871835] [2021-10-14 11:55:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:15,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:15,765 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,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:15,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262871835] [2021-10-14 11:55:15,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262871835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:15,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:15,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-14 11:55:15,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221031104] [2021-10-14 11:55:15,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-14 11:55:15,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-14 11:55:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-10-14 11:55:15,766 INFO L87 Difference]: Start difference. First operand 354 states and 629 transitions. Second operand has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 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,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:16,222 INFO L93 Difference]: Finished difference Result 350 states and 622 transitions. [2021-10-14 11:55:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-14 11:55:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-10-14 11:55:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:16,222 INFO L225 Difference]: With dead ends: 350 [2021-10-14 11:55:16,222 INFO L226 Difference]: Without dead ends: 0 [2021-10-14 11:55:16,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 318.2ms TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-10-14 11:55:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-14 11:55:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-14 11:55:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-14 11:55:16,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2021-10-14 11:55:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:16,223 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-14 11:55:16,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.933333333333334) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 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,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-14 11:55:16,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-14 11:55:16,226 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:55:16,226 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-14 11:55:16,226 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:55:16,227 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:55:16,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-14 11:55:16,231 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-14 11:55:16,231 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-14 11:55:16,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:55:16 BasicIcfg [2021-10-14 11:55:16,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-14 11:55:16,233 INFO L168 Benchmark]: Toolchain (without parser) took 37698.03 ms. Allocated memory was 191.9 MB in the beginning and 294.6 MB in the end (delta: 102.8 MB). Free memory was 139.2 MB in the beginning and 250.9 MB in the end (delta: -111.7 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 11:55:16,233 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 191.9 MB. Free memory was 157.8 MB in the beginning and 157.7 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 11:55:16,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.65 ms. Allocated memory was 191.9 MB in the beginning and 239.1 MB in the end (delta: 47.2 MB). Free memory was 139.0 MB in the beginning and 200.4 MB in the end (delta: -61.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-10-14 11:55:16,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.49 ms. Allocated memory is still 239.1 MB. Free memory was 200.4 MB in the beginning and 198.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-14 11:55:16,234 INFO L168 Benchmark]: Boogie Preprocessor took 16.00 ms. Allocated memory is still 239.1 MB. Free memory was 198.3 MB in the beginning and 196.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-14 11:55:16,234 INFO L168 Benchmark]: RCFGBuilder took 344.16 ms. Allocated memory is still 239.1 MB. Free memory was 196.2 MB in the beginning and 181.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-10-14 11:55:16,234 INFO L168 Benchmark]: TraceAbstraction took 36842.84 ms. Allocated memory was 239.1 MB in the beginning and 294.6 MB in the end (delta: 55.6 MB). Free memory was 181.0 MB in the beginning and 250.9 MB in the end (delta: -70.0 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 11:55:16,235 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.31 ms. Allocated memory is still 191.9 MB. Free memory was 157.8 MB in the beginning and 157.7 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 435.65 ms. Allocated memory was 191.9 MB in the beginning and 239.1 MB in the end (delta: 47.2 MB). Free memory was 139.0 MB in the beginning and 200.4 MB in the end (delta: -61.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.49 ms. Allocated memory is still 239.1 MB. Free memory was 200.4 MB in the beginning and 198.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 16.00 ms. Allocated memory is still 239.1 MB. Free memory was 198.3 MB in the beginning and 196.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 344.16 ms. Allocated memory is still 239.1 MB. Free memory was 196.2 MB in the beginning and 181.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36842.84 ms. Allocated memory was 239.1 MB in the beginning and 294.6 MB in the end (delta: 55.6 MB). Free memory was 181.0 MB in the beginning and 250.9 MB in the end (delta: -70.0 MB). There was no memory consumed. 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 - PositiveResult [Line: 916]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 916]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 36728.1ms, OverallIterations: 41, TraceHistogramMax: 1, EmptinessCheckTime: 60.7ms, AutomataDifference: 27711.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 56.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6805 SDtfs, 18378 SDslu, 20904 SDs, 0 SdLazy, 27605 SolverSat, 3274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12388.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 67 SyntacticMatches, 81 SemanticMatches, 1008 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3202 ImplicationChecksByTransitivity, 15289.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1439occurred in iteration=13, InterpolantAutomatonStates: 674, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 556.2ms AutomataMinimizationTime, 41 MinimizatonAttempts, 18374 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 65.2ms SsaConstructionTime, 359.2ms SatisfiabilityAnalysisTime, 7578.3ms InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2530 ConstructedInterpolants, 0 QuantifiedInterpolants, 29487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-14 11:55:16,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...