/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:50:03,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:50:03,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:50:03,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:50:03,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:50:03,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:50:03,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:50:03,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:50:03,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:50:03,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:50:03,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:50:03,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:50:03,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:50:03,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:50:03,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:50:03,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:50:03,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:50:03,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:50:03,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:50:03,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:50:03,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:50:03,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:50:03,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:50:03,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:50:03,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:50:03,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:50:03,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:50:03,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:50:03,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:50:03,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:50:03,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:50:03,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:50:03,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:50:03,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:50:03,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:50:03,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:50:03,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:50:03,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:50:03,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:50:03,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:50:03,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:50:03,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 16:50:03,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:50:03,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:50:03,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:50:03,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:50:03,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:50:03,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:50:03,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:50:03,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:50:03,323 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:50:03,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:50:03,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:50:03,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:50:03,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:50:03,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-01 16:50:03,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:50:03,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:50:03,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:50:03,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:50:03,523 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:50:03,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-01 16:50:03,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bf506c9/8a82eee03c734488b2b2ba0e5ddcf016/FLAGf1e513efd [2022-03-01 16:50:04,052 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:50:04,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-01 16:50:04,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bf506c9/8a82eee03c734488b2b2ba0e5ddcf016/FLAGf1e513efd [2022-03-01 16:50:04,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bf506c9/8a82eee03c734488b2b2ba0e5ddcf016 [2022-03-01 16:50:04,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:50:04,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:50:04,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:50:04,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:50:04,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:50:04,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:04,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f6a4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04, skipping insertion in model container [2022-03-01 16:50:04,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:04,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:50:04,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:50:04,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:50:04,853 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:50:04,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:50:04,940 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:50:04,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04 WrapperNode [2022-03-01 16:50:04,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:50:04,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:50:04,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:50:04,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:50:04,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:04,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,000 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2022-03-01 16:50:05,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:50:05,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:50:05,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:50:05,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:50:05,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:50:05,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:50:05,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:50:05,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:50:05,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (1/1) ... [2022-03-01 16:50:05,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:50:05,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:05,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 16:50:05,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:50:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-01 16:50:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:50:05,136 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:50:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 16:50:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:50:05,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:50:05,137 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:50:05,298 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:50:05,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:50:05,751 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:50:05,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:50:05,761 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-01 16:50:05,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:50:05 BoogieIcfgContainer [2022-03-01 16:50:05,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:50:05,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:50:05,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:50:05,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:50:05,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:50:04" (1/3) ... [2022-03-01 16:50:05,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b9bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:50:05, skipping insertion in model container [2022-03-01 16:50:05,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:50:04" (2/3) ... [2022-03-01 16:50:05,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b9bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:50:05, skipping insertion in model container [2022-03-01 16:50:05,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:50:05" (3/3) ... [2022-03-01 16:50:05,783 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-03-01 16:50:05,787 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:50:05,787 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:50:05,788 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-03-01 16:50:05,788 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:50:05,850 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,851 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,852 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,853 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,854 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,855 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,856 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,857 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,858 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,859 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,860 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,861 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,863 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,863 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,871 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,882 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,883 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,884 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,885 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,886 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,887 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,902 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,910 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:50:05,912 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:50:05,947 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:50:05,951 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 16:50:05,951 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-03-01 16:50:05,961 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 290 places, 286 transitions, 577 flow [2022-03-01 16:50:06,067 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:50:06,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:06,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:06,080 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2019786680, now seen corresponding path program 1 times [2022-03-01 16:50:06,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:06,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150300] [2022-03-01 16:50:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:06,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:06,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150300] [2022-03-01 16:50:06,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157150300] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:06,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:06,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:06,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361006692] [2022-03-01 16:50:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:06,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:06,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:06,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:06,389 INFO L87 Difference]: Start difference. First operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:06,686 INFO L93 Difference]: Finished difference Result 4075 states and 7866 transitions. [2022-03-01 16:50:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:06,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-01 16:50:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:06,712 INFO L225 Difference]: With dead ends: 4075 [2022-03-01 16:50:06,712 INFO L226 Difference]: Without dead ends: 4075 [2022-03-01 16:50:06,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:06,717 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:06,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 585 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-03-01 16:50:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4075. [2022-03-01 16:50:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 4002 states have (on average 1.9655172413793103) internal successors, (7866), 4074 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7866 transitions. [2022-03-01 16:50:06,844 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7866 transitions. Word has length 50 [2022-03-01 16:50:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:06,845 INFO L470 AbstractCegarLoop]: Abstraction has 4075 states and 7866 transitions. [2022-03-01 16:50:06,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7866 transitions. [2022-03-01 16:50:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-01 16:50:06,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:06,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:06,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:50:06,847 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash 433367205, now seen corresponding path program 1 times [2022-03-01 16:50:06,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:06,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616614503] [2022-03-01 16:50:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:06,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:07,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616614503] [2022-03-01 16:50:07,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616614503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:07,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:07,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561496215] [2022-03-01 16:50:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:07,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:07,022 INFO L87 Difference]: Start difference. First operand 4075 states and 7866 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:07,282 INFO L93 Difference]: Finished difference Result 4072 states and 7863 transitions. [2022-03-01 16:50:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:07,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-03-01 16:50:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:07,294 INFO L225 Difference]: With dead ends: 4072 [2022-03-01 16:50:07,294 INFO L226 Difference]: Without dead ends: 4072 [2022-03-01 16:50:07,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:07,296 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 3 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:07,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4072 states. [2022-03-01 16:50:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4072 to 4072. [2022-03-01 16:50:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 4002 states have (on average 1.964767616191904) internal successors, (7863), 4071 states have internal predecessors, (7863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 7863 transitions. [2022-03-01 16:50:07,409 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 7863 transitions. Word has length 58 [2022-03-01 16:50:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:07,409 INFO L470 AbstractCegarLoop]: Abstraction has 4072 states and 7863 transitions. [2022-03-01 16:50:07,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 7863 transitions. [2022-03-01 16:50:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-01 16:50:07,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:07,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:07,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:50:07,413 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1886336480, now seen corresponding path program 1 times [2022-03-01 16:50:07,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:07,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024869571] [2022-03-01 16:50:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:07,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024869571] [2022-03-01 16:50:07,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024869571] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:07,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:50:07,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573524501] [2022-03-01 16:50:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:50:07,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:50:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:07,489 INFO L87 Difference]: Start difference. First operand 4072 states and 7863 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:07,517 INFO L93 Difference]: Finished difference Result 4071 states and 7862 transitions. [2022-03-01 16:50:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:50:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-03-01 16:50:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:07,530 INFO L225 Difference]: With dead ends: 4071 [2022-03-01 16:50:07,531 INFO L226 Difference]: Without dead ends: 4071 [2022-03-01 16:50:07,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:07,538 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:07,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-03-01 16:50:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2022-03-01 16:50:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 4002 states have (on average 1.9645177411294352) internal successors, (7862), 4070 states have internal predecessors, (7862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 7862 transitions. [2022-03-01 16:50:07,598 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 7862 transitions. Word has length 65 [2022-03-01 16:50:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:07,598 INFO L470 AbstractCegarLoop]: Abstraction has 4071 states and 7862 transitions. [2022-03-01 16:50:07,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 7862 transitions. [2022-03-01 16:50:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-01 16:50:07,599 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:07,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:07,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 16:50:07,599 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1758764611, now seen corresponding path program 1 times [2022-03-01 16:50:07,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:07,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753778421] [2022-03-01 16:50:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:07,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753778421] [2022-03-01 16:50:07,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753778421] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:07,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:50:07,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155150105] [2022-03-01 16:50:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:50:07,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:50:07,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:07,631 INFO L87 Difference]: Start difference. First operand 4071 states and 7862 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:07,654 INFO L93 Difference]: Finished difference Result 3943 states and 7610 transitions. [2022-03-01 16:50:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:50:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-03-01 16:50:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:07,665 INFO L225 Difference]: With dead ends: 3943 [2022-03-01 16:50:07,665 INFO L226 Difference]: Without dead ends: 3943 [2022-03-01 16:50:07,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:07,666 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 203 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:07,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 334 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2022-03-01 16:50:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3943. [2022-03-01 16:50:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3891 states have (on average 1.9557954253405294) internal successors, (7610), 3942 states have internal predecessors, (7610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 7610 transitions. [2022-03-01 16:50:07,738 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 7610 transitions. Word has length 69 [2022-03-01 16:50:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:07,738 INFO L470 AbstractCegarLoop]: Abstraction has 3943 states and 7610 transitions. [2022-03-01 16:50:07,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 7610 transitions. [2022-03-01 16:50:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-01 16:50:07,739 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:07,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:07,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 16:50:07,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 894955619, now seen corresponding path program 1 times [2022-03-01 16:50:07,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:07,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828116595] [2022-03-01 16:50:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:07,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828116595] [2022-03-01 16:50:07,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828116595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:07,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:07,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719395923] [2022-03-01 16:50:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:07,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:07,824 INFO L87 Difference]: Start difference. First operand 3943 states and 7610 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:07,984 INFO L93 Difference]: Finished difference Result 3942 states and 7609 transitions. [2022-03-01 16:50:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-03-01 16:50:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:07,995 INFO L225 Difference]: With dead ends: 3942 [2022-03-01 16:50:07,995 INFO L226 Difference]: Without dead ends: 3942 [2022-03-01 16:50:07,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:07,996 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:07,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:50:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2022-03-01 16:50:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2022-03-01 16:50:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3891 states have (on average 1.955538421999486) internal successors, (7609), 3941 states have internal predecessors, (7609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 7609 transitions. [2022-03-01 16:50:08,055 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 7609 transitions. Word has length 100 [2022-03-01 16:50:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,056 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 7609 transitions. [2022-03-01 16:50:08,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 7609 transitions. [2022-03-01 16:50:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-01 16:50:08,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:08,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 16:50:08,063 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1539731552, now seen corresponding path program 1 times [2022-03-01 16:50:08,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657537634] [2022-03-01 16:50:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:08,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:08,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657537634] [2022-03-01 16:50:08,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657537634] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:08,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:08,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:50:08,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622699106] [2022-03-01 16:50:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:08,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:50:08,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:50:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:08,151 INFO L87 Difference]: Start difference. First operand 3942 states and 7609 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,176 INFO L93 Difference]: Finished difference Result 3941 states and 7608 transitions. [2022-03-01 16:50:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:50:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-03-01 16:50:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,188 INFO L225 Difference]: With dead ends: 3941 [2022-03-01 16:50:08,188 INFO L226 Difference]: Without dead ends: 3941 [2022-03-01 16:50:08,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:08,189 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:08,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-03-01 16:50:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3941. [2022-03-01 16:50:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3891 states have (on average 1.9552814186584426) internal successors, (7608), 3940 states have internal predecessors, (7608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 7608 transitions. [2022-03-01 16:50:08,278 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 7608 transitions. Word has length 106 [2022-03-01 16:50:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,278 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 7608 transitions. [2022-03-01 16:50:08,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 7608 transitions. [2022-03-01 16:50:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-01 16:50:08,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:08,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 16:50:08,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -930597695, now seen corresponding path program 1 times [2022-03-01 16:50:08,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523267436] [2022-03-01 16:50:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:08,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:08,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523267436] [2022-03-01 16:50:08,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523267436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:08,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:08,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:50:08,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132061127] [2022-03-01 16:50:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:08,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:50:08,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:50:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:08,325 INFO L87 Difference]: Start difference. First operand 3941 states and 7608 transitions. Second operand has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,349 INFO L93 Difference]: Finished difference Result 3815 states and 7360 transitions. [2022-03-01 16:50:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:50:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-03-01 16:50:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,356 INFO L225 Difference]: With dead ends: 3815 [2022-03-01 16:50:08,357 INFO L226 Difference]: Without dead ends: 3815 [2022-03-01 16:50:08,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:08,357 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 156 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:08,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2022-03-01 16:50:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2022-03-01 16:50:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 3780 states have (on average 1.947089947089947) internal successors, (7360), 3814 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 7360 transitions. [2022-03-01 16:50:08,432 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 7360 transitions. Word has length 110 [2022-03-01 16:50:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,432 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 7360 transitions. [2022-03-01 16:50:08,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 7360 transitions. [2022-03-01 16:50:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-01 16:50:08,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:08,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 16:50:08,434 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1661222507, now seen corresponding path program 1 times [2022-03-01 16:50:08,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890227410] [2022-03-01 16:50:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:08,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:08,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890227410] [2022-03-01 16:50:08,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890227410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:08,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:08,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:08,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751939179] [2022-03-01 16:50:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:08,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:08,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:08,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:08,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:08,560 INFO L87 Difference]: Start difference. First operand 3815 states and 7360 transitions. Second operand has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,676 INFO L93 Difference]: Finished difference Result 3814 states and 7359 transitions. [2022-03-01 16:50:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-03-01 16:50:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,682 INFO L225 Difference]: With dead ends: 3814 [2022-03-01 16:50:08,682 INFO L226 Difference]: Without dead ends: 3814 [2022-03-01 16:50:08,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:08,683 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:08,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:50:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2022-03-01 16:50:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3814. [2022-03-01 16:50:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3780 states have (on average 1.9468253968253968) internal successors, (7359), 3813 states have internal predecessors, (7359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 7359 transitions. [2022-03-01 16:50:08,735 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 7359 transitions. Word has length 141 [2022-03-01 16:50:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,735 INFO L470 AbstractCegarLoop]: Abstraction has 3814 states and 7359 transitions. [2022-03-01 16:50:08,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 7359 transitions. [2022-03-01 16:50:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-03-01 16:50:08,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:08,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 16:50:08,737 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1597179399, now seen corresponding path program 1 times [2022-03-01 16:50:08,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:08,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406354018] [2022-03-01 16:50:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:08,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:08,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406354018] [2022-03-01 16:50:08,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406354018] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:08,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:08,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:08,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27546658] [2022-03-01 16:50:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:08,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:08,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:08,859 INFO L87 Difference]: Start difference. First operand 3814 states and 7359 transitions. Second operand has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:09,314 INFO L93 Difference]: Finished difference Result 5735 states and 11111 transitions. [2022-03-01 16:50:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:09,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-03-01 16:50:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:09,337 INFO L225 Difference]: With dead ends: 5735 [2022-03-01 16:50:09,337 INFO L226 Difference]: Without dead ends: 5735 [2022-03-01 16:50:09,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:09,338 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 205 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:09,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 832 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2022-03-01 16:50:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 3917. [2022-03-01 16:50:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3889 states have (on average 1.9444587297505787) internal successors, (7562), 3916 states have internal predecessors, (7562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 7562 transitions. [2022-03-01 16:50:09,415 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 7562 transitions. Word has length 157 [2022-03-01 16:50:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:09,415 INFO L470 AbstractCegarLoop]: Abstraction has 3917 states and 7562 transitions. [2022-03-01 16:50:09,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 7562 transitions. [2022-03-01 16:50:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-03-01 16:50:09,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:09,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:09,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:50:09,419 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699453, now seen corresponding path program 1 times [2022-03-01 16:50:09,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:09,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884836791] [2022-03-01 16:50:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:09,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:09,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:09,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884836791] [2022-03-01 16:50:09,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884836791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:09,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:09,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:09,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152323947] [2022-03-01 16:50:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:09,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:09,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:09,539 INFO L87 Difference]: Start difference. First operand 3917 states and 7562 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:09,826 INFO L93 Difference]: Finished difference Result 3863 states and 7455 transitions. [2022-03-01 16:50:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:09,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-03-01 16:50:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:09,832 INFO L225 Difference]: With dead ends: 3863 [2022-03-01 16:50:09,832 INFO L226 Difference]: Without dead ends: 3863 [2022-03-01 16:50:09,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:09,833 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 160 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:09,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 788 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-03-01 16:50:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3863. [2022-03-01 16:50:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3839 states have (on average 1.9419119562386038) internal successors, (7455), 3862 states have internal predecessors, (7455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 7455 transitions. [2022-03-01 16:50:09,878 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 7455 transitions. Word has length 163 [2022-03-01 16:50:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:09,878 INFO L470 AbstractCegarLoop]: Abstraction has 3863 states and 7455 transitions. [2022-03-01 16:50:09,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 7455 transitions. [2022-03-01 16:50:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-03-01 16:50:09,880 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:09,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:09,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:50:09,880 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 449131661, now seen corresponding path program 1 times [2022-03-01 16:50:09,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:09,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113584855] [2022-03-01 16:50:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:09,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:10,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:10,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113584855] [2022-03-01 16:50:10,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113584855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:10,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:10,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:10,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769223965] [2022-03-01 16:50:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:10,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:10,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:10,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:10,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:10,028 INFO L87 Difference]: Start difference. First operand 3863 states and 7455 transitions. Second operand has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:10,349 INFO L93 Difference]: Finished difference Result 5144 states and 9941 transitions. [2022-03-01 16:50:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2022-03-01 16:50:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:10,357 INFO L225 Difference]: With dead ends: 5144 [2022-03-01 16:50:10,357 INFO L226 Difference]: Without dead ends: 5064 [2022-03-01 16:50:10,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:10,358 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 221 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:10,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 655 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2022-03-01 16:50:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 4109. [2022-03-01 16:50:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4085 states have (on average 1.9414932680538555) internal successors, (7931), 4108 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 7931 transitions. [2022-03-01 16:50:10,410 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 7931 transitions. Word has length 167 [2022-03-01 16:50:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:10,410 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 7931 transitions. [2022-03-01 16:50:10,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 7931 transitions. [2022-03-01 16:50:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-03-01 16:50:10,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:10,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:10,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 16:50:10,412 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash 544060034, now seen corresponding path program 1 times [2022-03-01 16:50:10,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:10,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678413268] [2022-03-01 16:50:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:10,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:10,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678413268] [2022-03-01 16:50:10,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678413268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:10,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:10,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:10,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104047779] [2022-03-01 16:50:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:10,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:10,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:10,500 INFO L87 Difference]: Start difference. First operand 4109 states and 7931 transitions. Second operand has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:10,710 INFO L93 Difference]: Finished difference Result 4342 states and 8392 transitions. [2022-03-01 16:50:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:10,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-03-01 16:50:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:10,718 INFO L225 Difference]: With dead ends: 4342 [2022-03-01 16:50:10,718 INFO L226 Difference]: Without dead ends: 4342 [2022-03-01 16:50:10,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:10,719 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 154 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:10,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 687 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-03-01 16:50:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4286. [2022-03-01 16:50:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4262 states have (on average 1.9429845143125293) internal successors, (8281), 4285 states have internal predecessors, (8281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 8281 transitions. [2022-03-01 16:50:10,765 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 8281 transitions. Word has length 171 [2022-03-01 16:50:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:10,765 INFO L470 AbstractCegarLoop]: Abstraction has 4286 states and 8281 transitions. [2022-03-01 16:50:10,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 8281 transitions. [2022-03-01 16:50:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-01 16:50:10,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:10,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:10,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 16:50:10,767 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 654097040, now seen corresponding path program 1 times [2022-03-01 16:50:10,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:10,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418520852] [2022-03-01 16:50:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:10,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:10,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418520852] [2022-03-01 16:50:10,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418520852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:10,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:10,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:10,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460326240] [2022-03-01 16:50:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:10,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:10,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:10,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:10,883 INFO L87 Difference]: Start difference. First operand 4286 states and 8281 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:11,416 INFO L93 Difference]: Finished difference Result 4766 states and 9176 transitions. [2022-03-01 16:50:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:11,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-03-01 16:50:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:11,423 INFO L225 Difference]: With dead ends: 4766 [2022-03-01 16:50:11,424 INFO L226 Difference]: Without dead ends: 4502 [2022-03-01 16:50:11,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:11,424 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 287 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:11,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 1158 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:50:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2022-03-01 16:50:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4055. [2022-03-01 16:50:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4036 states have (on average 1.929633300297324) internal successors, (7788), 4054 states have internal predecessors, (7788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 7788 transitions. [2022-03-01 16:50:11,472 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 7788 transitions. Word has length 179 [2022-03-01 16:50:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:11,472 INFO L470 AbstractCegarLoop]: Abstraction has 4055 states and 7788 transitions. [2022-03-01 16:50:11,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 7788 transitions. [2022-03-01 16:50:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-01 16:50:11,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:11,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:11,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 16:50:11,474 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1572605453, now seen corresponding path program 1 times [2022-03-01 16:50:11,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:11,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306244076] [2022-03-01 16:50:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:11,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:11,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306244076] [2022-03-01 16:50:11,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306244076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:11,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:11,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:50:11,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98666113] [2022-03-01 16:50:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:11,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:50:11,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:50:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:11,542 INFO L87 Difference]: Start difference. First operand 4055 states and 7788 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:11,564 INFO L93 Difference]: Finished difference Result 3270 states and 6142 transitions. [2022-03-01 16:50:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:50:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-03-01 16:50:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:11,569 INFO L225 Difference]: With dead ends: 3270 [2022-03-01 16:50:11,569 INFO L226 Difference]: Without dead ends: 3270 [2022-03-01 16:50:11,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:50:11,570 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 99 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:11,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 548 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-03-01 16:50:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3074. [2022-03-01 16:50:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 3059 states have (on average 1.888852566198104) internal successors, (5778), 3073 states have internal predecessors, (5778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 5778 transitions. [2022-03-01 16:50:11,601 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 5778 transitions. Word has length 179 [2022-03-01 16:50:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:11,601 INFO L470 AbstractCegarLoop]: Abstraction has 3074 states and 5778 transitions. [2022-03-01 16:50:11,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 5778 transitions. [2022-03-01 16:50:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-03-01 16:50:11,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:11,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:11,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 16:50:11,603 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 859331813, now seen corresponding path program 1 times [2022-03-01 16:50:11,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:11,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945657207] [2022-03-01 16:50:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:11,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:11,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945657207] [2022-03-01 16:50:11,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945657207] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:11,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:11,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:11,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345404488] [2022-03-01 16:50:11,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:11,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:11,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:11,714 INFO L87 Difference]: Start difference. First operand 3074 states and 5778 transitions. Second operand has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:12,073 INFO L93 Difference]: Finished difference Result 3017 states and 5666 transitions. [2022-03-01 16:50:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2022-03-01 16:50:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:12,078 INFO L225 Difference]: With dead ends: 3017 [2022-03-01 16:50:12,078 INFO L226 Difference]: Without dead ends: 3017 [2022-03-01 16:50:12,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:12,078 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 148 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:12,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 976 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-03-01 16:50:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3017. [2022-03-01 16:50:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3005 states have (on average 1.8855241264559068) internal successors, (5666), 3016 states have internal predecessors, (5666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 5666 transitions. [2022-03-01 16:50:12,120 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 5666 transitions. Word has length 192 [2022-03-01 16:50:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:12,121 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 5666 transitions. [2022-03-01 16:50:12,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 5666 transitions. [2022-03-01 16:50:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:12,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:12,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:12,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 16:50:12,125 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 247325162, now seen corresponding path program 1 times [2022-03-01 16:50:12,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:12,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327049524] [2022-03-01 16:50:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:12,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:12,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327049524] [2022-03-01 16:50:12,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327049524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:12,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:12,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-01 16:50:12,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818053609] [2022-03-01 16:50:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:12,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 16:50:12,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 16:50:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:50:12,741 INFO L87 Difference]: Start difference. First operand 3017 states and 5666 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:14,379 INFO L93 Difference]: Finished difference Result 4046 states and 7656 transitions. [2022-03-01 16:50:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:50:14,379 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:14,388 INFO L225 Difference]: With dead ends: 4046 [2022-03-01 16:50:14,388 INFO L226 Difference]: Without dead ends: 4046 [2022-03-01 16:50:14,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:50:14,389 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1427 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:14,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 2423 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:50:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2022-03-01 16:50:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 3036. [2022-03-01 16:50:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3024 states have (on average 1.8862433862433863) internal successors, (5704), 3035 states have internal predecessors, (5704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5704 transitions. [2022-03-01 16:50:14,434 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5704 transitions. Word has length 200 [2022-03-01 16:50:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:14,434 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 5704 transitions. [2022-03-01 16:50:14,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5704 transitions. [2022-03-01 16:50:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:14,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:14,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:14,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 16:50:14,438 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2112059964, now seen corresponding path program 2 times [2022-03-01 16:50:14,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:14,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880940019] [2022-03-01 16:50:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:15,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:15,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880940019] [2022-03-01 16:50:15,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880940019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:15,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:15,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-01 16:50:15,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614239214] [2022-03-01 16:50:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:15,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 16:50:15,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 16:50:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:50:15,007 INFO L87 Difference]: Start difference. First operand 3036 states and 5704 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:16,573 INFO L93 Difference]: Finished difference Result 4129 states and 7822 transitions. [2022-03-01 16:50:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-01 16:50:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:16,612 INFO L225 Difference]: With dead ends: 4129 [2022-03-01 16:50:16,612 INFO L226 Difference]: Without dead ends: 4129 [2022-03-01 16:50:16,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:50:16,613 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1466 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:16,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 2420 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:50:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-03-01 16:50:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3059. [2022-03-01 16:50:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3047 states have (on average 1.8871020676074828) internal successors, (5750), 3058 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5750 transitions. [2022-03-01 16:50:16,658 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5750 transitions. Word has length 200 [2022-03-01 16:50:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:16,658 INFO L470 AbstractCegarLoop]: Abstraction has 3059 states and 5750 transitions. [2022-03-01 16:50:16,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5750 transitions. [2022-03-01 16:50:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:16,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:16,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:16,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 16:50:16,661 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1483591062, now seen corresponding path program 3 times [2022-03-01 16:50:16,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:16,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400406224] [2022-03-01 16:50:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:17,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:17,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400406224] [2022-03-01 16:50:17,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400406224] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:17,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:17,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-01 16:50:17,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980029466] [2022-03-01 16:50:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:17,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:50:17,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:50:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:17,743 INFO L87 Difference]: Start difference. First operand 3059 states and 5750 transitions. Second operand has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:19,835 INFO L93 Difference]: Finished difference Result 4567 states and 8691 transitions. [2022-03-01 16:50:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:50:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:19,850 INFO L225 Difference]: With dead ends: 4567 [2022-03-01 16:50:19,850 INFO L226 Difference]: Without dead ends: 4567 [2022-03-01 16:50:19,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=517, Invalid=2345, Unknown=0, NotChecked=0, Total=2862 [2022-03-01 16:50:19,851 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1526 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:19,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 2675 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:50:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4567 states. [2022-03-01 16:50:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4567 to 3083. [2022-03-01 16:50:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3071 states have (on average 1.8883099967437318) internal successors, (5799), 3082 states have internal predecessors, (5799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5799 transitions. [2022-03-01 16:50:19,890 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5799 transitions. Word has length 200 [2022-03-01 16:50:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:19,890 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 5799 transitions. [2022-03-01 16:50:19,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5799 transitions. [2022-03-01 16:50:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:19,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:19,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:19,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 16:50:19,893 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash -537915958, now seen corresponding path program 4 times [2022-03-01 16:50:19,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:19,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594185209] [2022-03-01 16:50:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:20,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:20,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594185209] [2022-03-01 16:50:20,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594185209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:20,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:20,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:20,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050601932] [2022-03-01 16:50:20,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:20,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:20,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:20,398 INFO L87 Difference]: Start difference. First operand 3083 states and 5799 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:22,713 INFO L93 Difference]: Finished difference Result 4559 states and 8657 transitions. [2022-03-01 16:50:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-01 16:50:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:22,720 INFO L225 Difference]: With dead ends: 4559 [2022-03-01 16:50:22,720 INFO L226 Difference]: Without dead ends: 4559 [2022-03-01 16:50:22,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=523, Invalid=2447, Unknown=0, NotChecked=0, Total=2970 [2022-03-01 16:50:22,721 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1320 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:22,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1320 Valid, 3535 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 16:50:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2022-03-01 16:50:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3107. [2022-03-01 16:50:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3095 states have (on average 1.8894991922455573) internal successors, (5848), 3106 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5848 transitions. [2022-03-01 16:50:22,756 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5848 transitions. Word has length 200 [2022-03-01 16:50:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:22,756 INFO L470 AbstractCegarLoop]: Abstraction has 3107 states and 5848 transitions. [2022-03-01 16:50:22,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5848 transitions. [2022-03-01 16:50:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:22,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:22,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:22,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 16:50:22,760 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1859248506, now seen corresponding path program 5 times [2022-03-01 16:50:22,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:22,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033491387] [2022-03-01 16:50:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:23,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:23,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033491387] [2022-03-01 16:50:23,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033491387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:23,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:23,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:23,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286733984] [2022-03-01 16:50:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:23,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:23,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:23,234 INFO L87 Difference]: Start difference. First operand 3107 states and 5848 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:24,511 INFO L93 Difference]: Finished difference Result 3564 states and 6712 transitions. [2022-03-01 16:50:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:50:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:24,545 INFO L225 Difference]: With dead ends: 3564 [2022-03-01 16:50:24,545 INFO L226 Difference]: Without dead ends: 3564 [2022-03-01 16:50:24,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=512, Invalid=2244, Unknown=0, NotChecked=0, Total=2756 [2022-03-01 16:50:24,548 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 1582 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:24,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 2282 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:50:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2022-03-01 16:50:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2990. [2022-03-01 16:50:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2979 states have (on average 1.8848606915072172) internal successors, (5615), 2989 states have internal predecessors, (5615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5615 transitions. [2022-03-01 16:50:24,619 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5615 transitions. Word has length 200 [2022-03-01 16:50:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:24,619 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 5615 transitions. [2022-03-01 16:50:24,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5615 transitions. [2022-03-01 16:50:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:24,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:24,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:24,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 16:50:24,638 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 34158403, now seen corresponding path program 1 times [2022-03-01 16:50:24,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:24,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342525086] [2022-03-01 16:50:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:25,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:25,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342525086] [2022-03-01 16:50:25,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342525086] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:25,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:25,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-01 16:50:25,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144720723] [2022-03-01 16:50:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:25,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 16:50:25,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 16:50:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:25,064 INFO L87 Difference]: Start difference. First operand 2990 states and 5615 transitions. Second operand has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:25,878 INFO L93 Difference]: Finished difference Result 2998 states and 5627 transitions. [2022-03-01 16:50:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 16:50:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:25,883 INFO L225 Difference]: With dead ends: 2998 [2022-03-01 16:50:25,883 INFO L226 Difference]: Without dead ends: 2998 [2022-03-01 16:50:25,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:50:25,884 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1144 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:25,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2746 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:50:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-03-01 16:50:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2945. [2022-03-01 16:50:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2934 states have (on average 1.882072256305385) internal successors, (5522), 2944 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 5522 transitions. [2022-03-01 16:50:25,917 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 5522 transitions. Word has length 200 [2022-03-01 16:50:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:25,917 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 5522 transitions. [2022-03-01 16:50:25,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 5522 transitions. [2022-03-01 16:50:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-01 16:50:25,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:25,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:25,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-01 16:50:25,920 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1838917866, now seen corresponding path program 1 times [2022-03-01 16:50:25,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:25,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272240070] [2022-03-01 16:50:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:26,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:26,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272240070] [2022-03-01 16:50:26,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272240070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:26,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:26,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:26,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637585436] [2022-03-01 16:50:26,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:26,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:26,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:26,005 INFO L87 Difference]: Start difference. First operand 2945 states and 5522 transitions. Second operand has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:26,298 INFO L93 Difference]: Finished difference Result 3137 states and 5871 transitions. [2022-03-01 16:50:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-03-01 16:50:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:26,303 INFO L225 Difference]: With dead ends: 3137 [2022-03-01 16:50:26,303 INFO L226 Difference]: Without dead ends: 2651 [2022-03-01 16:50:26,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:26,303 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 153 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:26,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 846 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2022-03-01 16:50:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2635. [2022-03-01 16:50:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2624 states have (on average 1.8467987804878048) internal successors, (4846), 2634 states have internal predecessors, (4846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4846 transitions. [2022-03-01 16:50:26,325 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4846 transitions. Word has length 200 [2022-03-01 16:50:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:26,325 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 4846 transitions. [2022-03-01 16:50:26,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4846 transitions. [2022-03-01 16:50:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:26,327 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:26,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:26,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-01 16:50:26,328 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -979472995, now seen corresponding path program 1 times [2022-03-01 16:50:26,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:26,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237212526] [2022-03-01 16:50:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:26,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:26,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237212526] [2022-03-01 16:50:26,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237212526] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:26,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:26,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-01 16:50:26,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778969186] [2022-03-01 16:50:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:26,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 16:50:26,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 16:50:26,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:50:26,793 INFO L87 Difference]: Start difference. First operand 2635 states and 4846 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:28,118 INFO L93 Difference]: Finished difference Result 3393 states and 6256 transitions. [2022-03-01 16:50:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:50:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:28,136 INFO L225 Difference]: With dead ends: 3393 [2022-03-01 16:50:28,136 INFO L226 Difference]: Without dead ends: 3393 [2022-03-01 16:50:28,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1507, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:50:28,152 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1265 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:28,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 2411 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:50:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-03-01 16:50:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2653. [2022-03-01 16:50:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2642 states have (on average 1.8478425435276307) internal successors, (4882), 2652 states have internal predecessors, (4882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 4882 transitions. [2022-03-01 16:50:28,178 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 4882 transitions. Word has length 205 [2022-03-01 16:50:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:28,178 INFO L470 AbstractCegarLoop]: Abstraction has 2653 states and 4882 transitions. [2022-03-01 16:50:28,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 4882 transitions. [2022-03-01 16:50:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:28,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:28,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:28,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-01 16:50:28,181 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1289205875, now seen corresponding path program 2 times [2022-03-01 16:50:28,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:28,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632920516] [2022-03-01 16:50:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:29,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:29,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632920516] [2022-03-01 16:50:29,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632920516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:29,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:29,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-03-01 16:50:29,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423108179] [2022-03-01 16:50:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:29,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 16:50:29,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 16:50:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:50:29,262 INFO L87 Difference]: Start difference. First operand 2653 states and 4882 transitions. Second operand has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:31,286 INFO L93 Difference]: Finished difference Result 3424 states and 6339 transitions. [2022-03-01 16:50:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 16:50:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:31,290 INFO L225 Difference]: With dead ends: 3424 [2022-03-01 16:50:31,290 INFO L226 Difference]: Without dead ends: 3424 [2022-03-01 16:50:31,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2022-03-01 16:50:31,293 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 1165 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:31,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 3343 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:50:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2022-03-01 16:50:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 2673. [2022-03-01 16:50:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2662 states have (on average 1.8489857250187829) internal successors, (4922), 2672 states have internal predecessors, (4922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4922 transitions. [2022-03-01 16:50:31,327 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4922 transitions. Word has length 205 [2022-03-01 16:50:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:31,328 INFO L470 AbstractCegarLoop]: Abstraction has 2673 states and 4922 transitions. [2022-03-01 16:50:31,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4922 transitions. [2022-03-01 16:50:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:31,329 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:31,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:31,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-01 16:50:31,330 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1265094627, now seen corresponding path program 3 times [2022-03-01 16:50:31,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:31,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335013529] [2022-03-01 16:50:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:31,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:31,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335013529] [2022-03-01 16:50:31,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335013529] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:31,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:31,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-01 16:50:31,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717438279] [2022-03-01 16:50:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:31,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 16:50:31,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 16:50:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:50:31,835 INFO L87 Difference]: Start difference. First operand 2673 states and 4922 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:33,344 INFO L93 Difference]: Finished difference Result 3441 states and 6352 transitions. [2022-03-01 16:50:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-01 16:50:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:33,349 INFO L225 Difference]: With dead ends: 3441 [2022-03-01 16:50:33,349 INFO L226 Difference]: Without dead ends: 3441 [2022-03-01 16:50:33,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 16:50:33,352 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1138 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:33,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 3079 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:50:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2022-03-01 16:50:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 2671. [2022-03-01 16:50:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2660 states have (on average 1.848872180451128) internal successors, (4918), 2670 states have internal predecessors, (4918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 4918 transitions. [2022-03-01 16:50:33,400 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 4918 transitions. Word has length 205 [2022-03-01 16:50:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:33,401 INFO L470 AbstractCegarLoop]: Abstraction has 2671 states and 4918 transitions. [2022-03-01 16:50:33,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 4918 transitions. [2022-03-01 16:50:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:33,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:33,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:33,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-01 16:50:33,403 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183327, now seen corresponding path program 4 times [2022-03-01 16:50:33,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:33,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057659406] [2022-03-01 16:50:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:33,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:33,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057659406] [2022-03-01 16:50:33,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057659406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:33,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:33,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:33,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392009519] [2022-03-01 16:50:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:33,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:33,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:33,859 INFO L87 Difference]: Start difference. First operand 2671 states and 4918 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:35,483 INFO L93 Difference]: Finished difference Result 3854 states and 7151 transitions. [2022-03-01 16:50:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 16:50:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:35,488 INFO L225 Difference]: With dead ends: 3854 [2022-03-01 16:50:35,488 INFO L226 Difference]: Without dead ends: 3854 [2022-03-01 16:50:35,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=2172, Unknown=0, NotChecked=0, Total=2652 [2022-03-01 16:50:35,490 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1157 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:35,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 3015 Invalid, 3062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:50:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2022-03-01 16:50:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 2711. [2022-03-01 16:50:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2700 states have (on average 1.8511111111111112) internal successors, (4998), 2710 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4998 transitions. [2022-03-01 16:50:35,529 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4998 transitions. Word has length 205 [2022-03-01 16:50:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:35,529 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 4998 transitions. [2022-03-01 16:50:35,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4998 transitions. [2022-03-01 16:50:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:35,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:35,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:35,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-01 16:50:35,532 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash -106384083, now seen corresponding path program 5 times [2022-03-01 16:50:35,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:35,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479958218] [2022-03-01 16:50:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:36,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:36,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479958218] [2022-03-01 16:50:36,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479958218] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:36,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:36,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:36,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761751081] [2022-03-01 16:50:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:36,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:36,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:36,064 INFO L87 Difference]: Start difference. First operand 2711 states and 4998 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:37,806 INFO L93 Difference]: Finished difference Result 3857 states and 7157 transitions. [2022-03-01 16:50:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-01 16:50:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:37,811 INFO L225 Difference]: With dead ends: 3857 [2022-03-01 16:50:37,811 INFO L226 Difference]: Without dead ends: 3857 [2022-03-01 16:50:37,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2022-03-01 16:50:37,812 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1502 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:37,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 2802 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:50:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-03-01 16:50:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2691. [2022-03-01 16:50:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2680 states have (on average 1.85) internal successors, (4958), 2690 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 4958 transitions. [2022-03-01 16:50:37,848 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 4958 transitions. Word has length 205 [2022-03-01 16:50:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:37,849 INFO L470 AbstractCegarLoop]: Abstraction has 2691 states and 4958 transitions. [2022-03-01 16:50:37,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 4958 transitions. [2022-03-01 16:50:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:37,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:37,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:37,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-01 16:50:37,851 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 337813469, now seen corresponding path program 6 times [2022-03-01 16:50:37,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:37,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184924280] [2022-03-01 16:50:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:38,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:38,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184924280] [2022-03-01 16:50:38,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184924280] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:38,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:38,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-01 16:50:38,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599860935] [2022-03-01 16:50:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:38,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:50:38,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:50:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:38,684 INFO L87 Difference]: Start difference. First operand 2691 states and 4958 transitions. Second operand has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:41,068 INFO L93 Difference]: Finished difference Result 4732 states and 8813 transitions. [2022-03-01 16:50:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 16:50:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:41,075 INFO L225 Difference]: With dead ends: 4732 [2022-03-01 16:50:41,075 INFO L226 Difference]: Without dead ends: 4732 [2022-03-01 16:50:41,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2022-03-01 16:50:41,077 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1211 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:41,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1211 Valid, 3426 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:50:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2022-03-01 16:50:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 2689. [2022-03-01 16:50:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2678 states have (on average 1.8498879761015683) internal successors, (4954), 2688 states have internal predecessors, (4954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4954 transitions. [2022-03-01 16:50:41,143 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4954 transitions. Word has length 205 [2022-03-01 16:50:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:41,143 INFO L470 AbstractCegarLoop]: Abstraction has 2689 states and 4954 transitions. [2022-03-01 16:50:41,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4954 transitions. [2022-03-01 16:50:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:41,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:41,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:41,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-01 16:50:41,147 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2143987693, now seen corresponding path program 7 times [2022-03-01 16:50:41,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:41,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371932946] [2022-03-01 16:50:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:41,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:41,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371932946] [2022-03-01 16:50:41,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371932946] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:41,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:41,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 16:50:41,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378447006] [2022-03-01 16:50:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:41,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-01 16:50:41,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:41,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-01 16:50:41,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:50:41,646 INFO L87 Difference]: Start difference. First operand 2689 states and 4954 transitions. Second operand has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:42,974 INFO L93 Difference]: Finished difference Result 3238 states and 5997 transitions. [2022-03-01 16:50:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-01 16:50:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:42,979 INFO L225 Difference]: With dead ends: 3238 [2022-03-01 16:50:42,979 INFO L226 Difference]: Without dead ends: 3238 [2022-03-01 16:50:42,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2022-03-01 16:50:42,981 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 1341 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:42,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 2795 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:50:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2022-03-01 16:50:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2669. [2022-03-01 16:50:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2658 states have (on average 1.8487584650112867) internal successors, (4914), 2668 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4914 transitions. [2022-03-01 16:50:43,017 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4914 transitions. Word has length 205 [2022-03-01 16:50:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:43,018 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 4914 transitions. [2022-03-01 16:50:43,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4914 transitions. [2022-03-01 16:50:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:43,023 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:43,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:43,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-01 16:50:43,024 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 266578173, now seen corresponding path program 8 times [2022-03-01 16:50:43,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:43,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764345060] [2022-03-01 16:50:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:43,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:43,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764345060] [2022-03-01 16:50:43,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764345060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:43,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:43,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:43,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930732850] [2022-03-01 16:50:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:43,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:43,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:43,469 INFO L87 Difference]: Start difference. First operand 2669 states and 4914 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:45,260 INFO L93 Difference]: Finished difference Result 3261 states and 6043 transitions. [2022-03-01 16:50:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 16:50:45,260 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:45,265 INFO L225 Difference]: With dead ends: 3261 [2022-03-01 16:50:45,265 INFO L226 Difference]: Without dead ends: 3261 [2022-03-01 16:50:45,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=500, Invalid=2152, Unknown=0, NotChecked=0, Total=2652 [2022-03-01 16:50:45,266 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 1287 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:45,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1287 Valid, 2771 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:50:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-03-01 16:50:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2649. [2022-03-01 16:50:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2638 states have (on average 1.847611827141774) internal successors, (4874), 2648 states have internal predecessors, (4874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4874 transitions. [2022-03-01 16:50:45,301 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4874 transitions. Word has length 205 [2022-03-01 16:50:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:45,301 INFO L470 AbstractCegarLoop]: Abstraction has 2649 states and 4874 transitions. [2022-03-01 16:50:45,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4874 transitions. [2022-03-01 16:50:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-01 16:50:45,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:45,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:45,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-01 16:50:45,304 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1760104399, now seen corresponding path program 9 times [2022-03-01 16:50:45,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:45,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266829415] [2022-03-01 16:50:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:45,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:45,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266829415] [2022-03-01 16:50:45,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266829415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:45,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:45,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 16:50:45,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240506990] [2022-03-01 16:50:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:45,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-01 16:50:45,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:45,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-01 16:50:45,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:50:45,718 INFO L87 Difference]: Start difference. First operand 2649 states and 4874 transitions. Second operand has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:47,711 INFO L93 Difference]: Finished difference Result 3095 states and 5722 transitions. [2022-03-01 16:50:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-01 16:50:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-03-01 16:50:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:47,716 INFO L225 Difference]: With dead ends: 3095 [2022-03-01 16:50:47,716 INFO L226 Difference]: Without dead ends: 3095 [2022-03-01 16:50:47,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2658, Unknown=0, NotChecked=0, Total=3306 [2022-03-01 16:50:47,718 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1210 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:47,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 3698 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 3148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:50:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-03-01 16:50:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2559. [2022-03-01 16:50:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2548 states have (on average 1.846546310832025) internal successors, (4705), 2558 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4705 transitions. [2022-03-01 16:50:47,746 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4705 transitions. Word has length 205 [2022-03-01 16:50:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:47,746 INFO L470 AbstractCegarLoop]: Abstraction has 2559 states and 4705 transitions. [2022-03-01 16:50:47,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4705 transitions. [2022-03-01 16:50:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-01 16:50:47,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:47,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:47,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-01 16:50:47,749 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 624290165, now seen corresponding path program 1 times [2022-03-01 16:50:47,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:47,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449909577] [2022-03-01 16:50:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:48,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:48,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449909577] [2022-03-01 16:50:48,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449909577] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:48,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:48,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-01 16:50:48,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556816353] [2022-03-01 16:50:48,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:48,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-01 16:50:48,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-01 16:50:48,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:50:48,193 INFO L87 Difference]: Start difference. First operand 2559 states and 4705 transitions. Second operand has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:49,774 INFO L93 Difference]: Finished difference Result 3363 states and 6216 transitions. [2022-03-01 16:50:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 16:50:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-03-01 16:50:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:49,786 INFO L225 Difference]: With dead ends: 3363 [2022-03-01 16:50:49,786 INFO L226 Difference]: Without dead ends: 3355 [2022-03-01 16:50:49,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=531, Invalid=3009, Unknown=0, NotChecked=0, Total=3540 [2022-03-01 16:50:49,788 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1358 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:49,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1358 Valid, 2647 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:50:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-03-01 16:50:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2637. [2022-03-01 16:50:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2626 states have (on average 1.8514851485148516) internal successors, (4862), 2636 states have internal predecessors, (4862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 4862 transitions. [2022-03-01 16:50:49,819 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 4862 transitions. Word has length 208 [2022-03-01 16:50:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:49,819 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 4862 transitions. [2022-03-01 16:50:49,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 4862 transitions. [2022-03-01 16:50:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-01 16:50:49,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:49,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:49,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-01 16:50:49,823 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1788617955, now seen corresponding path program 1 times [2022-03-01 16:50:49,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:49,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19606686] [2022-03-01 16:50:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:50,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:50,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19606686] [2022-03-01 16:50:50,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19606686] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:50,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:50,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-01 16:50:50,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076020309] [2022-03-01 16:50:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:50,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-01 16:50:50,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-01 16:50:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:50:50,365 INFO L87 Difference]: Start difference. First operand 2637 states and 4862 transitions. Second operand has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:52,674 INFO L93 Difference]: Finished difference Result 2636 states and 4854 transitions. [2022-03-01 16:50:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 16:50:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-03-01 16:50:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:52,678 INFO L225 Difference]: With dead ends: 2636 [2022-03-01 16:50:52,678 INFO L226 Difference]: Without dead ends: 2636 [2022-03-01 16:50:52,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=2356, Unknown=0, NotChecked=0, Total=2756 [2022-03-01 16:50:52,679 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 1181 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 4130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:52,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 3801 Invalid, 4130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-01 16:50:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-03-01 16:50:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2572. [2022-03-01 16:50:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-01 16:50:52,709 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-01 16:50:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:52,709 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-01 16:50:52,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-01 16:50:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-01 16:50:52,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:52,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:52,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-01 16:50:52,712 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1291090445, now seen corresponding path program 2 times [2022-03-01 16:50:52,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:52,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054723454] [2022-03-01 16:50:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:53,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:53,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054723454] [2022-03-01 16:50:53,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054723454] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:53,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:53,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-01 16:50:53,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672623788] [2022-03-01 16:50:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:53,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:50:53,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:53,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:50:53,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:53,148 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:54,883 INFO L93 Difference]: Finished difference Result 4198 states and 7798 transitions. [2022-03-01 16:50:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 16:50:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-03-01 16:50:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:54,889 INFO L225 Difference]: With dead ends: 4198 [2022-03-01 16:50:54,889 INFO L226 Difference]: Without dead ends: 4190 [2022-03-01 16:50:54,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=600, Invalid=3060, Unknown=0, NotChecked=0, Total=3660 [2022-03-01 16:50:54,890 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1171 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:54,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 3232 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:50:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2022-03-01 16:50:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2572. [2022-03-01 16:50:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-01 16:50:54,983 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-01 16:50:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:54,983 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-01 16:50:54,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-01 16:50:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-01 16:50:54,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:54,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:54,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-01 16:50:54,986 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:54,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1250377297, now seen corresponding path program 3 times [2022-03-01 16:50:54,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:54,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856503544] [2022-03-01 16:50:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:55,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:55,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856503544] [2022-03-01 16:50:55,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856503544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:55,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:55,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-01 16:50:55,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690657599] [2022-03-01 16:50:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:55,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-01 16:50:55,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-01 16:50:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:50:55,724 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:58,136 INFO L93 Difference]: Finished difference Result 4137 states and 7677 transitions. [2022-03-01 16:50:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-01 16:50:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-03-01 16:50:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:58,141 INFO L225 Difference]: With dead ends: 4137 [2022-03-01 16:50:58,141 INFO L226 Difference]: Without dead ends: 4129 [2022-03-01 16:50:58,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=740, Invalid=3952, Unknown=0, NotChecked=0, Total=4692 [2022-03-01 16:50:58,150 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1300 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 4479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 3978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:58,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 3839 Invalid, 4479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 3978 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 16:50:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-03-01 16:50:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 2572. [2022-03-01 16:50:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-01 16:50:58,213 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-01 16:50:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:58,213 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-01 16:50:58,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-01 16:50:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-01 16:50:58,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:58,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:50:58,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-01 16:50:58,225 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:50:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 271359335, now seen corresponding path program 4 times [2022-03-01 16:50:58,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:58,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279921313] [2022-03-01 16:50:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:50:58,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:58,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279921313] [2022-03-01 16:50:58,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279921313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:58,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:58,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-01 16:50:58,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619814103] [2022-03-01 16:50:58,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:58,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:50:58,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:58,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:50:58,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:58,916 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:00,553 INFO L93 Difference]: Finished difference Result 4147 states and 7696 transitions. [2022-03-01 16:51:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 16:51:00,553 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-03-01 16:51:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:00,559 INFO L225 Difference]: With dead ends: 4147 [2022-03-01 16:51:00,559 INFO L226 Difference]: Without dead ends: 4139 [2022-03-01 16:51:00,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=549, Invalid=2991, Unknown=0, NotChecked=0, Total=3540 [2022-03-01 16:51:00,560 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1235 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:00,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 2896 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:51:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2022-03-01 16:51:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 2487. [2022-03-01 16:51:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2477 states have (on average 1.8433589018974565) internal successors, (4566), 2486 states have internal predecessors, (4566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4566 transitions. [2022-03-01 16:51:00,593 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4566 transitions. Word has length 208 [2022-03-01 16:51:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:00,593 INFO L470 AbstractCegarLoop]: Abstraction has 2487 states and 4566 transitions. [2022-03-01 16:51:00,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4566 transitions. [2022-03-01 16:51:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-03-01 16:51:00,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:00,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:51:00,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-01 16:51:00,596 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-01 16:51:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1531443157, now seen corresponding path program 1 times [2022-03-01 16:51:00,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:00,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475257124] [2022-03-01 16:51:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 16:51:00,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 16:51:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 16:51:00,787 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 16:51:00,787 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 16:51:00,788 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-03-01 16:51:00,790 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-03-01 16:51:00,790 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-03-01 16:51:00,790 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-03-01 16:51:00,790 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-03-01 16:51:00,790 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-03-01 16:51:00,791 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-03-01 16:51:00,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-03-01 16:51:00,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-03-01 16:51:00,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-01 16:51:00,796 INFO L732 BasicCegarLoop]: Path program histogram: [9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:51:00,801 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 16:51:00,802 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 16:51:00,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 04:51:00 BasicIcfg [2022-03-01 16:51:00,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 16:51:00,885 INFO L158 Benchmark]: Toolchain (without parser) took 56503.26ms. Allocated memory was 166.7MB in the beginning and 708.8MB in the end (delta: 542.1MB). Free memory was 114.2MB in the beginning and 329.5MB in the end (delta: -215.3MB). Peak memory consumption was 327.3MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,885 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 166.7MB. Free memory was 133.1MB in the beginning and 132.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 16:51:00,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.65ms. Allocated memory was 166.7MB in the beginning and 246.4MB in the end (delta: 79.7MB). Free memory was 114.0MB in the beginning and 196.0MB in the end (delta: -82.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 246.4MB. Free memory was 196.0MB in the beginning and 192.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,885 INFO L158 Benchmark]: Boogie Preprocessor took 54.00ms. Allocated memory is still 246.4MB. Free memory was 192.4MB in the beginning and 189.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,885 INFO L158 Benchmark]: RCFGBuilder took 695.65ms. Allocated memory is still 246.4MB. Free memory was 188.7MB in the beginning and 162.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,886 INFO L158 Benchmark]: TraceAbstraction took 55120.86ms. Allocated memory was 246.4MB in the beginning and 708.8MB in the end (delta: 462.4MB). Free memory was 161.4MB in the beginning and 329.5MB in the end (delta: -168.0MB). Peak memory consumption was 294.9MB. Max. memory is 8.0GB. [2022-03-01 16:51:00,886 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.34ms. Allocated memory is still 166.7MB. Free memory was 133.1MB in the beginning and 132.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.65ms. Allocated memory was 166.7MB in the beginning and 246.4MB in the end (delta: 79.7MB). Free memory was 114.0MB in the beginning and 196.0MB in the end (delta: -82.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 246.4MB. Free memory was 196.0MB in the beginning and 192.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.00ms. Allocated memory is still 246.4MB. Free memory was 192.4MB in the beginning and 189.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 695.65ms. Allocated memory is still 246.4MB. Free memory was 188.7MB in the beginning and 162.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 55120.86ms. Allocated memory was 246.4MB in the beginning and 708.8MB in the end (delta: 462.4MB). Free memory was 161.4MB in the beginning and 329.5MB in the end (delta: -168.0MB). Peak memory consumption was 294.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, t1={13:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={13:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A = malloc(sizeof(struct s))=108, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={13:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B = malloc(sizeof(struct s))=121, B_mutex={4:0}, malloc(sizeof(struct s))={11:0}, p={-2:0}, t1={13:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1258] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] EXPR 0 p->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=107, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=107, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: B = malloc(sizeof(struct s)) [1249] * C: A = malloc(sizeof(struct s)) [1246] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: A->next->datum++ [1235] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: B->next = p [1251] * C: B->next = p [1251] * C: B->next = p [1251] * C: p -> datum = x [1228] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 358 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 54.9s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27789 SdHoareTripleChecker+Valid, 25.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27789 mSDsluCounter, 70423 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60220 mSDsCounter, 8881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55904 IncrementalHoareTripleChecker+Invalid, 64785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8881 mSolverCounterUnsat, 10341 mSDtfsCounter, 55904 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1349 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 1077 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13496 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4286occurred in iteration=12, InterpolantAutomatonStates: 857, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 23070 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 6401 NumberOfCodeBlocks, 6401 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6156 ConstructedInterpolants, 0 QuantifiedInterpolants, 73650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-01 16:51:00,982 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...