/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_12-arraycollapse_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:10:17,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:10:17,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:10:17,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:10:17,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:10:17,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:10:17,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:10:17,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:10:17,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:10:17,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:10:17,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:10:17,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:10:17,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:10:17,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:10:17,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:10:17,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:10:17,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:10:17,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:10:17,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:10:17,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:10:17,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:10:17,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:10:17,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:10:17,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:10:17,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:10:17,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:10:17,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:10:17,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:10:17,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:10:17,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:10:17,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:10:17,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:10:17,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:10:17,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:10:17,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:10:17,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:10:17,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:10:17,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:10:17,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:10:17,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:10:17,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:10:17,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 15:10:17,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:10:17,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:10:17,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:10:17,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:10:17,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:10:17,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:10:17,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:10:17,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:10:17,370 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:10:17,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:10:17,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:10:17,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:10:17,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:10:17,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:10:17,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:10:17,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 15:10:17,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:10:17,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:10:17,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:10:17,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:10:17,545 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:10:17,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.i [2022-03-15 15:10:17,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f16bee8/7fe4e7af674346d7935e432a5dab4dd0/FLAG0c9187423 [2022-03-15 15:10:18,018 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:10:18,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.i [2022-03-15 15:10:18,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f16bee8/7fe4e7af674346d7935e432a5dab4dd0/FLAG0c9187423 [2022-03-15 15:10:18,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f16bee8/7fe4e7af674346d7935e432a5dab4dd0 [2022-03-15 15:10:18,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:10:18,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:10:18,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:10:18,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:10:18,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:10:18,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274c8f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18, skipping insertion in model container [2022-03-15 15:10:18,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:10:18,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:10:18,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:10:18,497 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:10:18,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:10:18,576 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:10:18,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18 WrapperNode [2022-03-15 15:10:18,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:10:18,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:10:18,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:10:18,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:10:18,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,659 INFO L137 Inliner]: procedures = 371, calls = 46, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 423 [2022-03-15 15:10:18,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:10:18,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:10:18,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:10:18,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:10:18,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:10:18,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:10:18,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:10:18,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:10:18,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (1/1) ... [2022-03-15 15:10:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:10:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:18,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 15:10:18,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 15:10:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:10:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 15:10:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:10:18,791 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:10:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 15:10:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:10:18,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:10:18,792 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:10:18,936 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:10:18,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:10:19,479 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:10:19,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:10:19,487 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 15:10:19,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:10:19 BoogieIcfgContainer [2022-03-15 15:10:19,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:10:19,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:10:19,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:10:19,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:10:19,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:10:18" (1/3) ... [2022-03-15 15:10:19,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f252778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:10:19, skipping insertion in model container [2022-03-15 15:10:19,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:18" (2/3) ... [2022-03-15 15:10:19,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f252778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:10:19, skipping insertion in model container [2022-03-15 15:10:19,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:10:19" (3/3) ... [2022-03-15 15:10:19,493 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2022-03-15 15:10:19,496 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:10:19,496 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:10:19,496 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-03-15 15:10:19,496 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,558 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,558 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,558 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,561 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,562 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,562 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,562 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,563 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,564 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,565 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,566 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,570 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,572 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,591 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,594 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,595 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,596 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,598 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,598 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,598 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,599 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,613 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:10:19,653 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:10:19,693 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:10:19,697 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 15:10:19,698 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-03-15 15:10:19,713 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 513 places, 514 transitions, 1033 flow [2022-03-15 15:10:19,827 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3656 states, 3601 states have (on average 1.9005831713412942) internal successors, (6844), 3655 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 3656 states, 3601 states have (on average 1.9005831713412942) internal successors, (6844), 3655 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 15:10:19,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:19,839 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] [2022-03-15 15:10:19,839 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1585008633, now seen corresponding path program 1 times [2022-03-15 15:10:19,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:19,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110611351] [2022-03-15 15:10:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:20,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:20,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110611351] [2022-03-15 15:10:20,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110611351] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:20,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:20,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:10:20,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698257254] [2022-03-15 15:10:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:20,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 15:10:20,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 15:10:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:10:20,055 INFO L87 Difference]: Start difference. First operand has 3656 states, 3601 states have (on average 1.9005831713412942) internal successors, (6844), 3655 states have internal predecessors, (6844), 0 states have call successors, (0), 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 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:20,119 INFO L93 Difference]: Finished difference Result 3656 states and 6803 transitions. [2022-03-15 15:10:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 15:10:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-03-15 15:10:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:20,148 INFO L225 Difference]: With dead ends: 3656 [2022-03-15 15:10:20,149 INFO L226 Difference]: Without dead ends: 3645 [2022-03-15 15:10:20,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:10:20,153 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:20,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:10:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-03-15 15:10:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3645. [2022-03-15 15:10:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3587 states have (on average 1.8909952606635072) internal successors, (6783), 3644 states have internal predecessors, (6783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 6783 transitions. [2022-03-15 15:10:20,279 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 6783 transitions. Word has length 56 [2022-03-15 15:10:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:20,280 INFO L470 AbstractCegarLoop]: Abstraction has 3645 states and 6783 transitions. [2022-03-15 15:10:20,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 6783 transitions. [2022-03-15 15:10:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 15:10:20,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:20,281 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] [2022-03-15 15:10:20,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:10:20,281 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -759658408, now seen corresponding path program 1 times [2022-03-15 15:10:20,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:20,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592723597] [2022-03-15 15:10:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:20,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:20,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592723597] [2022-03-15 15:10:20,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592723597] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:20,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:20,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:10:20,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053957348] [2022-03-15 15:10:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:20,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:10:20,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:10:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:10:20,360 INFO L87 Difference]: Start difference. First operand 3645 states and 6783 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:20,401 INFO L93 Difference]: Finished difference Result 3649 states and 6787 transitions. [2022-03-15 15:10:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:10:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-03-15 15:10:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:20,412 INFO L225 Difference]: With dead ends: 3649 [2022-03-15 15:10:20,412 INFO L226 Difference]: Without dead ends: 3649 [2022-03-15 15:10:20,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:10:20,414 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 3 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:20,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1002 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:10:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-03-15 15:10:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3646. [2022-03-15 15:10:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3646 states, 3588 states have (on average 1.890746934225195) internal successors, (6784), 3645 states have internal predecessors, (6784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 6784 transitions. [2022-03-15 15:10:20,473 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 6784 transitions. Word has length 56 [2022-03-15 15:10:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:20,474 INFO L470 AbstractCegarLoop]: Abstraction has 3646 states and 6784 transitions. [2022-03-15 15:10:20,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 6784 transitions. [2022-03-15 15:10:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 15:10:20,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:20,476 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] [2022-03-15 15:10:20,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:10:20,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash 470193548, now seen corresponding path program 1 times [2022-03-15 15:10:20,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:20,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082351474] [2022-03-15 15:10:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:20,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:20,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082351474] [2022-03-15 15:10:20,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082351474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:20,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056303268] [2022-03-15 15:10:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:20,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:20,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:20,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 15:10:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:20,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:10:20,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:20,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:21,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056303268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:21,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:21,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:10:21,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552840783] [2022-03-15 15:10:21,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:21,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:10:21,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:21,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:10:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:10:21,094 INFO L87 Difference]: Start difference. First operand 3646 states and 6784 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:21,187 INFO L93 Difference]: Finished difference Result 3656 states and 6794 transitions. [2022-03-15 15:10:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:10:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-03-15 15:10:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:21,201 INFO L225 Difference]: With dead ends: 3656 [2022-03-15 15:10:21,201 INFO L226 Difference]: Without dead ends: 3656 [2022-03-15 15:10:21,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:10:21,205 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 11 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:21,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 3500 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:10:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-03-15 15:10:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3656. [2022-03-15 15:10:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3598 states have (on average 1.8882712618121178) internal successors, (6794), 3655 states have internal predecessors, (6794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 6794 transitions. [2022-03-15 15:10:21,275 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 6794 transitions. Word has length 61 [2022-03-15 15:10:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:21,276 INFO L470 AbstractCegarLoop]: Abstraction has 3656 states and 6794 transitions. [2022-03-15 15:10:21,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 6794 transitions. [2022-03-15 15:10:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-15 15:10:21,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:21,277 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:21,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:21,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:21,487 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1451934988, now seen corresponding path program 2 times [2022-03-15 15:10:21,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:21,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819307001] [2022-03-15 15:10:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:21,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:21,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819307001] [2022-03-15 15:10:21,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819307001] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:21,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481113986] [2022-03-15 15:10:21,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:10:21,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:21,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:21,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 15:10:21,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:10:21,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:10:21,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 15:10:21,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:21,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:10:21,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:10:21,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,804 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:10:21,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:10:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:21,838 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:10:21,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:10:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 15:10:21,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:10:21,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481113986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:21,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:10:21,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-15 15:10:21,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309253449] [2022-03-15 15:10:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:21,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 15:10:21,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 15:10:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:10:21,864 INFO L87 Difference]: Start difference. First operand 3656 states and 6794 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:22,179 INFO L93 Difference]: Finished difference Result 3651 states and 6789 transitions. [2022-03-15 15:10:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:10:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-03-15 15:10:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:22,191 INFO L225 Difference]: With dead ends: 3651 [2022-03-15 15:10:22,191 INFO L226 Difference]: Without dead ends: 3651 [2022-03-15 15:10:22,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:10:22,193 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 430 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:22,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1086 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:10:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-03-15 15:10:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3651. [2022-03-15 15:10:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3598 states have (on average 1.886881600889383) internal successors, (6789), 3650 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 6789 transitions. [2022-03-15 15:10:22,298 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 6789 transitions. Word has length 71 [2022-03-15 15:10:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:22,300 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 6789 transitions. [2022-03-15 15:10:22,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 6789 transitions. [2022-03-15 15:10:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-15 15:10:22,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:22,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:22,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:22,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 15:10:22,515 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 785550879, now seen corresponding path program 1 times [2022-03-15 15:10:22,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:22,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859932295] [2022-03-15 15:10:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:22,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:22,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859932295] [2022-03-15 15:10:22,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859932295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:22,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470283827] [2022-03-15 15:10:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:22,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:22,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:22,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 15:10:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:22,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 15:10:22,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:22,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:22,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470283827] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:22,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:22,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 15:10:22,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493540908] [2022-03-15 15:10:22,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:22,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:10:22,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:10:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:10:22,986 INFO L87 Difference]: Start difference. First operand 3651 states and 6789 transitions. Second operand has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:23,131 INFO L93 Difference]: Finished difference Result 3671 states and 6809 transitions. [2022-03-15 15:10:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:10:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-03-15 15:10:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:23,142 INFO L225 Difference]: With dead ends: 3671 [2022-03-15 15:10:23,142 INFO L226 Difference]: Without dead ends: 3671 [2022-03-15 15:10:23,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:10:23,143 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 29 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:23,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 2975 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:10:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2022-03-15 15:10:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2022-03-15 15:10:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3618 states have (on average 1.8819789939192924) internal successors, (6809), 3670 states have internal predecessors, (6809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 6809 transitions. [2022-03-15 15:10:23,198 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 6809 transitions. Word has length 79 [2022-03-15 15:10:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:23,198 INFO L470 AbstractCegarLoop]: Abstraction has 3671 states and 6809 transitions. [2022-03-15 15:10:23,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 6809 transitions. [2022-03-15 15:10:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-15 15:10:23,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:23,202 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:23,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:23,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:23,416 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash -857486049, now seen corresponding path program 2 times [2022-03-15 15:10:23,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:23,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631703108] [2022-03-15 15:10:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:23,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:23,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631703108] [2022-03-15 15:10:23,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631703108] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:23,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069929373] [2022-03-15 15:10:23,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:10:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:23,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 15:10:23,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:10:23,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:10:23,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 15:10:23,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:23,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:10:23,819 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-15 15:10:23,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-15 15:10:23,849 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-15 15:10:23,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-15 15:10:23,885 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-15 15:10:23,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-15 15:10:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-15 15:10:23,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:10:23,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069929373] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:23,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:10:23,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-15 15:10:23,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047046506] [2022-03-15 15:10:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:23,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:23,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:10:23,903 INFO L87 Difference]: Start difference. First operand 3671 states and 6809 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 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-15 15:10:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:24,213 INFO L93 Difference]: Finished difference Result 3666 states and 6804 transitions. [2022-03-15 15:10:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 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 99 [2022-03-15 15:10:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:24,223 INFO L225 Difference]: With dead ends: 3666 [2022-03-15 15:10:24,223 INFO L226 Difference]: Without dead ends: 3666 [2022-03-15 15:10:24,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:10:24,224 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 10 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:24,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 974 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:10:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2022-03-15 15:10:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3666. [2022-03-15 15:10:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3618 states have (on average 1.8805970149253732) internal successors, (6804), 3665 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6804 transitions. [2022-03-15 15:10:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6804 transitions. Word has length 99 [2022-03-15 15:10:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:24,272 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 6804 transitions. [2022-03-15 15:10:24,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 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-15 15:10:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6804 transitions. [2022-03-15 15:10:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 15:10:24,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:24,273 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:24,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:24,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:24,487 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash 263191692, now seen corresponding path program 1 times [2022-03-15 15:10:24,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:24,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507064632] [2022-03-15 15:10:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:24,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:24,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507064632] [2022-03-15 15:10:24,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507064632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:24,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032423938] [2022-03-15 15:10:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:24,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:24,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:24,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:24,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 15:10:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:24,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 15:10:24,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:24,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:25,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032423938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:25,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:25,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-15 15:10:25,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485371732] [2022-03-15 15:10:25,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:25,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:10:25,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:25,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:10:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:10:25,058 INFO L87 Difference]: Start difference. First operand 3666 states and 6804 transitions. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:25,269 INFO L93 Difference]: Finished difference Result 3681 states and 6819 transitions. [2022-03-15 15:10:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:10:25,269 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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-15 15:10:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:25,275 INFO L225 Difference]: With dead ends: 3681 [2022-03-15 15:10:25,275 INFO L226 Difference]: Without dead ends: 3681 [2022-03-15 15:10:25,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:10:25,277 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 45 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:25,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 2458 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:10:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2022-03-15 15:10:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3681. [2022-03-15 15:10:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3633 states have (on average 1.8769611890999174) internal successors, (6819), 3680 states have internal predecessors, (6819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6819 transitions. [2022-03-15 15:10:25,345 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6819 transitions. Word has length 110 [2022-03-15 15:10:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:25,345 INFO L470 AbstractCegarLoop]: Abstraction has 3681 states and 6819 transitions. [2022-03-15 15:10:25,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6819 transitions. [2022-03-15 15:10:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-03-15 15:10:25,346 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:25,346 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:25,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:25,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:25,556 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash 357116480, now seen corresponding path program 2 times [2022-03-15 15:10:25,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:25,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644231114] [2022-03-15 15:10:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:25,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:25,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644231114] [2022-03-15 15:10:25,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644231114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:25,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:25,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:25,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259145750] [2022-03-15 15:10:25,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:25,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:25,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:25,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:25,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:25,641 INFO L87 Difference]: Start difference. First operand 3681 states and 6819 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:26,121 INFO L93 Difference]: Finished difference Result 3680 states and 6818 transitions. [2022-03-15 15:10:26,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:26,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-03-15 15:10:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:26,142 INFO L225 Difference]: With dead ends: 3680 [2022-03-15 15:10:26,142 INFO L226 Difference]: Without dead ends: 3680 [2022-03-15 15:10:26,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:26,143 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 2 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:26,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1555 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:10:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2022-03-15 15:10:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2022-03-15 15:10:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3633 states have (on average 1.8766859344894027) internal successors, (6818), 3679 states have internal predecessors, (6818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 6818 transitions. [2022-03-15 15:10:26,196 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 6818 transitions. Word has length 125 [2022-03-15 15:10:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:26,196 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 6818 transitions. [2022-03-15 15:10:26,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 6818 transitions. [2022-03-15 15:10:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-15 15:10:26,199 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:26,199 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:26,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 15:10:26,199 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -688081602, now seen corresponding path program 1 times [2022-03-15 15:10:26,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:26,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412972556] [2022-03-15 15:10:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:26,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:26,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412972556] [2022-03-15 15:10:26,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412972556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:26,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:26,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:26,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179092190] [2022-03-15 15:10:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:26,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:26,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:26,305 INFO L87 Difference]: Start difference. First operand 3680 states and 6818 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:27,090 INFO L93 Difference]: Finished difference Result 5566 states and 10497 transitions. [2022-03-15 15:10:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-03-15 15:10:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:27,101 INFO L225 Difference]: With dead ends: 5566 [2022-03-15 15:10:27,101 INFO L226 Difference]: Without dead ends: 5566 [2022-03-15 15:10:27,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:27,102 INFO L933 BasicCegarLoop]: 654 mSDtfsCounter, 297 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:27,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1950 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:10:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2022-03-15 15:10:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 3910. [2022-03-15 15:10:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3910 states, 3866 states have (on average 1.8820486290739782) internal successors, (7276), 3909 states have internal predecessors, (7276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 7276 transitions. [2022-03-15 15:10:27,177 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 7276 transitions. Word has length 160 [2022-03-15 15:10:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:27,178 INFO L470 AbstractCegarLoop]: Abstraction has 3910 states and 7276 transitions. [2022-03-15 15:10:27,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 7276 transitions. [2022-03-15 15:10:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-03-15 15:10:27,178 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:27,179 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:27,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:10:27,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1256124734, now seen corresponding path program 1 times [2022-03-15 15:10:27,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:27,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003202225] [2022-03-15 15:10:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:27,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:27,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003202225] [2022-03-15 15:10:27,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003202225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:27,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:27,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:27,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580846203] [2022-03-15 15:10:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:27,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:27,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:27,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:27,293 INFO L87 Difference]: Start difference. First operand 3910 states and 7276 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:27,559 INFO L93 Difference]: Finished difference Result 3906 states and 7272 transitions. [2022-03-15 15:10:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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-15 15:10:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:27,566 INFO L225 Difference]: With dead ends: 3906 [2022-03-15 15:10:27,566 INFO L226 Difference]: Without dead ends: 3906 [2022-03-15 15:10:27,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:27,567 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 40 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:27,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 977 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2022-03-15 15:10:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3906. [2022-03-15 15:10:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 3866 states have (on average 1.8810139679255045) internal successors, (7272), 3905 states have internal predecessors, (7272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 7272 transitions. [2022-03-15 15:10:27,616 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 7272 transitions. Word has length 171 [2022-03-15 15:10:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:27,616 INFO L470 AbstractCegarLoop]: Abstraction has 3906 states and 7272 transitions. [2022-03-15 15:10:27,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 7272 transitions. [2022-03-15 15:10:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-15 15:10:27,618 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:27,618 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:27,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:10:27,618 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -104921240, now seen corresponding path program 1 times [2022-03-15 15:10:27,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:27,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549513151] [2022-03-15 15:10:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:27,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:27,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549513151] [2022-03-15 15:10:27,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549513151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:27,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:27,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:27,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707817265] [2022-03-15 15:10:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:27,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:27,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:27,722 INFO L87 Difference]: Start difference. First operand 3906 states and 7272 transitions. Second operand has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:27,985 INFO L93 Difference]: Finished difference Result 3902 states and 7268 transitions. [2022-03-15 15:10:27,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:27,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2022-03-15 15:10:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:27,993 INFO L225 Difference]: With dead ends: 3902 [2022-03-15 15:10:27,994 INFO L226 Difference]: Without dead ends: 3902 [2022-03-15 15:10:27,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:27,994 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 12 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:27,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 989 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2022-03-15 15:10:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3902. [2022-03-15 15:10:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3902 states, 3866 states have (on average 1.8799793067770305) internal successors, (7268), 3901 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 7268 transitions. [2022-03-15 15:10:28,046 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 7268 transitions. Word has length 180 [2022-03-15 15:10:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:28,046 INFO L470 AbstractCegarLoop]: Abstraction has 3902 states and 7268 transitions. [2022-03-15 15:10:28,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.0) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 7268 transitions. [2022-03-15 15:10:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-03-15 15:10:28,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:28,048 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:28,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 15:10:28,048 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1452609513, now seen corresponding path program 1 times [2022-03-15 15:10:28,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:28,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819206268] [2022-03-15 15:10:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:28,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:28,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819206268] [2022-03-15 15:10:28,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819206268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:28,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:28,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:28,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068070835] [2022-03-15 15:10:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:28,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:28,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:28,159 INFO L87 Difference]: Start difference. First operand 3902 states and 7268 transitions. Second operand has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:28,349 INFO L93 Difference]: Finished difference Result 3898 states and 7264 transitions. [2022-03-15 15:10:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:28,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-03-15 15:10:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:28,356 INFO L225 Difference]: With dead ends: 3898 [2022-03-15 15:10:28,356 INFO L226 Difference]: Without dead ends: 3898 [2022-03-15 15:10:28,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:28,356 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:28,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 725 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2022-03-15 15:10:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3898. [2022-03-15 15:10:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3898 states, 3866 states have (on average 1.8789446456285566) internal successors, (7264), 3897 states have internal predecessors, (7264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 7264 transitions. [2022-03-15 15:10:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 7264 transitions. Word has length 188 [2022-03-15 15:10:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:28,410 INFO L470 AbstractCegarLoop]: Abstraction has 3898 states and 7264 transitions. [2022-03-15 15:10:28,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 7264 transitions. [2022-03-15 15:10:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-03-15 15:10:28,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:28,412 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:28,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 15:10:28,412 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1643369755, now seen corresponding path program 1 times [2022-03-15 15:10:28,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:28,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606196926] [2022-03-15 15:10:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:28,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:28,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606196926] [2022-03-15 15:10:28,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606196926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:28,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:28,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:28,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488656042] [2022-03-15 15:10:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:28,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:28,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:28,510 INFO L87 Difference]: Start difference. First operand 3898 states and 7264 transitions. Second operand has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:28,747 INFO L93 Difference]: Finished difference Result 3897 states and 7263 transitions. [2022-03-15 15:10:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2022-03-15 15:10:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:28,754 INFO L225 Difference]: With dead ends: 3897 [2022-03-15 15:10:28,754 INFO L226 Difference]: Without dead ends: 3897 [2022-03-15 15:10:28,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:28,754 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 6 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:28,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 1012 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2022-03-15 15:10:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2022-03-15 15:10:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3897 states, 3866 states have (on average 1.8786859803414382) internal successors, (7263), 3896 states have internal predecessors, (7263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 7263 transitions. [2022-03-15 15:10:28,796 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 7263 transitions. Word has length 226 [2022-03-15 15:10:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:28,796 INFO L470 AbstractCegarLoop]: Abstraction has 3897 states and 7263 transitions. [2022-03-15 15:10:28,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 7263 transitions. [2022-03-15 15:10:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-03-15 15:10:28,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:28,797 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:28,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 15:10:28,798 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1814305549, now seen corresponding path program 1 times [2022-03-15 15:10:28,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:28,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749386637] [2022-03-15 15:10:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:28,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:28,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749386637] [2022-03-15 15:10:28,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749386637] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:28,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:28,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:28,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304156129] [2022-03-15 15:10:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:28,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:28,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:28,907 INFO L87 Difference]: Start difference. First operand 3897 states and 7263 transitions. Second operand has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:29,179 INFO L93 Difference]: Finished difference Result 3895 states and 7261 transitions. [2022-03-15 15:10:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2022-03-15 15:10:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:29,187 INFO L225 Difference]: With dead ends: 3895 [2022-03-15 15:10:29,187 INFO L226 Difference]: Without dead ends: 3895 [2022-03-15 15:10:29,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:29,188 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 48 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:29,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 960 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:10:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2022-03-15 15:10:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2022-03-15 15:10:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 3866 states have (on average 1.8781686497672012) internal successors, (7261), 3894 states have internal predecessors, (7261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 7261 transitions. [2022-03-15 15:10:29,226 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 7261 transitions. Word has length 261 [2022-03-15 15:10:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:29,226 INFO L470 AbstractCegarLoop]: Abstraction has 3895 states and 7261 transitions. [2022-03-15 15:10:29,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.2) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 7261 transitions. [2022-03-15 15:10:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-03-15 15:10:29,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:29,230 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:29,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 15:10:29,230 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1208481269, now seen corresponding path program 1 times [2022-03-15 15:10:29,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:29,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976972745] [2022-03-15 15:10:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:29,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:29,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976972745] [2022-03-15 15:10:29,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976972745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:29,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:29,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:29,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199727972] [2022-03-15 15:10:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:29,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:29,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:29,448 INFO L87 Difference]: Start difference. First operand 3895 states and 7261 transitions. Second operand has 6 states, 5 states have (on average 74.2) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:29,898 INFO L93 Difference]: Finished difference Result 4255 states and 7975 transitions. [2022-03-15 15:10:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 74.2) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2022-03-15 15:10:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:29,905 INFO L225 Difference]: With dead ends: 4255 [2022-03-15 15:10:29,905 INFO L226 Difference]: Without dead ends: 4255 [2022-03-15 15:10:29,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:29,905 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 256 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:29,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 1442 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:10:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2022-03-15 15:10:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4127. [2022-03-15 15:10:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4099 states have (on average 1.8836301536960234) internal successors, (7721), 4126 states have internal predecessors, (7721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 7721 transitions. [2022-03-15 15:10:29,948 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 7721 transitions. Word has length 416 [2022-03-15 15:10:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:29,949 INFO L470 AbstractCegarLoop]: Abstraction has 4127 states and 7721 transitions. [2022-03-15 15:10:29,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 74.2) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 7721 transitions. [2022-03-15 15:10:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2022-03-15 15:10:29,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:29,953 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:29,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 15:10:29,953 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2093648283, now seen corresponding path program 1 times [2022-03-15 15:10:29,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:29,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582786027] [2022-03-15 15:10:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:30,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:30,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582786027] [2022-03-15 15:10:30,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582786027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:30,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:30,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:30,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576661957] [2022-03-15 15:10:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:30,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:30,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:30,115 INFO L87 Difference]: Start difference. First operand 4127 states and 7721 transitions. Second operand has 6 states, 5 states have (on average 76.2) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:30,440 INFO L93 Difference]: Finished difference Result 4863 states and 9116 transitions. [2022-03-15 15:10:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 76.2) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2022-03-15 15:10:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:30,447 INFO L225 Difference]: With dead ends: 4863 [2022-03-15 15:10:30,447 INFO L226 Difference]: Without dead ends: 4629 [2022-03-15 15:10:30,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:30,448 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 288 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:30,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 1108 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:10:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2022-03-15 15:10:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4125. [2022-03-15 15:10:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 4098 states have (on average 1.8784773060029283) internal successors, (7698), 4124 states have internal predecessors, (7698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 7698 transitions. [2022-03-15 15:10:30,526 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 7698 transitions. Word has length 426 [2022-03-15 15:10:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:30,526 INFO L470 AbstractCegarLoop]: Abstraction has 4125 states and 7698 transitions. [2022-03-15 15:10:30,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 76.2) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 7698 transitions. [2022-03-15 15:10:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-03-15 15:10:30,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:30,529 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:30,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 15:10:30,529 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:30,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash -562443915, now seen corresponding path program 1 times [2022-03-15 15:10:30,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:30,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337728536] [2022-03-15 15:10:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:30,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:30,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337728536] [2022-03-15 15:10:30,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337728536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:30,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:30,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:30,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851020330] [2022-03-15 15:10:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:30,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:30,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:30,705 INFO L87 Difference]: Start difference. First operand 4125 states and 7698 transitions. Second operand has 6 states, 5 states have (on average 76.4) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:30,940 INFO L93 Difference]: Finished difference Result 4285 states and 8013 transitions. [2022-03-15 15:10:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 76.4) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2022-03-15 15:10:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:30,951 INFO L225 Difference]: With dead ends: 4285 [2022-03-15 15:10:30,951 INFO L226 Difference]: Without dead ends: 4285 [2022-03-15 15:10:30,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:30,952 INFO L933 BasicCegarLoop]: 547 mSDtfsCounter, 102 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:30,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 918 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-03-15 15:10:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 4244. [2022-03-15 15:10:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 4217 states have (on average 1.880958027033436) internal successors, (7932), 4243 states have internal predecessors, (7932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 7932 transitions. [2022-03-15 15:10:31,001 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 7932 transitions. Word has length 427 [2022-03-15 15:10:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:31,001 INFO L470 AbstractCegarLoop]: Abstraction has 4244 states and 7932 transitions. [2022-03-15 15:10:31,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 76.4) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 7932 transitions. [2022-03-15 15:10:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:31,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:31,004 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:31,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 15:10:31,004 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash -831313253, now seen corresponding path program 1 times [2022-03-15 15:10:31,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:31,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536493695] [2022-03-15 15:10:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:31,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:31,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536493695] [2022-03-15 15:10:31,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536493695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:31,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:31,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 15:10:31,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456376776] [2022-03-15 15:10:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:31,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 15:10:31,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:31,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 15:10:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:10:31,719 INFO L87 Difference]: Start difference. First operand 4244 states and 7932 transitions. Second operand has 21 states, 20 states have (on average 19.4) internal successors, (388), 21 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:33,122 INFO L93 Difference]: Finished difference Result 4264 states and 7971 transitions. [2022-03-15 15:10:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 15:10:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 19.4) internal successors, (388), 21 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:33,130 INFO L225 Difference]: With dead ends: 4264 [2022-03-15 15:10:33,130 INFO L226 Difference]: Without dead ends: 4264 [2022-03-15 15:10:33,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 15:10:33,132 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 1613 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 3530 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:33,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 3530 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:10:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2022-03-15 15:10:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 4206. [2022-03-15 15:10:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 4180 states have (on average 1.879425837320574) internal successors, (7856), 4205 states have internal predecessors, (7856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 7856 transitions. [2022-03-15 15:10:33,180 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 7856 transitions. Word has length 433 [2022-03-15 15:10:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:33,181 INFO L470 AbstractCegarLoop]: Abstraction has 4206 states and 7856 transitions. [2022-03-15 15:10:33,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 19.4) internal successors, (388), 21 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 7856 transitions. [2022-03-15 15:10:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:33,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:33,184 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:33,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 15:10:33,184 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1823820156, now seen corresponding path program 1 times [2022-03-15 15:10:33,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:33,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541989819] [2022-03-15 15:10:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:33,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:33,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541989819] [2022-03-15 15:10:33,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541989819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:33,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:33,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-03-15 15:10:33,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128152484] [2022-03-15 15:10:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:33,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 15:10:33,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 15:10:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:10:33,959 INFO L87 Difference]: Start difference. First operand 4206 states and 7856 transitions. Second operand has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:35,548 INFO L93 Difference]: Finished difference Result 4736 states and 8877 transitions. [2022-03-15 15:10:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:10:35,548 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:35,556 INFO L225 Difference]: With dead ends: 4736 [2022-03-15 15:10:35,556 INFO L226 Difference]: Without dead ends: 4736 [2022-03-15 15:10:35,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1238, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:10:35,557 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 2193 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:35,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2193 Valid, 3170 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:10:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2022-03-15 15:10:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4222. [2022-03-15 15:10:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4222 states, 4196 states have (on average 1.8798856053384176) internal successors, (7888), 4221 states have internal predecessors, (7888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 4222 states and 7888 transitions. [2022-03-15 15:10:35,614 INFO L78 Accepts]: Start accepts. Automaton has 4222 states and 7888 transitions. Word has length 433 [2022-03-15 15:10:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:35,615 INFO L470 AbstractCegarLoop]: Abstraction has 4222 states and 7888 transitions. [2022-03-15 15:10:35,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4222 states and 7888 transitions. [2022-03-15 15:10:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:35,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:35,617 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:35,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 15:10:35,619 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -26089528, now seen corresponding path program 2 times [2022-03-15 15:10:35,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:35,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286617586] [2022-03-15 15:10:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:36,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:36,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286617586] [2022-03-15 15:10:36,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286617586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:36,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:36,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-03-15 15:10:36,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659125711] [2022-03-15 15:10:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:36,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 15:10:36,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 15:10:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:10:36,390 INFO L87 Difference]: Start difference. First operand 4222 states and 7888 transitions. Second operand has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:39,090 INFO L93 Difference]: Finished difference Result 7447 states and 14207 transitions. [2022-03-15 15:10:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 15:10:39,090 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:39,102 INFO L225 Difference]: With dead ends: 7447 [2022-03-15 15:10:39,103 INFO L226 Difference]: Without dead ends: 7447 [2022-03-15 15:10:39,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=771, Invalid=3389, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 15:10:39,104 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 2796 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 3500 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 3500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:39,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2796 Valid, 3941 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 3500 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 15:10:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2022-03-15 15:10:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 4226. [2022-03-15 15:10:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4200 states have (on average 1.88) internal successors, (7896), 4225 states have internal predecessors, (7896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 7896 transitions. [2022-03-15 15:10:39,197 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 7896 transitions. Word has length 433 [2022-03-15 15:10:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:39,198 INFO L470 AbstractCegarLoop]: Abstraction has 4226 states and 7896 transitions. [2022-03-15 15:10:39,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 16.869565217391305) internal successors, (388), 24 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 7896 transitions. [2022-03-15 15:10:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:39,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:39,202 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:39,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 15:10:39,202 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 806549704, now seen corresponding path program 3 times [2022-03-15 15:10:39,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:39,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186504281] [2022-03-15 15:10:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:40,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:40,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186504281] [2022-03-15 15:10:40,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186504281] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:40,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:40,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-15 15:10:40,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120871884] [2022-03-15 15:10:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:40,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:10:40,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:10:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:10:40,082 INFO L87 Difference]: Start difference. First operand 4226 states and 7896 transitions. Second operand has 18 states, 17 states have (on average 22.823529411764707) internal successors, (388), 18 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:42,202 INFO L93 Difference]: Finished difference Result 7614 states and 14541 transitions. [2022-03-15 15:10:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 15:10:42,203 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 22.823529411764707) internal successors, (388), 18 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:42,215 INFO L225 Difference]: With dead ends: 7614 [2022-03-15 15:10:42,215 INFO L226 Difference]: Without dead ends: 7614 [2022-03-15 15:10:42,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=457, Invalid=1265, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:10:42,217 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 2084 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:42,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2084 Valid, 3074 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:10:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7614 states. [2022-03-15 15:10:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7614 to 4226. [2022-03-15 15:10:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4200 states have (on average 1.88) internal successors, (7896), 4225 states have internal predecessors, (7896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 7896 transitions. [2022-03-15 15:10:42,286 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 7896 transitions. Word has length 433 [2022-03-15 15:10:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:42,287 INFO L470 AbstractCegarLoop]: Abstraction has 4226 states and 7896 transitions. [2022-03-15 15:10:42,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 22.823529411764707) internal successors, (388), 18 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 7896 transitions. [2022-03-15 15:10:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:42,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:42,290 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:42,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 15:10:42,290 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash 871057914, now seen corresponding path program 4 times [2022-03-15 15:10:42,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:42,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772182982] [2022-03-15 15:10:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:43,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:43,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772182982] [2022-03-15 15:10:43,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772182982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:43,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:43,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-15 15:10:43,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008089998] [2022-03-15 15:10:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:43,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 15:10:43,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 15:10:43,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-03-15 15:10:43,105 INFO L87 Difference]: Start difference. First operand 4226 states and 7896 transitions. Second operand has 16 states, 15 states have (on average 25.866666666666667) internal successors, (388), 16 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:44,982 INFO L93 Difference]: Finished difference Result 7639 states and 14589 transitions. [2022-03-15 15:10:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 15:10:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 25.866666666666667) internal successors, (388), 16 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:45,017 INFO L225 Difference]: With dead ends: 7639 [2022-03-15 15:10:45,017 INFO L226 Difference]: Without dead ends: 7639 [2022-03-15 15:10:45,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=793, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 15:10:45,018 INFO L933 BasicCegarLoop]: 628 mSDtfsCounter, 1327 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:45,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 2924 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:10:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2022-03-15 15:10:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 4223. [2022-03-15 15:10:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 4197 states have (on average 1.879914224446033) internal successors, (7890), 4222 states have internal predecessors, (7890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 7890 transitions. [2022-03-15 15:10:45,081 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 7890 transitions. Word has length 433 [2022-03-15 15:10:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:45,082 INFO L470 AbstractCegarLoop]: Abstraction has 4223 states and 7890 transitions. [2022-03-15 15:10:45,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 25.866666666666667) internal successors, (388), 16 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 7890 transitions. [2022-03-15 15:10:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-03-15 15:10:45,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:45,085 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:45,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 15:10:45,085 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1703697146, now seen corresponding path program 5 times [2022-03-15 15:10:45,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:45,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208749085] [2022-03-15 15:10:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:45,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:45,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208749085] [2022-03-15 15:10:45,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208749085] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:45,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:45,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-15 15:10:45,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026372214] [2022-03-15 15:10:45,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:45,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 15:10:45,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:45,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 15:10:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:10:45,783 INFO L87 Difference]: Start difference. First operand 4223 states and 7890 transitions. Second operand has 25 states, 24 states have (on average 16.166666666666668) internal successors, (388), 25 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:49,437 INFO L93 Difference]: Finished difference Result 7573 states and 14458 transitions. [2022-03-15 15:10:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 15:10:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 16.166666666666668) internal successors, (388), 25 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2022-03-15 15:10:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:49,450 INFO L225 Difference]: With dead ends: 7573 [2022-03-15 15:10:49,451 INFO L226 Difference]: Without dead ends: 7573 [2022-03-15 15:10:49,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=962, Invalid=4008, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 15:10:49,453 INFO L933 BasicCegarLoop]: 564 mSDtfsCounter, 2470 mSDsluCounter, 5107 mSDsCounter, 0 mSdLazyCounter, 5662 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 5663 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 5662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:49,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2470 Valid, 5663 Invalid, 6249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 5662 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 15:10:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2022-03-15 15:10:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 4001. [2022-03-15 15:10:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3978 states have (on average 1.8717948717948718) internal successors, (7446), 4000 states have internal predecessors, (7446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 7446 transitions. [2022-03-15 15:10:49,523 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 7446 transitions. Word has length 433 [2022-03-15 15:10:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:49,524 INFO L470 AbstractCegarLoop]: Abstraction has 4001 states and 7446 transitions. [2022-03-15 15:10:49,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 16.166666666666668) internal successors, (388), 25 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 7446 transitions. [2022-03-15 15:10:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2022-03-15 15:10:49,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:49,526 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:49,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 15:10:49,527 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1414280070, now seen corresponding path program 1 times [2022-03-15 15:10:49,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:49,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884870183] [2022-03-15 15:10:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:49,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:49,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884870183] [2022-03-15 15:10:49,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884870183] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:49,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:49,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:10:49,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713751986] [2022-03-15 15:10:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:49,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:10:49,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:10:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:49,716 INFO L87 Difference]: Start difference. First operand 4001 states and 7446 transitions. Second operand has 6 states, 5 states have (on average 78.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:49,967 INFO L93 Difference]: Finished difference Result 4154 states and 7747 transitions. [2022-03-15 15:10:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:10:49,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 78.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2022-03-15 15:10:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:49,972 INFO L225 Difference]: With dead ends: 4154 [2022-03-15 15:10:49,973 INFO L226 Difference]: Without dead ends: 4154 [2022-03-15 15:10:49,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:10:49,973 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 98 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:49,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 920 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:10:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2022-03-15 15:10:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 4117. [2022-03-15 15:10:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 4094 states have (on average 1.8744504152418173) internal successors, (7674), 4116 states have internal predecessors, (7674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 7674 transitions. [2022-03-15 15:10:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 7674 transitions. Word has length 435 [2022-03-15 15:10:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:50,026 INFO L470 AbstractCegarLoop]: Abstraction has 4117 states and 7674 transitions. [2022-03-15 15:10:50,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 78.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 7674 transitions. [2022-03-15 15:10:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:10:50,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:50,045 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:50,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 15:10:50,045 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:10:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 729435768, now seen corresponding path program 1 times [2022-03-15 15:10:50,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:50,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995075051] [2022-03-15 15:10:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:53,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:53,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995075051] [2022-03-15 15:10:53,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995075051] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:53,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:53,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-03-15 15:10:53,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279780385] [2022-03-15 15:10:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:53,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 15:10:53,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 15:10:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2997, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 15:10:53,951 INFO L87 Difference]: Start difference. First operand 4117 states and 7674 transitions. Second operand has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:02,672 INFO L93 Difference]: Finished difference Result 4178 states and 7795 transitions. [2022-03-15 15:11:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:11:02,672 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:11:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:02,677 INFO L225 Difference]: With dead ends: 4178 [2022-03-15 15:11:02,677 INFO L226 Difference]: Without dead ends: 4178 [2022-03-15 15:11:02,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2659, Invalid=13853, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 15:11:02,680 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 7220 mSDsluCounter, 6634 mSDsCounter, 0 mSdLazyCounter, 7761 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7220 SdHoareTripleChecker+Valid, 6961 SdHoareTripleChecker+Invalid, 8426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 7761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:02,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7220 Valid, 6961 Invalid, 8426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 7761 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 15:11:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2022-03-15 15:11:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4128. [2022-03-15 15:11:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 4105 states have (on average 1.874786845310597) internal successors, (7696), 4127 states have internal predecessors, (7696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 7696 transitions. [2022-03-15 15:11:02,716 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 7696 transitions. Word has length 439 [2022-03-15 15:11:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:02,717 INFO L470 AbstractCegarLoop]: Abstraction has 4128 states and 7696 transitions. [2022-03-15 15:11:02,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 7696 transitions. [2022-03-15 15:11:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:11:02,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:02,719 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:02,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 15:11:02,719 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:11:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1282201264, now seen corresponding path program 2 times [2022-03-15 15:11:02,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:02,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166905445] [2022-03-15 15:11:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:07,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:07,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166905445] [2022-03-15 15:11:07,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166905445] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:07,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:07,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:11:07,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169275938] [2022-03-15 15:11:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:07,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:11:07,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:11:07,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=3222, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:11:07,043 INFO L87 Difference]: Start difference. First operand 4128 states and 7696 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:20,680 INFO L93 Difference]: Finished difference Result 4408 states and 8212 transitions. [2022-03-15 15:11:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 15:11:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:11:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:20,686 INFO L225 Difference]: With dead ends: 4408 [2022-03-15 15:11:20,686 INFO L226 Difference]: Without dead ends: 4408 [2022-03-15 15:11:20,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5105 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3278, Invalid=17314, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 15:11:20,690 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 7482 mSDsluCounter, 6480 mSDsCounter, 0 mSdLazyCounter, 8303 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7482 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 8989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 8303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:20,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7482 Valid, 6801 Invalid, 8989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 8303 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 15:11:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-03-15 15:11:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4136. [2022-03-15 15:11:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4113 states have (on average 1.87503039144177) internal successors, (7712), 4135 states have internal predecessors, (7712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 7712 transitions. [2022-03-15 15:11:20,728 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 7712 transitions. Word has length 439 [2022-03-15 15:11:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:20,728 INFO L470 AbstractCegarLoop]: Abstraction has 4136 states and 7712 transitions. [2022-03-15 15:11:20,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 7712 transitions. [2022-03-15 15:11:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:11:20,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:20,732 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:20,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 15:11:20,733 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:11:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1281999454, now seen corresponding path program 3 times [2022-03-15 15:11:20,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:20,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356033998] [2022-03-15 15:11:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:24,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:24,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356033998] [2022-03-15 15:11:24,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356033998] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:24,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:24,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-03-15 15:11:24,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539948446] [2022-03-15 15:11:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:24,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 15:11:24,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 15:11:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3116, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 15:11:24,722 INFO L87 Difference]: Start difference. First operand 4136 states and 7712 transitions. Second operand has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:36,080 INFO L93 Difference]: Finished difference Result 4406 states and 8208 transitions. [2022-03-15 15:11:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 15:11:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:11:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:36,085 INFO L225 Difference]: With dead ends: 4406 [2022-03-15 15:11:36,085 INFO L226 Difference]: Without dead ends: 4406 [2022-03-15 15:11:36,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4606 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2870, Invalid=15490, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 15:11:36,087 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 7285 mSDsluCounter, 6802 mSDsCounter, 0 mSdLazyCounter, 8465 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7285 SdHoareTripleChecker+Valid, 7126 SdHoareTripleChecker+Invalid, 9113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 8465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:36,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7285 Valid, 7126 Invalid, 9113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 8465 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 15:11:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2022-03-15 15:11:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4144. [2022-03-15 15:11:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4121 states have (on average 1.8752729919922349) internal successors, (7728), 4143 states have internal predecessors, (7728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 7728 transitions. [2022-03-15 15:11:36,126 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 7728 transitions. Word has length 439 [2022-03-15 15:11:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:36,126 INFO L470 AbstractCegarLoop]: Abstraction has 4144 states and 7728 transitions. [2022-03-15 15:11:36,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 7728 transitions. [2022-03-15 15:11:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:11:36,129 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:36,129 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:36,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 15:11:36,129 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:11:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 488156216, now seen corresponding path program 4 times [2022-03-15 15:11:36,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:36,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83790927] [2022-03-15 15:11:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:39,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:39,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83790927] [2022-03-15 15:11:39,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83790927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:39,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:39,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-03-15 15:11:39,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509741728] [2022-03-15 15:11:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:39,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 15:11:39,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 15:11:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=2912, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 15:11:39,149 INFO L87 Difference]: Start difference. First operand 4144 states and 7728 transitions. Second operand has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:47,170 INFO L93 Difference]: Finished difference Result 4221 states and 7881 transitions. [2022-03-15 15:11:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 15:11:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:11:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:47,175 INFO L225 Difference]: With dead ends: 4221 [2022-03-15 15:11:47,175 INFO L226 Difference]: Without dead ends: 4221 [2022-03-15 15:11:47,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3980 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2742, Invalid=13008, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 15:11:47,177 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 6432 mSDsluCounter, 6372 mSDsCounter, 0 mSdLazyCounter, 7968 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6432 SdHoareTripleChecker+Valid, 6695 SdHoareTripleChecker+Invalid, 8610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 7968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:47,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6432 Valid, 6695 Invalid, 8610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 7968 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 15:11:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-03-15 15:11:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4152. [2022-03-15 15:11:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4129 states have (on average 1.8755146524582222) internal successors, (7744), 4151 states have internal predecessors, (7744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 7744 transitions. [2022-03-15 15:11:47,216 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 7744 transitions. Word has length 439 [2022-03-15 15:11:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:47,216 INFO L470 AbstractCegarLoop]: Abstraction has 4152 states and 7744 transitions. [2022-03-15 15:11:47,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 7744 transitions. [2022-03-15 15:11:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:11:47,219 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:47,219 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:47,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 15:11:47,220 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:11:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 494383496, now seen corresponding path program 5 times [2022-03-15 15:11:47,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:47,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590602371] [2022-03-15 15:11:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:51,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:51,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590602371] [2022-03-15 15:11:51,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590602371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:11:51,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:11:51,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:11:51,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382053588] [2022-03-15 15:11:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:11:51,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:11:51,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:11:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=3442, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:11:51,404 INFO L87 Difference]: Start difference. First operand 4152 states and 7744 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:06,618 INFO L93 Difference]: Finished difference Result 4257 states and 7953 transitions. [2022-03-15 15:12:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-15 15:12:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:12:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:06,624 INFO L225 Difference]: With dead ends: 4257 [2022-03-15 15:12:06,624 INFO L226 Difference]: Without dead ends: 4257 [2022-03-15 15:12:06,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5479 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3639, Invalid=18117, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 15:12:06,625 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 9352 mSDsluCounter, 6666 mSDsCounter, 0 mSdLazyCounter, 8518 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9352 SdHoareTripleChecker+Valid, 6989 SdHoareTripleChecker+Invalid, 9438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 8518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:06,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9352 Valid, 6989 Invalid, 9438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 8518 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 15:12:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2022-03-15 15:12:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4156. [2022-03-15 15:12:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 4133 states have (on average 1.875635131865473) internal successors, (7752), 4155 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 7752 transitions. [2022-03-15 15:12:06,662 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 7752 transitions. Word has length 439 [2022-03-15 15:12:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:06,662 INFO L470 AbstractCegarLoop]: Abstraction has 4156 states and 7752 transitions. [2022-03-15 15:12:06,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 7752 transitions. [2022-03-15 15:12:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:12:06,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:06,665 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:06,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 15:12:06,665 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:12:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash -970925168, now seen corresponding path program 6 times [2022-03-15 15:12:06,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:06,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235229209] [2022-03-15 15:12:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:10,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:10,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235229209] [2022-03-15 15:12:10,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235229209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:10,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:10,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:12:10,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816369942] [2022-03-15 15:12:10,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:10,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:12:10,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:12:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3326, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:12:10,598 INFO L87 Difference]: Start difference. First operand 4156 states and 7752 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:27,188 INFO L93 Difference]: Finished difference Result 4473 states and 8342 transitions. [2022-03-15 15:12:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 15:12:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:12:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:27,193 INFO L225 Difference]: With dead ends: 4473 [2022-03-15 15:12:27,193 INFO L226 Difference]: Without dead ends: 4473 [2022-03-15 15:12:27,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7022 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3868, Invalid=21892, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 15:12:27,195 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 8726 mSDsluCounter, 8707 mSDsCounter, 0 mSdLazyCounter, 10444 mSolverCounterSat, 839 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8726 SdHoareTripleChecker+Valid, 9026 SdHoareTripleChecker+Invalid, 11283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 839 IncrementalHoareTripleChecker+Valid, 10444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:27,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8726 Valid, 9026 Invalid, 11283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [839 Valid, 10444 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 15:12:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2022-03-15 15:12:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4164. [2022-03-15 15:12:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4141 states have (on average 1.8758753924172904) internal successors, (7768), 4163 states have internal predecessors, (7768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 7768 transitions. [2022-03-15 15:12:27,240 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 7768 transitions. Word has length 439 [2022-03-15 15:12:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:27,240 INFO L470 AbstractCegarLoop]: Abstraction has 4164 states and 7768 transitions. [2022-03-15 15:12:27,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 7768 transitions. [2022-03-15 15:12:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:12:27,243 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:27,243 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:27,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 15:12:27,243 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:12:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -778773218, now seen corresponding path program 7 times [2022-03-15 15:12:27,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:27,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597324924] [2022-03-15 15:12:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:30,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:30,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597324924] [2022-03-15 15:12:30,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597324924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:30,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:30,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:12:30,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993999282] [2022-03-15 15:12:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:30,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:12:30,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:12:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=3186, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:12:30,453 INFO L87 Difference]: Start difference. First operand 4164 states and 7768 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:39,775 INFO L93 Difference]: Finished difference Result 4300 states and 8039 transitions. [2022-03-15 15:12:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 15:12:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:12:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:39,781 INFO L225 Difference]: With dead ends: 4300 [2022-03-15 15:12:39,781 INFO L226 Difference]: Without dead ends: 4300 [2022-03-15 15:12:39,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4597 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3148, Invalid=14674, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 15:12:39,782 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 7218 mSDsluCounter, 6846 mSDsCounter, 0 mSdLazyCounter, 8284 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7218 SdHoareTripleChecker+Valid, 7170 SdHoareTripleChecker+Invalid, 9063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 8284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:39,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7218 Valid, 7170 Invalid, 9063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 8284 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 15:12:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2022-03-15 15:12:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4170. [2022-03-15 15:12:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4147 states have (on average 1.8760549795032553) internal successors, (7780), 4169 states have internal predecessors, (7780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 7780 transitions. [2022-03-15 15:12:39,831 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 7780 transitions. Word has length 439 [2022-03-15 15:12:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:39,831 INFO L470 AbstractCegarLoop]: Abstraction has 4170 states and 7780 transitions. [2022-03-15 15:12:39,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 7780 transitions. [2022-03-15 15:12:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:12:39,834 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:39,834 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:39,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 15:12:39,835 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:12:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1704061154, now seen corresponding path program 8 times [2022-03-15 15:12:39,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:39,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223996156] [2022-03-15 15:12:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:43,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:43,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223996156] [2022-03-15 15:12:43,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223996156] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:43,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:43,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:12:43,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392726045] [2022-03-15 15:12:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:43,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:12:43,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:12:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3232, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:12:43,646 INFO L87 Difference]: Start difference. First operand 4170 states and 7780 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:54,278 INFO L93 Difference]: Finished difference Result 5525 states and 10450 transitions. [2022-03-15 15:12:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 15:12:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:12:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:54,285 INFO L225 Difference]: With dead ends: 5525 [2022-03-15 15:12:54,285 INFO L226 Difference]: Without dead ends: 5525 [2022-03-15 15:12:54,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4609 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3215, Invalid=15691, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 15:12:54,287 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 8778 mSDsluCounter, 6569 mSDsCounter, 0 mSdLazyCounter, 7927 mSolverCounterSat, 859 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8778 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 8786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 859 IncrementalHoareTripleChecker+Valid, 7927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:54,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8778 Valid, 6933 Invalid, 8786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [859 Valid, 7927 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:12:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2022-03-15 15:12:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 4206. [2022-03-15 15:12:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 4183 states have (on average 1.8771216830026296) internal successors, (7852), 4205 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 7852 transitions. [2022-03-15 15:12:54,344 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 7852 transitions. Word has length 439 [2022-03-15 15:12:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:54,345 INFO L470 AbstractCegarLoop]: Abstraction has 4206 states and 7852 transitions. [2022-03-15 15:12:54,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 7852 transitions. [2022-03-15 15:12:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:12:54,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:54,348 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:54,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 15:12:54,348 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:12:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1511909204, now seen corresponding path program 9 times [2022-03-15 15:12:54,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:54,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009333612] [2022-03-15 15:12:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:58,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:58,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009333612] [2022-03-15 15:12:58,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009333612] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:12:58,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:12:58,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:12:58,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715105987] [2022-03-15 15:12:58,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:12:58,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:12:58,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:12:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=3355, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:12:58,465 INFO L87 Difference]: Start difference. First operand 4206 states and 7852 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:11,550 INFO L93 Difference]: Finished difference Result 5732 states and 10821 transitions. [2022-03-15 15:13:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:13:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:13:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:11,556 INFO L225 Difference]: With dead ends: 5732 [2022-03-15 15:13:11,557 INFO L226 Difference]: Without dead ends: 5732 [2022-03-15 15:13:11,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5071 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3396, Invalid=16910, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 15:13:11,558 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 7862 mSDsluCounter, 7293 mSDsCounter, 0 mSdLazyCounter, 8659 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7862 SdHoareTripleChecker+Valid, 7625 SdHoareTripleChecker+Invalid, 9282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 8659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:11,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7862 Valid, 7625 Invalid, 9282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 8659 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 15:13:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2022-03-15 15:13:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4214. [2022-03-15 15:13:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4214 states, 4191 states have (on average 1.877356239560964) internal successors, (7868), 4213 states have internal predecessors, (7868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 7868 transitions. [2022-03-15 15:13:11,605 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 7868 transitions. Word has length 439 [2022-03-15 15:13:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:11,605 INFO L470 AbstractCegarLoop]: Abstraction has 4214 states and 7868 transitions. [2022-03-15 15:13:11,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 7868 transitions. [2022-03-15 15:13:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:13:11,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:11,608 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:11,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 15:13:11,609 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:13:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1505681924, now seen corresponding path program 10 times [2022-03-15 15:13:11,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:11,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481581635] [2022-03-15 15:13:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:15,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:15,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481581635] [2022-03-15 15:13:15,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481581635] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:15,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:15,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-03-15 15:13:15,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928589210] [2022-03-15 15:13:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:15,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 15:13:15,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 15:13:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=3103, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 15:13:15,065 INFO L87 Difference]: Start difference. First operand 4214 states and 7868 transitions. Second operand has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:25,907 INFO L93 Difference]: Finished difference Result 5498 states and 10396 transitions. [2022-03-15 15:13:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-15 15:13:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:13:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:25,914 INFO L225 Difference]: With dead ends: 5498 [2022-03-15 15:13:25,914 INFO L226 Difference]: Without dead ends: 5498 [2022-03-15 15:13:25,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4572 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3139, Invalid=16043, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 15:13:25,916 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 7665 mSDsluCounter, 8679 mSDsCounter, 0 mSdLazyCounter, 9960 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7665 SdHoareTripleChecker+Valid, 9009 SdHoareTripleChecker+Invalid, 10590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 9960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:25,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7665 Valid, 9009 Invalid, 10590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 9960 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 15:13:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2022-03-15 15:13:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 4244. [2022-03-15 15:13:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 4221 states have (on average 1.8787017294479982) internal successors, (7930), 4243 states have internal predecessors, (7930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 7930 transitions. [2022-03-15 15:13:25,963 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 7930 transitions. Word has length 439 [2022-03-15 15:13:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:25,963 INFO L470 AbstractCegarLoop]: Abstraction has 4244 states and 7930 transitions. [2022-03-15 15:13:25,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 6.793103448275862) internal successors, (394), 59 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 7930 transitions. [2022-03-15 15:13:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:13:25,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:25,966 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:25,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 15:13:25,966 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:13:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2104129137, now seen corresponding path program 1 times [2022-03-15 15:13:25,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:25,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263756463] [2022-03-15 15:13:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:29,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:29,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263756463] [2022-03-15 15:13:29,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263756463] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:29,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:29,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-03-15 15:13:29,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231692443] [2022-03-15 15:13:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:29,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 15:13:29,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:29,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 15:13:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 15:13:29,970 INFO L87 Difference]: Start difference. First operand 4244 states and 7930 transitions. Second operand has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:49,475 INFO L93 Difference]: Finished difference Result 6416 states and 12186 transitions. [2022-03-15 15:13:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 15:13:49,476 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:13:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:49,482 INFO L225 Difference]: With dead ends: 6416 [2022-03-15 15:13:49,482 INFO L226 Difference]: Without dead ends: 6416 [2022-03-15 15:13:49,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6454 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=4025, Invalid=20467, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 15:13:49,483 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 10239 mSDsluCounter, 9098 mSDsCounter, 0 mSdLazyCounter, 11490 mSolverCounterSat, 1650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10239 SdHoareTripleChecker+Valid, 9488 SdHoareTripleChecker+Invalid, 13140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1650 IncrementalHoareTripleChecker+Valid, 11490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:49,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10239 Valid, 9488 Invalid, 13140 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1650 Valid, 11490 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-03-15 15:13:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6416 states. [2022-03-15 15:13:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6416 to 4304. [2022-03-15 15:13:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4304 states, 4281 states have (on average 1.8799345947208597) internal successors, (8048), 4303 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 8048 transitions. [2022-03-15 15:13:49,528 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 8048 transitions. Word has length 439 [2022-03-15 15:13:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:49,528 INFO L470 AbstractCegarLoop]: Abstraction has 4304 states and 8048 transitions. [2022-03-15 15:13:49,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 6.912280701754386) internal successors, (394), 58 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 8048 transitions. [2022-03-15 15:13:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:13:49,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:49,531 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:49,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 15:13:49,531 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:13:49,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash -74478878, now seen corresponding path program 11 times [2022-03-15 15:13:49,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:49,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575324473] [2022-03-15 15:13:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:52,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:52,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575324473] [2022-03-15 15:13:52,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575324473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:13:52,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:13:52,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:13:52,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215152693] [2022-03-15 15:13:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:13:52,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:13:52,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:13:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:13:52,783 INFO L87 Difference]: Start difference. First operand 4304 states and 8048 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:04,002 INFO L93 Difference]: Finished difference Result 6819 states and 12987 transitions. [2022-03-15 15:14:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 15:14:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:14:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:04,011 INFO L225 Difference]: With dead ends: 6819 [2022-03-15 15:14:04,012 INFO L226 Difference]: Without dead ends: 6819 [2022-03-15 15:14:04,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6318 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3772, Invalid=19790, Unknown=0, NotChecked=0, Total=23562 [2022-03-15 15:14:04,013 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 7755 mSDsluCounter, 7422 mSDsCounter, 0 mSdLazyCounter, 9614 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7755 SdHoareTripleChecker+Valid, 7828 SdHoareTripleChecker+Invalid, 10293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 9614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:04,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7755 Valid, 7828 Invalid, 10293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 9614 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 15:14:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2022-03-15 15:14:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 4347. [2022-03-15 15:14:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 4324 states have (on average 1.8811285846438484) internal successors, (8134), 4346 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 8134 transitions. [2022-03-15 15:14:04,076 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 8134 transitions. Word has length 439 [2022-03-15 15:14:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:04,076 INFO L470 AbstractCegarLoop]: Abstraction has 4347 states and 8134 transitions. [2022-03-15 15:14:04,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 8134 transitions. [2022-03-15 15:14:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:14:04,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:04,079 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:04,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 15:14:04,079 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:14:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 117673072, now seen corresponding path program 12 times [2022-03-15 15:14:04,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:04,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049680609] [2022-03-15 15:14:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:07,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:07,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049680609] [2022-03-15 15:14:07,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049680609] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:07,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:07,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:14:07,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272615629] [2022-03-15 15:14:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:07,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:14:07,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:14:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=3190, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:14:07,278 INFO L87 Difference]: Start difference. First operand 4347 states and 8134 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:14,909 INFO L93 Difference]: Finished difference Result 6671 states and 12693 transitions. [2022-03-15 15:14:14,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 15:14:14,909 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:14:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:14,917 INFO L225 Difference]: With dead ends: 6671 [2022-03-15 15:14:14,917 INFO L226 Difference]: Without dead ends: 6671 [2022-03-15 15:14:14,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2607, Invalid=11913, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 15:14:14,918 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 7354 mSDsluCounter, 7195 mSDsCounter, 0 mSdLazyCounter, 7739 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7354 SdHoareTripleChecker+Valid, 7518 SdHoareTripleChecker+Invalid, 8457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 7739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:14,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7354 Valid, 7518 Invalid, 8457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 7739 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 15:14:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2022-03-15 15:14:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 4409. [2022-03-15 15:14:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4386 states have (on average 1.8830369357045145) internal successors, (8259), 4408 states have internal predecessors, (8259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 8259 transitions. [2022-03-15 15:14:14,966 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 8259 transitions. Word has length 439 [2022-03-15 15:14:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:14,966 INFO L470 AbstractCegarLoop]: Abstraction has 4409 states and 8259 transitions. [2022-03-15 15:14:14,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 8259 transitions. [2022-03-15 15:14:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:14:14,969 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:14,969 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:14,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 15:14:14,969 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:14:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash -474546861, now seen corresponding path program 2 times [2022-03-15 15:14:14,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:14,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257132993] [2022-03-15 15:14:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:17,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:17,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257132993] [2022-03-15 15:14:17,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257132993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:17,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:17,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:14:17,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996836796] [2022-03-15 15:14:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:17,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:14:17,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:14:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3239, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:14:17,911 INFO L87 Difference]: Start difference. First operand 4409 states and 8259 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:28,100 INFO L93 Difference]: Finished difference Result 5705 states and 10810 transitions. [2022-03-15 15:14:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 15:14:28,100 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:14:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:28,107 INFO L225 Difference]: With dead ends: 5705 [2022-03-15 15:14:28,107 INFO L226 Difference]: Without dead ends: 5705 [2022-03-15 15:14:28,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3831 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2784, Invalid=13472, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 15:14:28,108 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 5773 mSDsluCounter, 9295 mSDsCounter, 0 mSdLazyCounter, 11669 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5773 SdHoareTripleChecker+Valid, 9680 SdHoareTripleChecker+Invalid, 12235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 11669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:28,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5773 Valid, 9680 Invalid, 12235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 11669 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 15:14:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2022-03-15 15:14:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4426. [2022-03-15 15:14:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4403 states have (on average 1.883488530547354) internal successors, (8293), 4425 states have internal predecessors, (8293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 8293 transitions. [2022-03-15 15:14:28,156 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 8293 transitions. Word has length 439 [2022-03-15 15:14:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:28,157 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 8293 transitions. [2022-03-15 15:14:28,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 8293 transitions. [2022-03-15 15:14:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:14:28,161 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:28,161 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:28,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 15:14:28,161 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:14:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1474542829, now seen corresponding path program 3 times [2022-03-15 15:14:28,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:28,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913836951] [2022-03-15 15:14:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:30,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:30,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913836951] [2022-03-15 15:14:30,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913836951] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:30,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:30,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:14:30,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725679595] [2022-03-15 15:14:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:30,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:14:30,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:14:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3246, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:14:30,978 INFO L87 Difference]: Start difference. First operand 4426 states and 8293 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:39,323 INFO L93 Difference]: Finished difference Result 4478 states and 8398 transitions. [2022-03-15 15:14:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 15:14:39,324 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:14:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:39,329 INFO L225 Difference]: With dead ends: 4478 [2022-03-15 15:14:39,329 INFO L226 Difference]: Without dead ends: 4478 [2022-03-15 15:14:39,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3832 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2739, Invalid=13263, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 15:14:39,330 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 5707 mSDsluCounter, 5916 mSDsCounter, 0 mSdLazyCounter, 6382 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 6181 SdHoareTripleChecker+Invalid, 6936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 6382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:39,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5707 Valid, 6181 Invalid, 6936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 6382 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 15:14:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2022-03-15 15:14:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4426. [2022-03-15 15:14:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4403 states have (on average 1.883488530547354) internal successors, (8293), 4425 states have internal predecessors, (8293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 8293 transitions. [2022-03-15 15:14:39,371 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 8293 transitions. Word has length 439 [2022-03-15 15:14:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:39,371 INFO L470 AbstractCegarLoop]: Abstraction has 4426 states and 8293 transitions. [2022-03-15 15:14:39,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 8293 transitions. [2022-03-15 15:14:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:14:39,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:39,375 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:39,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 15:14:39,375 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:14:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 992266195, now seen corresponding path program 4 times [2022-03-15 15:14:39,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:39,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524570842] [2022-03-15 15:14:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:43,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:43,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524570842] [2022-03-15 15:14:43,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524570842] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:43,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:43,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-03-15 15:14:43,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962638623] [2022-03-15 15:14:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:43,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 15:14:43,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 15:14:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3586, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:14:43,034 INFO L87 Difference]: Start difference. First operand 4426 states and 8293 transitions. Second operand has 63 states, 62 states have (on average 6.354838709677419) internal successors, (394), 63 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:14:52,929 INFO L93 Difference]: Finished difference Result 4592 states and 8621 transitions. [2022-03-15 15:14:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 15:14:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 6.354838709677419) internal successors, (394), 63 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:14:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:14:52,935 INFO L225 Difference]: With dead ends: 4592 [2022-03-15 15:14:52,935 INFO L226 Difference]: Without dead ends: 4592 [2022-03-15 15:14:52,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2827, Invalid=13685, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 15:14:52,936 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 6907 mSDsluCounter, 5784 mSDsCounter, 0 mSdLazyCounter, 6574 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6907 SdHoareTripleChecker+Valid, 6088 SdHoareTripleChecker+Invalid, 7168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 6574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:14:52,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6907 Valid, 6088 Invalid, 7168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 6574 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 15:14:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2022-03-15 15:14:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4427. [2022-03-15 15:14:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4404 states have (on average 1.8835149863760219) internal successors, (8295), 4426 states have internal predecessors, (8295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 8295 transitions. [2022-03-15 15:14:52,983 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 8295 transitions. Word has length 439 [2022-03-15 15:14:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:14:52,983 INFO L470 AbstractCegarLoop]: Abstraction has 4427 states and 8295 transitions. [2022-03-15 15:14:52,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 6.354838709677419) internal successors, (394), 63 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:14:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 8295 transitions. [2022-03-15 15:14:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:14:52,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:14:52,986 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:14:52,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 15:14:52,986 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:14:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:14:52,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1820813779, now seen corresponding path program 5 times [2022-03-15 15:14:52,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:14:52,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484238574] [2022-03-15 15:14:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:14:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:14:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:14:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:14:56,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:14:56,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484238574] [2022-03-15 15:14:56,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484238574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:14:56,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:14:56,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-03-15 15:14:56,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534896042] [2022-03-15 15:14:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:14:56,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 15:14:56,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:14:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 15:14:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2891, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 15:14:56,082 INFO L87 Difference]: Start difference. First operand 4427 states and 8295 transitions. Second operand has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:04,610 INFO L93 Difference]: Finished difference Result 4595 states and 8629 transitions. [2022-03-15 15:15:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 15:15:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:15:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:04,617 INFO L225 Difference]: With dead ends: 4595 [2022-03-15 15:15:04,617 INFO L226 Difference]: Without dead ends: 4595 [2022-03-15 15:15:04,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3807 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2683, Invalid=12569, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 15:15:04,618 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 6058 mSDsluCounter, 6802 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6058 SdHoareTripleChecker+Valid, 7105 SdHoareTripleChecker+Invalid, 8334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:04,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6058 Valid, 7105 Invalid, 8334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 7791 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 15:15:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-03-15 15:15:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4427. [2022-03-15 15:15:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4404 states have (on average 1.8835149863760219) internal successors, (8295), 4426 states have internal predecessors, (8295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 8295 transitions. [2022-03-15 15:15:04,660 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 8295 transitions. Word has length 439 [2022-03-15 15:15:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:04,660 INFO L470 AbstractCegarLoop]: Abstraction has 4427 states and 8295 transitions. [2022-03-15 15:15:04,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 8295 transitions. [2022-03-15 15:15:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:15:04,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:04,663 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:04,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 15:15:04,663 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:15:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1383980319, now seen corresponding path program 6 times [2022-03-15 15:15:04,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:04,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059658360] [2022-03-15 15:15:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:08,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:08,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059658360] [2022-03-15 15:15:08,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059658360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:08,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:08,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:15:08,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035455317] [2022-03-15 15:15:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:08,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:15:08,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:15:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3474, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:15:08,222 INFO L87 Difference]: Start difference. First operand 4427 states and 8295 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:20,684 INFO L93 Difference]: Finished difference Result 5030 states and 9496 transitions. [2022-03-15 15:15:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 15:15:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:15:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:20,692 INFO L225 Difference]: With dead ends: 5030 [2022-03-15 15:15:20,692 INFO L226 Difference]: Without dead ends: 5030 [2022-03-15 15:15:20,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5250 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3410, Invalid=17470, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 15:15:20,693 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 6263 mSDsluCounter, 6226 mSDsCounter, 0 mSdLazyCounter, 7750 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6263 SdHoareTripleChecker+Valid, 6571 SdHoareTripleChecker+Invalid, 8371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 7750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:20,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6263 Valid, 6571 Invalid, 8371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 7750 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:15:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2022-03-15 15:15:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 4485. [2022-03-15 15:15:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4462 states have (on average 1.8848050201703272) internal successors, (8410), 4484 states have internal predecessors, (8410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 8410 transitions. [2022-03-15 15:15:20,743 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 8410 transitions. Word has length 439 [2022-03-15 15:15:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:20,744 INFO L470 AbstractCegarLoop]: Abstraction has 4485 states and 8410 transitions. [2022-03-15 15:15:20,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 8410 transitions. [2022-03-15 15:15:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:15:20,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:20,747 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:20,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 15:15:20,747 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:15:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1651978730, now seen corresponding path program 13 times [2022-03-15 15:15:20,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:20,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727515073] [2022-03-15 15:15:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:24,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:24,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727515073] [2022-03-15 15:15:24,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727515073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:24,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:24,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:15:24,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900758619] [2022-03-15 15:15:24,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:24,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:15:24,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:15:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3210, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:15:24,358 INFO L87 Difference]: Start difference. First operand 4485 states and 8410 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:39,384 INFO L93 Difference]: Finished difference Result 8460 states and 16281 transitions. [2022-03-15 15:15:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 15:15:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:15:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:39,394 INFO L225 Difference]: With dead ends: 8460 [2022-03-15 15:15:39,394 INFO L226 Difference]: Without dead ends: 8460 [2022-03-15 15:15:39,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5017 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3109, Invalid=16631, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 15:15:39,395 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 9276 mSDsluCounter, 11513 mSDsCounter, 0 mSdLazyCounter, 14195 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9276 SdHoareTripleChecker+Valid, 11963 SdHoareTripleChecker+Invalid, 15068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 14195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:39,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9276 Valid, 11963 Invalid, 15068 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [873 Valid, 14195 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-03-15 15:15:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8460 states. [2022-03-15 15:15:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8460 to 4404. [2022-03-15 15:15:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4382 states have (on average 1.8822455499771793) internal successors, (8248), 4403 states have internal predecessors, (8248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 8248 transitions. [2022-03-15 15:15:39,447 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 8248 transitions. Word has length 439 [2022-03-15 15:15:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:39,447 INFO L470 AbstractCegarLoop]: Abstraction has 4404 states and 8248 transitions. [2022-03-15 15:15:39,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 8248 transitions. [2022-03-15 15:15:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:15:39,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:39,450 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:39,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 15:15:39,450 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:15:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1251910747, now seen corresponding path program 7 times [2022-03-15 15:15:39,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:39,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643766598] [2022-03-15 15:15:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:15:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:15:42,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:15:42,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643766598] [2022-03-15 15:15:42,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643766598] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:15:42,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:15:42,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:15:42,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719160489] [2022-03-15 15:15:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:15:42,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:15:42,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:15:42,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:15:42,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3371, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:15:42,936 INFO L87 Difference]: Start difference. First operand 4404 states and 8248 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:15:58,653 INFO L93 Difference]: Finished difference Result 7137 states and 13630 transitions. [2022-03-15 15:15:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 15:15:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:15:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:15:58,661 INFO L225 Difference]: With dead ends: 7137 [2022-03-15 15:15:58,662 INFO L226 Difference]: Without dead ends: 7137 [2022-03-15 15:15:58,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5013 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=3125, Invalid=17755, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 15:15:58,663 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 5970 mSDsluCounter, 10431 mSDsCounter, 0 mSdLazyCounter, 11797 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5970 SdHoareTripleChecker+Valid, 10881 SdHoareTripleChecker+Invalid, 12337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 11797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:15:58,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5970 Valid, 10881 Invalid, 12337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 11797 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-03-15 15:15:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7137 states. [2022-03-15 15:15:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7137 to 4416. [2022-03-15 15:15:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 4394 states have (on average 1.8825671370050068) internal successors, (8272), 4415 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 8272 transitions. [2022-03-15 15:15:58,726 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 8272 transitions. Word has length 439 [2022-03-15 15:15:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:15:58,726 INFO L470 AbstractCegarLoop]: Abstraction has 4416 states and 8272 transitions. [2022-03-15 15:15:58,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:15:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 8272 transitions. [2022-03-15 15:15:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:15:58,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:15:58,729 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:15:58,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 15:15:58,729 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:15:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:15:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 251914779, now seen corresponding path program 8 times [2022-03-15 15:15:58,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:15:58,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368056068] [2022-03-15 15:15:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:15:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:15:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:02,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:02,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368056068] [2022-03-15 15:16:02,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368056068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:02,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:02,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:16:02,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571163477] [2022-03-15 15:16:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:16:02,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:16:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3248, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:16:02,129 INFO L87 Difference]: Start difference. First operand 4416 states and 8272 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:15,725 INFO L93 Difference]: Finished difference Result 5879 states and 11155 transitions. [2022-03-15 15:16:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 15:16:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:16:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:15,731 INFO L225 Difference]: With dead ends: 5879 [2022-03-15 15:16:15,732 INFO L226 Difference]: Without dead ends: 5879 [2022-03-15 15:16:15,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4537 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3151, Invalid=15755, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 15:16:15,733 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 5974 mSDsluCounter, 9255 mSDsCounter, 0 mSdLazyCounter, 9520 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5974 SdHoareTripleChecker+Valid, 9627 SdHoareTripleChecker+Invalid, 10074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 9520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:15,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5974 Valid, 9627 Invalid, 10074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 9520 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 15:16:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2022-03-15 15:16:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 4418. [2022-03-15 15:16:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4396 states have (on average 1.8826205641492266) internal successors, (8276), 4417 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 8276 transitions. [2022-03-15 15:16:15,776 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 8276 transitions. Word has length 439 [2022-03-15 15:16:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:15,776 INFO L470 AbstractCegarLoop]: Abstraction has 4418 states and 8276 transitions. [2022-03-15 15:16:15,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 8276 transitions. [2022-03-15 15:16:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:16:15,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:15,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:15,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 15:16:15,779 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:16:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1576243493, now seen corresponding path program 9 times [2022-03-15 15:16:15,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:15,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207007680] [2022-03-15 15:16:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:18,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:18,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207007680] [2022-03-15 15:16:18,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207007680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:18,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:18,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:16:18,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217666380] [2022-03-15 15:16:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:18,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:16:18,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:18,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:16:18,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3209, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:16:18,643 INFO L87 Difference]: Start difference. First operand 4418 states and 8276 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:27,014 INFO L93 Difference]: Finished difference Result 5864 states and 11125 transitions. [2022-03-15 15:16:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 15:16:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:16:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:27,038 INFO L225 Difference]: With dead ends: 5864 [2022-03-15 15:16:27,038 INFO L226 Difference]: Without dead ends: 5864 [2022-03-15 15:16:27,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3577 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2470, Invalid=11810, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 15:16:27,039 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 5103 mSDsluCounter, 7916 mSDsCounter, 0 mSdLazyCounter, 8664 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5103 SdHoareTripleChecker+Valid, 8291 SdHoareTripleChecker+Invalid, 9133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 8664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:27,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5103 Valid, 8291 Invalid, 9133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 8664 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:16:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5864 states. [2022-03-15 15:16:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5864 to 4419. [2022-03-15 15:16:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4397 states have (on average 1.8826472594951102) internal successors, (8278), 4418 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 8278 transitions. [2022-03-15 15:16:27,079 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 8278 transitions. Word has length 439 [2022-03-15 15:16:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:27,079 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 8278 transitions. [2022-03-15 15:16:27,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 8278 transitions. [2022-03-15 15:16:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:16:27,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:27,082 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:27,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 15:16:27,082 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:16:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -747695909, now seen corresponding path program 10 times [2022-03-15 15:16:27,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:27,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143838877] [2022-03-15 15:16:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:30,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:30,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143838877] [2022-03-15 15:16:30,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143838877] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:30,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:30,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:16:30,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488018621] [2022-03-15 15:16:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:30,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:16:30,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:16:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3361, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:16:30,651 INFO L87 Difference]: Start difference. First operand 4419 states and 8278 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:42,969 INFO L93 Difference]: Finished difference Result 5874 states and 11145 transitions. [2022-03-15 15:16:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 15:16:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:16:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:42,976 INFO L225 Difference]: With dead ends: 5874 [2022-03-15 15:16:42,976 INFO L226 Difference]: Without dead ends: 5874 [2022-03-15 15:16:42,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3994 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3051, Invalid=14505, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 15:16:42,977 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 6297 mSDsluCounter, 7864 mSDsCounter, 0 mSdLazyCounter, 8207 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6297 SdHoareTripleChecker+Valid, 8239 SdHoareTripleChecker+Invalid, 8763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 8207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:42,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6297 Valid, 8239 Invalid, 8763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 8207 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 15:16:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2022-03-15 15:16:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 4419. [2022-03-15 15:16:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4397 states have (on average 1.8826472594951102) internal successors, (8278), 4418 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 8278 transitions. [2022-03-15 15:16:43,019 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 8278 transitions. Word has length 439 [2022-03-15 15:16:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:43,019 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 8278 transitions. [2022-03-15 15:16:43,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 8278 transitions. [2022-03-15 15:16:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:16:43,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:43,022 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:43,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 15:16:43,022 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:16:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 342477289, now seen corresponding path program 11 times [2022-03-15 15:16:43,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:43,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386112220] [2022-03-15 15:16:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:16:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:16:46,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:16:46,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386112220] [2022-03-15 15:16:46,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386112220] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:16:46,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:16:46,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:16:46,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899588839] [2022-03-15 15:16:46,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:16:46,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:16:46,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:16:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:16:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3358, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:16:46,570 INFO L87 Difference]: Start difference. First operand 4419 states and 8278 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:16:57,373 INFO L93 Difference]: Finished difference Result 5884 states and 11165 transitions. [2022-03-15 15:16:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:16:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:16:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:16:57,380 INFO L225 Difference]: With dead ends: 5884 [2022-03-15 15:16:57,380 INFO L226 Difference]: Without dead ends: 5884 [2022-03-15 15:16:57,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4260 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3001, Invalid=15089, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:16:57,382 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 6505 mSDsluCounter, 6024 mSDsCounter, 0 mSdLazyCounter, 6915 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6505 SdHoareTripleChecker+Valid, 6399 SdHoareTripleChecker+Invalid, 7505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 6915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:16:57,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6505 Valid, 6399 Invalid, 7505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 6915 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 15:16:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2022-03-15 15:16:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 4419. [2022-03-15 15:16:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4397 states have (on average 1.8826472594951102) internal successors, (8278), 4418 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 8278 transitions. [2022-03-15 15:16:57,424 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 8278 transitions. Word has length 439 [2022-03-15 15:16:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:16:57,424 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 8278 transitions. [2022-03-15 15:16:57,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:16:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 8278 transitions. [2022-03-15 15:16:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:16:57,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:16:57,427 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:16:57,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 15:16:57,427 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:16:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:16:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1273681943, now seen corresponding path program 12 times [2022-03-15 15:16:57,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:16:57,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51750411] [2022-03-15 15:16:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:16:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:16:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:00,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:00,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51750411] [2022-03-15 15:17:00,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51750411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:00,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:00,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:17:00,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617215249] [2022-03-15 15:17:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:00,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:17:00,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:17:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3502, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:17:00,858 INFO L87 Difference]: Start difference. First operand 4419 states and 8278 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:15,589 INFO L93 Difference]: Finished difference Result 6384 states and 12165 transitions. [2022-03-15 15:17:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 15:17:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:17:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:15,596 INFO L225 Difference]: With dead ends: 6384 [2022-03-15 15:17:15,596 INFO L226 Difference]: Without dead ends: 6384 [2022-03-15 15:17:15,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3169, Invalid=16013, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 15:17:15,597 INFO L933 BasicCegarLoop]: 482 mSDtfsCounter, 7152 mSDsluCounter, 11981 mSDsCounter, 0 mSdLazyCounter, 13370 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7152 SdHoareTripleChecker+Valid, 12445 SdHoareTripleChecker+Invalid, 14123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 13370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:15,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7152 Valid, 12445 Invalid, 14123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 13370 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-03-15 15:17:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6384 states. [2022-03-15 15:17:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6384 to 4430. [2022-03-15 15:17:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4408 states have (on average 1.882940108892922) internal successors, (8300), 4429 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 8300 transitions. [2022-03-15 15:17:15,638 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 8300 transitions. Word has length 439 [2022-03-15 15:17:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:15,638 INFO L470 AbstractCegarLoop]: Abstraction has 4430 states and 8300 transitions. [2022-03-15 15:17:15,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 8300 transitions. [2022-03-15 15:17:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:17:15,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:15,641 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:15,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-15 15:17:15,641 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:17:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -554476329, now seen corresponding path program 13 times [2022-03-15 15:17:15,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:15,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123241467] [2022-03-15 15:17:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:19,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:19,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123241467] [2022-03-15 15:17:19,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123241467] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:19,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:19,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:17:19,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102752990] [2022-03-15 15:17:19,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:19,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:17:19,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:17:19,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3362, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:17:19,187 INFO L87 Difference]: Start difference. First operand 4430 states and 8300 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:31,181 INFO L93 Difference]: Finished difference Result 6046 states and 11489 transitions. [2022-03-15 15:17:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 15:17:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:17:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:31,188 INFO L225 Difference]: With dead ends: 6046 [2022-03-15 15:17:31,188 INFO L226 Difference]: Without dead ends: 6046 [2022-03-15 15:17:31,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4125 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2764, Invalid=14528, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 15:17:31,189 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 6144 mSDsluCounter, 9073 mSDsCounter, 0 mSdLazyCounter, 9524 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6144 SdHoareTripleChecker+Valid, 9525 SdHoareTripleChecker+Invalid, 10141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 9524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:31,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6144 Valid, 9525 Invalid, 10141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 9524 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 15:17:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2022-03-15 15:17:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 4431. [2022-03-15 15:17:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4409 states have (on average 1.8829666591063734) internal successors, (8302), 4430 states have internal predecessors, (8302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 8302 transitions. [2022-03-15 15:17:31,230 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 8302 transitions. Word has length 439 [2022-03-15 15:17:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:31,230 INFO L470 AbstractCegarLoop]: Abstraction has 4431 states and 8302 transitions. [2022-03-15 15:17:31,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 8302 transitions. [2022-03-15 15:17:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:17:31,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:31,233 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:31,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-15 15:17:31,233 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:17:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash 274071255, now seen corresponding path program 14 times [2022-03-15 15:17:31,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:31,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619347067] [2022-03-15 15:17:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:34,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:34,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619347067] [2022-03-15 15:17:34,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619347067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:34,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:34,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:17:34,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537210673] [2022-03-15 15:17:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:34,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:17:34,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:17:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3239, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:17:34,005 INFO L87 Difference]: Start difference. First operand 4431 states and 8302 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:43,643 INFO L93 Difference]: Finished difference Result 6051 states and 11499 transitions. [2022-03-15 15:17:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 15:17:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:17:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:43,650 INFO L225 Difference]: With dead ends: 6051 [2022-03-15 15:17:43,650 INFO L226 Difference]: Without dead ends: 6051 [2022-03-15 15:17:43,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2796, Invalid=13716, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 15:17:43,651 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 6826 mSDsluCounter, 10460 mSDsCounter, 0 mSdLazyCounter, 11091 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6826 SdHoareTripleChecker+Valid, 10910 SdHoareTripleChecker+Invalid, 11791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 11091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:43,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6826 Valid, 10910 Invalid, 11791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 11091 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 15:17:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2022-03-15 15:17:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 4430. [2022-03-15 15:17:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4408 states have (on average 1.882940108892922) internal successors, (8300), 4429 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 8300 transitions. [2022-03-15 15:17:43,698 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 8300 transitions. Word has length 439 [2022-03-15 15:17:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:43,699 INFO L470 AbstractCegarLoop]: Abstraction has 4430 states and 8300 transitions. [2022-03-15 15:17:43,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 8300 transitions. [2022-03-15 15:17:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:17:43,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:43,702 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:43,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 15:17:43,702 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:17:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash 14352701, now seen corresponding path program 15 times [2022-03-15 15:17:43,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:43,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880636548] [2022-03-15 15:17:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:17:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:17:46,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:17:46,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880636548] [2022-03-15 15:17:46,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880636548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:17:46,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:17:46,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:17:46,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664243989] [2022-03-15 15:17:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:17:46,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:17:46,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:17:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:17:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3243, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:17:46,622 INFO L87 Difference]: Start difference. First operand 4430 states and 8300 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:17:56,431 INFO L93 Difference]: Finished difference Result 6152 states and 11701 transitions. [2022-03-15 15:17:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 15:17:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:17:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:17:56,439 INFO L225 Difference]: With dead ends: 6152 [2022-03-15 15:17:56,439 INFO L226 Difference]: Without dead ends: 6152 [2022-03-15 15:17:56,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4349 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3044, Invalid=15046, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:17:56,440 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 6684 mSDsluCounter, 7759 mSDsCounter, 0 mSdLazyCounter, 8772 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6684 SdHoareTripleChecker+Valid, 8248 SdHoareTripleChecker+Invalid, 9442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 8772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:17:56,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6684 Valid, 8248 Invalid, 9442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 8772 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 15:17:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2022-03-15 15:17:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 4432. [2022-03-15 15:17:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4410 states have (on average 1.8829931972789116) internal successors, (8304), 4431 states have internal predecessors, (8304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 8304 transitions. [2022-03-15 15:17:56,484 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 8304 transitions. Word has length 439 [2022-03-15 15:17:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:17:56,484 INFO L470 AbstractCegarLoop]: Abstraction has 4432 states and 8304 transitions. [2022-03-15 15:17:56,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:17:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 8304 transitions. [2022-03-15 15:17:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:17:56,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:17:56,487 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:17:56,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 15:17:56,487 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:17:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:17:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 842900285, now seen corresponding path program 16 times [2022-03-15 15:17:56,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:17:56,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041107888] [2022-03-15 15:17:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:17:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:17:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:00,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:00,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041107888] [2022-03-15 15:18:00,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041107888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:00,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:00,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:18:00,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391953468] [2022-03-15 15:18:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:00,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:18:00,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:18:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:18:00,142 INFO L87 Difference]: Start difference. First operand 4432 states and 8304 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:13,936 INFO L93 Difference]: Finished difference Result 6041 states and 11479 transitions. [2022-03-15 15:18:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 15:18:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:18:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:13,943 INFO L225 Difference]: With dead ends: 6041 [2022-03-15 15:18:13,943 INFO L226 Difference]: Without dead ends: 6041 [2022-03-15 15:18:13,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3336, Invalid=16404, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 15:18:13,944 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 6789 mSDsluCounter, 9077 mSDsCounter, 0 mSdLazyCounter, 9171 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6789 SdHoareTripleChecker+Valid, 9546 SdHoareTripleChecker+Invalid, 9870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 9171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:13,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6789 Valid, 9546 Invalid, 9870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 9171 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 15:18:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2022-03-15 15:18:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 4432. [2022-03-15 15:18:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4410 states have (on average 1.8829931972789116) internal successors, (8304), 4431 states have internal predecessors, (8304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 8304 transitions. [2022-03-15 15:18:13,982 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 8304 transitions. Word has length 439 [2022-03-15 15:18:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:13,982 INFO L470 AbstractCegarLoop]: Abstraction has 4432 states and 8304 transitions. [2022-03-15 15:18:13,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 8304 transitions. [2022-03-15 15:18:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:18:13,985 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:13,985 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:13,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-15 15:18:13,985 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:18:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1824788501, now seen corresponding path program 17 times [2022-03-15 15:18:13,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:13,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891074753] [2022-03-15 15:18:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:16,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:16,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891074753] [2022-03-15 15:18:16,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891074753] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:16,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:16,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:18:16,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114866170] [2022-03-15 15:18:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:16,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:18:16,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:18:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3334, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:18:16,723 INFO L87 Difference]: Start difference. First operand 4432 states and 8304 transitions. Second operand has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:24,691 INFO L93 Difference]: Finished difference Result 5941 states and 11281 transitions. [2022-03-15 15:18:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 15:18:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:18:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:24,698 INFO L225 Difference]: With dead ends: 5941 [2022-03-15 15:18:24,698 INFO L226 Difference]: Without dead ends: 5941 [2022-03-15 15:18:24,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2724, Invalid=12776, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 15:18:24,699 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 6271 mSDsluCounter, 7284 mSDsCounter, 0 mSdLazyCounter, 7683 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6271 SdHoareTripleChecker+Valid, 7682 SdHoareTripleChecker+Invalid, 8365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 7683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:24,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6271 Valid, 7682 Invalid, 8365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 7683 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 15:18:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2022-03-15 15:18:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 4432. [2022-03-15 15:18:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4410 states have (on average 1.8829931972789116) internal successors, (8304), 4431 states have internal predecessors, (8304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 8304 transitions. [2022-03-15 15:18:24,749 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 8304 transitions. Word has length 439 [2022-03-15 15:18:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:24,749 INFO L470 AbstractCegarLoop]: Abstraction has 4432 states and 8304 transitions. [2022-03-15 15:18:24,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.566666666666666) internal successors, (394), 61 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 8304 transitions. [2022-03-15 15:18:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:18:24,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:24,752 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:24,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-15 15:18:24,752 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:18:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash 642020523, now seen corresponding path program 18 times [2022-03-15 15:18:24,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:24,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788354893] [2022-03-15 15:18:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:27,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:27,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788354893] [2022-03-15 15:18:27,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788354893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:27,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:27,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-03-15 15:18:27,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466769230] [2022-03-15 15:18:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:27,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 15:18:27,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 15:18:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2890, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 15:18:27,611 INFO L87 Difference]: Start difference. First operand 4432 states and 8304 transitions. Second operand has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:18:35,863 INFO L93 Difference]: Finished difference Result 6047 states and 11491 transitions. [2022-03-15 15:18:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 15:18:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:18:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:18:35,870 INFO L225 Difference]: With dead ends: 6047 [2022-03-15 15:18:35,870 INFO L226 Difference]: Without dead ends: 6047 [2022-03-15 15:18:35,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3550 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2488, Invalid=11792, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 15:18:35,871 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 5642 mSDsluCounter, 7531 mSDsCounter, 0 mSdLazyCounter, 8024 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5642 SdHoareTripleChecker+Valid, 7945 SdHoareTripleChecker+Invalid, 8606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 8024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:18:35,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5642 Valid, 7945 Invalid, 8606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 8024 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 15:18:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2022-03-15 15:18:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 4431. [2022-03-15 15:18:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4409 states have (on average 1.8829666591063734) internal successors, (8302), 4430 states have internal predecessors, (8302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 8302 transitions. [2022-03-15 15:18:35,922 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 8302 transitions. Word has length 439 [2022-03-15 15:18:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:18:35,923 INFO L470 AbstractCegarLoop]: Abstraction has 4431 states and 8302 transitions. [2022-03-15 15:18:35,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 7.035714285714286) internal successors, (394), 57 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:18:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 8302 transitions. [2022-03-15 15:18:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:18:35,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:18:35,926 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:18:35,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-15 15:18:35,927 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:18:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:18:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1470568107, now seen corresponding path program 19 times [2022-03-15 15:18:35,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:18:35,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760751964] [2022-03-15 15:18:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:18:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:18:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:18:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:18:40,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:18:40,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760751964] [2022-03-15 15:18:40,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760751964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:18:40,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:18:40,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:18:40,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812348157] [2022-03-15 15:18:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:18:40,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:18:40,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:18:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:18:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=3501, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:18:40,233 INFO L87 Difference]: Start difference. First operand 4431 states and 8302 transitions. Second operand has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:00,569 INFO L93 Difference]: Finished difference Result 6057 states and 11511 transitions. [2022-03-15 15:19:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 15:19:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:19:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:00,577 INFO L225 Difference]: With dead ends: 6057 [2022-03-15 15:19:00,577 INFO L226 Difference]: Without dead ends: 6057 [2022-03-15 15:19:00,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4234 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=3021, Invalid=15611, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 15:19:00,578 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 6660 mSDsluCounter, 8306 mSDsCounter, 0 mSdLazyCounter, 8751 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6660 SdHoareTripleChecker+Valid, 8721 SdHoareTripleChecker+Invalid, 9415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 8751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:00,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6660 Valid, 8721 Invalid, 9415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 8751 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 15:19:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2022-03-15 15:19:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 4429. [2022-03-15 15:19:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4429 states, 4407 states have (on average 1.8829135466303608) internal successors, (8298), 4428 states have internal predecessors, (8298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 8298 transitions. [2022-03-15 15:19:00,647 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 8298 transitions. Word has length 439 [2022-03-15 15:19:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:00,648 INFO L470 AbstractCegarLoop]: Abstraction has 4429 states and 8298 transitions. [2022-03-15 15:19:00,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.459016393442623) internal successors, (394), 62 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 8298 transitions. [2022-03-15 15:19:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-03-15 15:19:00,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:00,651 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:00,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-15 15:19:00,651 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:19:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1734225991, now seen corresponding path program 20 times [2022-03-15 15:19:00,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:00,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023347202] [2022-03-15 15:19:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:03,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:03,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023347202] [2022-03-15 15:19:03,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023347202] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:03,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:03,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:19:03,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810377689] [2022-03-15 15:19:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:03,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:19:03,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:19:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=3231, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:19:03,437 INFO L87 Difference]: Start difference. First operand 4429 states and 8298 transitions. Second operand has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:12,435 INFO L93 Difference]: Finished difference Result 5927 states and 11253 transitions. [2022-03-15 15:19:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 15:19:12,436 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2022-03-15 15:19:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:12,442 INFO L225 Difference]: With dead ends: 5927 [2022-03-15 15:19:12,442 INFO L226 Difference]: Without dead ends: 5927 [2022-03-15 15:19:12,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3105, Invalid=15255, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 15:19:12,443 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 6480 mSDsluCounter, 8271 mSDsCounter, 0 mSdLazyCounter, 8697 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6480 SdHoareTripleChecker+Valid, 8666 SdHoareTripleChecker+Invalid, 9377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 8697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:12,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6480 Valid, 8666 Invalid, 9377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 8697 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-03-15 15:19:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2022-03-15 15:19:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 4407. [2022-03-15 15:19:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4407 states, 4385 states have (on average 1.8823261117445838) internal successors, (8254), 4406 states have internal predecessors, (8254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 8254 transitions. [2022-03-15 15:19:12,500 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 8254 transitions. Word has length 439 [2022-03-15 15:19:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:12,501 INFO L470 AbstractCegarLoop]: Abstraction has 4407 states and 8254 transitions. [2022-03-15 15:19:12,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.677966101694915) internal successors, (394), 60 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 8254 transitions. [2022-03-15 15:19:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:19:12,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:12,503 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:12,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-15 15:19:12,504 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:19:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1627186580, now seen corresponding path program 1 times [2022-03-15 15:19:12,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:12,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928053769] [2022-03-15 15:19:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:16,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:16,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928053769] [2022-03-15 15:19:16,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928053769] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:16,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:16,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:19:16,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584258197] [2022-03-15 15:19:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:16,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:19:16,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:19:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3358, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:19:16,237 INFO L87 Difference]: Start difference. First operand 4407 states and 8254 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:29,625 INFO L93 Difference]: Finished difference Result 6026 states and 11447 transitions. [2022-03-15 15:19:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 15:19:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:19:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:29,632 INFO L225 Difference]: With dead ends: 6026 [2022-03-15 15:19:29,632 INFO L226 Difference]: Without dead ends: 6026 [2022-03-15 15:19:29,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4701 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3399, Invalid=16623, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 15:19:29,633 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 7022 mSDsluCounter, 6401 mSDsCounter, 0 mSdLazyCounter, 7851 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7022 SdHoareTripleChecker+Valid, 6799 SdHoareTripleChecker+Invalid, 8490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 7851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:29,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7022 Valid, 6799 Invalid, 8490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 7851 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 15:19:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2022-03-15 15:19:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 4418. [2022-03-15 15:19:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4396 states have (on average 1.8826205641492266) internal successors, (8276), 4417 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 8276 transitions. [2022-03-15 15:19:29,694 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 8276 transitions. Word has length 440 [2022-03-15 15:19:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:29,694 INFO L470 AbstractCegarLoop]: Abstraction has 4418 states and 8276 transitions. [2022-03-15 15:19:29,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 8276 transitions. [2022-03-15 15:19:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:19:29,697 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:29,697 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:29,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-15 15:19:29,697 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:19:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1826046508, now seen corresponding path program 2 times [2022-03-15 15:19:29,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:29,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110810288] [2022-03-15 15:19:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:33,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:33,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110810288] [2022-03-15 15:19:33,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110810288] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:33,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:33,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:19:33,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655883991] [2022-03-15 15:19:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:33,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:19:33,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:19:33,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3450, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:19:33,559 INFO L87 Difference]: Start difference. First operand 4418 states and 8276 transitions. Second operand has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:19:45,558 INFO L93 Difference]: Finished difference Result 6017 states and 11429 transitions. [2022-03-15 15:19:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 15:19:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:19:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:19:45,566 INFO L225 Difference]: With dead ends: 6017 [2022-03-15 15:19:45,566 INFO L226 Difference]: Without dead ends: 6017 [2022-03-15 15:19:45,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5775 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2763, Invalid=17543, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 15:19:45,567 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 5620 mSDsluCounter, 7605 mSDsCounter, 0 mSdLazyCounter, 9644 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5620 SdHoareTripleChecker+Valid, 7998 SdHoareTripleChecker+Invalid, 10213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 9644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:19:45,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5620 Valid, 7998 Invalid, 10213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 9644 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 15:19:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2022-03-15 15:19:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 4423. [2022-03-15 15:19:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 4401 states have (on average 1.8827539195637355) internal successors, (8286), 4422 states have internal predecessors, (8286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 8286 transitions. [2022-03-15 15:19:45,613 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 8286 transitions. Word has length 440 [2022-03-15 15:19:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:19:45,613 INFO L470 AbstractCegarLoop]: Abstraction has 4423 states and 8286 transitions. [2022-03-15 15:19:45,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:19:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 8286 transitions. [2022-03-15 15:19:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:19:45,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:19:45,616 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:19:45,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-15 15:19:45,617 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:19:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:19:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1533816852, now seen corresponding path program 3 times [2022-03-15 15:19:45,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:19:45,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768620748] [2022-03-15 15:19:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:19:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:19:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:19:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:19:49,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:19:49,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768620748] [2022-03-15 15:19:49,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768620748] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:19:49,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:19:49,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:19:49,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350663439] [2022-03-15 15:19:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:19:49,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:19:49,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:19:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:19:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:19:49,430 INFO L87 Difference]: Start difference. First operand 4423 states and 8286 transitions. Second operand has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:07,353 INFO L93 Difference]: Finished difference Result 4815 states and 9068 transitions. [2022-03-15 15:20:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 15:20:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:20:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:07,358 INFO L225 Difference]: With dead ends: 4815 [2022-03-15 15:20:07,358 INFO L226 Difference]: Without dead ends: 4815 [2022-03-15 15:20:07,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4435 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=2758, Invalid=15332, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 15:20:07,359 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 5787 mSDsluCounter, 7770 mSDsCounter, 0 mSdLazyCounter, 9100 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5787 SdHoareTripleChecker+Valid, 8077 SdHoareTripleChecker+Invalid, 9647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 9100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:07,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5787 Valid, 8077 Invalid, 9647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 9100 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 15:20:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2022-03-15 15:20:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4418. [2022-03-15 15:20:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4396 states have (on average 1.8826205641492266) internal successors, (8276), 4417 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 8276 transitions. [2022-03-15 15:20:07,394 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 8276 transitions. Word has length 440 [2022-03-15 15:20:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:07,394 INFO L470 AbstractCegarLoop]: Abstraction has 4418 states and 8276 transitions. [2022-03-15 15:20:07,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 8276 transitions. [2022-03-15 15:20:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:20:07,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:07,397 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:07,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-15 15:20:07,397 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:20:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 695485268, now seen corresponding path program 4 times [2022-03-15 15:20:07,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:07,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756564037] [2022-03-15 15:20:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:10,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:10,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756564037] [2022-03-15 15:20:10,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756564037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:10,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:10,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-03-15 15:20:10,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710308698] [2022-03-15 15:20:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:10,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 15:20:10,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 15:20:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3174, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:20:10,301 INFO L87 Difference]: Start difference. First operand 4418 states and 8276 transitions. Second operand has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:17,827 INFO L93 Difference]: Finished difference Result 4573 states and 8584 transitions. [2022-03-15 15:20:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 15:20:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:20:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:17,837 INFO L225 Difference]: With dead ends: 4573 [2022-03-15 15:20:17,837 INFO L226 Difference]: Without dead ends: 4573 [2022-03-15 15:20:17,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2721, Invalid=12531, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 15:20:17,838 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 5007 mSDsluCounter, 6406 mSDsCounter, 0 mSdLazyCounter, 7262 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5007 SdHoareTripleChecker+Valid, 6706 SdHoareTripleChecker+Invalid, 7722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 7262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:17,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5007 Valid, 6706 Invalid, 7722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 7262 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 15:20:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2022-03-15 15:20:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4419. [2022-03-15 15:20:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4397 states have (on average 1.8826472594951102) internal successors, (8278), 4418 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 8278 transitions. [2022-03-15 15:20:17,873 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 8278 transitions. Word has length 440 [2022-03-15 15:20:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:17,874 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 8278 transitions. [2022-03-15 15:20:17,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 6.694915254237288) internal successors, (395), 60 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 8278 transitions. [2022-03-15 15:20:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:20:17,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:17,876 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:17,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-15 15:20:17,876 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:20:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash 610656596, now seen corresponding path program 5 times [2022-03-15 15:20:17,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:17,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151554329] [2022-03-15 15:20:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:20,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:20,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151554329] [2022-03-15 15:20:20,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151554329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:20,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:20,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:20:20,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139831266] [2022-03-15 15:20:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:20,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:20:20,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:20:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3385, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:20:20,514 INFO L87 Difference]: Start difference. First operand 4419 states and 8278 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:28,183 INFO L93 Difference]: Finished difference Result 4490 states and 8420 transitions. [2022-03-15 15:20:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 15:20:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:20:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:28,188 INFO L225 Difference]: With dead ends: 4490 [2022-03-15 15:20:28,188 INFO L226 Difference]: Without dead ends: 4490 [2022-03-15 15:20:28,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3283 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2621, Invalid=12631, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 15:20:28,189 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 6447 mSDsluCounter, 7288 mSDsCounter, 0 mSdLazyCounter, 7503 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6447 SdHoareTripleChecker+Valid, 7562 SdHoareTripleChecker+Invalid, 8099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 7503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:28,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6447 Valid, 7562 Invalid, 8099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 7503 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 15:20:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2022-03-15 15:20:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4419. [2022-03-15 15:20:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4419 states, 4397 states have (on average 1.8826472594951102) internal successors, (8278), 4418 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 8278 transitions. [2022-03-15 15:20:28,223 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 8278 transitions. Word has length 440 [2022-03-15 15:20:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:28,223 INFO L470 AbstractCegarLoop]: Abstraction has 4419 states and 8278 transitions. [2022-03-15 15:20:28,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 8278 transitions. [2022-03-15 15:20:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:20:28,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:28,226 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:28,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-15 15:20:28,226 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:20:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -687202420, now seen corresponding path program 6 times [2022-03-15 15:20:28,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:28,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544199846] [2022-03-15 15:20:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:31,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:31,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544199846] [2022-03-15 15:20:31,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544199846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:31,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:31,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:20:31,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350247030] [2022-03-15 15:20:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:31,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:20:31,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:20:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3362, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:20:31,806 INFO L87 Difference]: Start difference. First operand 4419 states and 8278 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:20:47,526 INFO L93 Difference]: Finished difference Result 7888 states and 15132 transitions. [2022-03-15 15:20:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 15:20:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:20:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:20:47,536 INFO L225 Difference]: With dead ends: 7888 [2022-03-15 15:20:47,537 INFO L226 Difference]: Without dead ends: 7888 [2022-03-15 15:20:47,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4959 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3363, Invalid=16659, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 15:20:47,538 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 6002 mSDsluCounter, 8176 mSDsCounter, 0 mSdLazyCounter, 9819 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6002 SdHoareTripleChecker+Valid, 8631 SdHoareTripleChecker+Invalid, 10397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 9819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:20:47,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6002 Valid, 8631 Invalid, 10397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 9819 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 15:20:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7888 states. [2022-03-15 15:20:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7888 to 4424. [2022-03-15 15:20:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 4402 states have (on average 1.882780554293503) internal successors, (8288), 4423 states have internal predecessors, (8288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 8288 transitions. [2022-03-15 15:20:47,592 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 8288 transitions. Word has length 440 [2022-03-15 15:20:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:20:47,593 INFO L470 AbstractCegarLoop]: Abstraction has 4424 states and 8288 transitions. [2022-03-15 15:20:47,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:20:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 8288 transitions. [2022-03-15 15:20:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:20:47,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:20:47,595 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:20:47,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-15 15:20:47,596 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:20:47,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:20:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -780572148, now seen corresponding path program 7 times [2022-03-15 15:20:47,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:20:47,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503703865] [2022-03-15 15:20:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:20:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:20:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:20:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:20:51,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:20:51,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503703865] [2022-03-15 15:20:51,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503703865] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:20:51,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:20:51,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:20:51,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459766825] [2022-03-15 15:20:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:20:51,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:20:51,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:20:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:20:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3371, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:20:51,377 INFO L87 Difference]: Start difference. First operand 4424 states and 8288 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:05,792 INFO L93 Difference]: Finished difference Result 5915 states and 11227 transitions. [2022-03-15 15:21:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 15:21:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:21:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:05,800 INFO L225 Difference]: With dead ends: 5915 [2022-03-15 15:21:05,800 INFO L226 Difference]: Without dead ends: 5915 [2022-03-15 15:21:05,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4075 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2942, Invalid=14880, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 15:21:05,805 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 6199 mSDsluCounter, 8714 mSDsCounter, 0 mSdLazyCounter, 9104 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6199 SdHoareTripleChecker+Valid, 9089 SdHoareTripleChecker+Invalid, 9646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 9104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:05,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6199 Valid, 9089 Invalid, 9646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 9104 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-03-15 15:21:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2022-03-15 15:21:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 4436. [2022-03-15 15:21:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4414 states have (on average 1.8830992297236067) internal successors, (8312), 4435 states have internal predecessors, (8312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 8312 transitions. [2022-03-15 15:21:05,870 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 8312 transitions. Word has length 440 [2022-03-15 15:21:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:05,870 INFO L470 AbstractCegarLoop]: Abstraction has 4436 states and 8312 transitions. [2022-03-15 15:21:05,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 8312 transitions. [2022-03-15 15:21:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:21:05,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:05,873 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:05,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-15 15:21:05,873 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:21:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1618903732, now seen corresponding path program 8 times [2022-03-15 15:21:05,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:05,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11975296] [2022-03-15 15:21:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:08,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:08,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11975296] [2022-03-15 15:21:08,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11975296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:08,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:08,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:21:08,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130048577] [2022-03-15 15:21:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:08,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:21:08,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:21:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3375, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:21:08,789 INFO L87 Difference]: Start difference. First operand 4436 states and 8312 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:17,472 INFO L93 Difference]: Finished difference Result 5810 states and 11019 transitions. [2022-03-15 15:21:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 15:21:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:21:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:17,479 INFO L225 Difference]: With dead ends: 5810 [2022-03-15 15:21:17,480 INFO L226 Difference]: Without dead ends: 5810 [2022-03-15 15:21:17,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3565 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2546, Invalid=13204, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 15:21:17,481 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 6470 mSDsluCounter, 8793 mSDsCounter, 0 mSdLazyCounter, 8247 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6470 SdHoareTripleChecker+Valid, 9147 SdHoareTripleChecker+Invalid, 8821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 8247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:17,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6470 Valid, 9147 Invalid, 8821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 8247 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 15:21:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2022-03-15 15:21:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 4437. [2022-03-15 15:21:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4415 states have (on average 1.8831257078142696) internal successors, (8314), 4436 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 8314 transitions. [2022-03-15 15:21:17,544 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 8314 transitions. Word has length 440 [2022-03-15 15:21:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:17,544 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 8314 transitions. [2022-03-15 15:21:17,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 8314 transitions. [2022-03-15 15:21:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:21:17,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:17,547 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:17,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-15 15:21:17,547 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:21:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1703732404, now seen corresponding path program 9 times [2022-03-15 15:21:17,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:17,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23876968] [2022-03-15 15:21:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:21,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:21,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23876968] [2022-03-15 15:21:21,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23876968] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:21,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:21,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:21:21,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180112059] [2022-03-15 15:21:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:21,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:21:21,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:21:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3366, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:21:21,802 INFO L87 Difference]: Start difference. First operand 4437 states and 8314 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:35,776 INFO L93 Difference]: Finished difference Result 5952 states and 11301 transitions. [2022-03-15 15:21:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 15:21:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:21:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:35,785 INFO L225 Difference]: With dead ends: 5952 [2022-03-15 15:21:35,785 INFO L226 Difference]: Without dead ends: 5952 [2022-03-15 15:21:35,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4593 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2976, Invalid=16484, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 15:21:35,786 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 6340 mSDsluCounter, 9439 mSDsCounter, 0 mSdLazyCounter, 9717 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6340 SdHoareTripleChecker+Valid, 9808 SdHoareTripleChecker+Invalid, 10272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 9717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:35,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6340 Valid, 9808 Invalid, 10272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 9717 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 15:21:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2022-03-15 15:21:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4437. [2022-03-15 15:21:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4415 states have (on average 1.8831257078142696) internal successors, (8314), 4436 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 8314 transitions. [2022-03-15 15:21:35,838 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 8314 transitions. Word has length 440 [2022-03-15 15:21:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:35,838 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 8314 transitions. [2022-03-15 15:21:35,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 8314 transitions. [2022-03-15 15:21:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:21:35,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:35,841 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:35,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-15 15:21:35,841 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:21:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2026865662, now seen corresponding path program 10 times [2022-03-15 15:21:35,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:35,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162744117] [2022-03-15 15:21:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:39,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:39,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162744117] [2022-03-15 15:21:39,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162744117] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:39,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:39,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-03-15 15:21:39,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85067219] [2022-03-15 15:21:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:39,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 15:21:39,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 15:21:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3365, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:21:39,848 INFO L87 Difference]: Start difference. First operand 4437 states and 8314 transitions. Second operand has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:21:53,437 INFO L93 Difference]: Finished difference Result 6006 states and 11409 transitions. [2022-03-15 15:21:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 15:21:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:21:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:21:53,445 INFO L225 Difference]: With dead ends: 6006 [2022-03-15 15:21:53,445 INFO L226 Difference]: Without dead ends: 6006 [2022-03-15 15:21:53,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4428 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3189, Invalid=15993, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 15:21:53,446 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 5542 mSDsluCounter, 9845 mSDsCounter, 0 mSdLazyCounter, 10678 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5542 SdHoareTripleChecker+Valid, 10223 SdHoareTripleChecker+Invalid, 11180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 10678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:21:53,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5542 Valid, 10223 Invalid, 11180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 10678 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 15:21:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2022-03-15 15:21:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 4437. [2022-03-15 15:21:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4415 states have (on average 1.8831257078142696) internal successors, (8314), 4436 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 8314 transitions. [2022-03-15 15:21:53,501 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 8314 transitions. Word has length 440 [2022-03-15 15:21:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:21:53,501 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 8314 transitions. [2022-03-15 15:21:53,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.583333333333333) internal successors, (395), 61 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:21:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 8314 transitions. [2022-03-15 15:21:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:21:53,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:21:53,504 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:21:53,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-15 15:21:53,504 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:21:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:21:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -8892720, now seen corresponding path program 11 times [2022-03-15 15:21:53,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:21:53,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855965743] [2022-03-15 15:21:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:21:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:21:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:21:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:21:56,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:21:56,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855965743] [2022-03-15 15:21:56,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855965743] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:21:56,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:21:56,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-03-15 15:21:56,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368438520] [2022-03-15 15:21:56,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:21:56,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 15:21:56,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:21:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 15:21:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3086, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 15:21:56,683 INFO L87 Difference]: Start difference. First operand 4437 states and 8314 transitions. Second operand has 59 states, 58 states have (on average 6.810344827586207) internal successors, (395), 59 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:22:05,959 INFO L93 Difference]: Finished difference Result 6197 states and 11791 transitions. [2022-03-15 15:22:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 15:22:05,960 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 6.810344827586207) internal successors, (395), 59 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:22:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:22:05,967 INFO L225 Difference]: With dead ends: 6197 [2022-03-15 15:22:05,967 INFO L226 Difference]: Without dead ends: 6197 [2022-03-15 15:22:05,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3997 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2432, Invalid=13824, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 15:22:05,968 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 4997 mSDsluCounter, 7786 mSDsCounter, 0 mSdLazyCounter, 8096 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4997 SdHoareTripleChecker+Valid, 8219 SdHoareTripleChecker+Invalid, 8629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 8096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:22:05,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4997 Valid, 8219 Invalid, 8629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 8096 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 15:22:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2022-03-15 15:22:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 4437. [2022-03-15 15:22:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4415 states have (on average 1.8831257078142696) internal successors, (8314), 4436 states have internal predecessors, (8314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 8314 transitions. [2022-03-15 15:22:06,033 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 8314 transitions. Word has length 440 [2022-03-15 15:22:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:22:06,033 INFO L470 AbstractCegarLoop]: Abstraction has 4437 states and 8314 transitions. [2022-03-15 15:22:06,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 6.810344827586207) internal successors, (395), 59 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 8314 transitions. [2022-03-15 15:22:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:22:06,035 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:22:06,035 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:06,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-15 15:22:06,036 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:22:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:22:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -93721392, now seen corresponding path program 12 times [2022-03-15 15:22:06,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:22:06,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627298469] [2022-03-15 15:22:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:22:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:22:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:22:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:22:09,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:22:09,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627298469] [2022-03-15 15:22:09,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627298469] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:22:09,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:22:09,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-03-15 15:22:09,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536877804] [2022-03-15 15:22:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:22:09,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 15:22:09,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:22:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 15:22:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3505, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 15:22:09,966 INFO L87 Difference]: Start difference. First operand 4437 states and 8314 transitions. Second operand has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:22:22,000 INFO L93 Difference]: Finished difference Result 6090 states and 11577 transitions. [2022-03-15 15:22:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 15:22:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2022-03-15 15:22:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:22:22,007 INFO L225 Difference]: With dead ends: 6090 [2022-03-15 15:22:22,008 INFO L226 Difference]: Without dead ends: 6090 [2022-03-15 15:22:22,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2755, Invalid=14275, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 15:22:22,008 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 7109 mSDsluCounter, 8496 mSDsCounter, 0 mSdLazyCounter, 9154 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7109 SdHoareTripleChecker+Valid, 8949 SdHoareTripleChecker+Invalid, 9856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 9154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:22:22,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7109 Valid, 8949 Invalid, 9856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 9154 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 15:22:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2022-03-15 15:22:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 4438. [2022-03-15 15:22:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4416 states have (on average 1.8831521739130435) internal successors, (8316), 4437 states have internal predecessors, (8316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 8316 transitions. [2022-03-15 15:22:22,063 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 8316 transitions. Word has length 440 [2022-03-15 15:22:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:22:22,063 INFO L470 AbstractCegarLoop]: Abstraction has 4438 states and 8316 transitions. [2022-03-15 15:22:22,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.475409836065574) internal successors, (395), 62 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:22:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 8316 transitions. [2022-03-15 15:22:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-03-15 15:22:22,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:22:22,065 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:22,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-15 15:22:22,066 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2022-03-15 15:22:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:22:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 360109354, now seen corresponding path program 13 times [2022-03-15 15:22:22,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:22:22,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396940774] [2022-03-15 15:22:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:22:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:22:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-03-15 15:22:22,977 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2022-03-15 15:22:22,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-15 15:22:22,978 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2022-03-15 15:22:22,979 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2022-03-15 15:22:22,980 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2022-03-15 15:22:22,981 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2022-03-15 15:22:22,983 INFO L732 BasicCegarLoop]: Path program histogram: [20, 13, 13, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:22:22,986 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 15:22:22,986 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 15:22:22,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:22:22 BasicIcfg [2022-03-15 15:22:22,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 15:22:22,987 INFO L158 Benchmark]: Toolchain (without parser) took 724923.81ms. Allocated memory was 209.7MB in the beginning and 683.7MB in the end (delta: 474.0MB). Free memory was 151.9MB in the beginning and 127.8MB in the end (delta: 24.1MB). Peak memory consumption was 499.6MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,987 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:22:22,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.79ms. Allocated memory is still 209.7MB. Free memory was 151.7MB in the beginning and 155.6MB in the end (delta: -3.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.36ms. Allocated memory is still 209.7MB. Free memory was 155.6MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,988 INFO L158 Benchmark]: Boogie Preprocessor took 67.17ms. Allocated memory is still 209.7MB. Free memory was 149.3MB in the beginning and 144.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,988 INFO L158 Benchmark]: RCFGBuilder took 760.58ms. Allocated memory is still 209.7MB. Free memory was 144.0MB in the beginning and 100.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,988 INFO L158 Benchmark]: TraceAbstraction took 723498.14ms. Allocated memory was 209.7MB in the beginning and 683.7MB in the end (delta: 474.0MB). Free memory was 99.5MB in the beginning and 127.8MB in the end (delta: -28.3MB). Peak memory consumption was 446.7MB. Max. memory is 8.0GB. [2022-03-15 15:22:22,988 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.09ms. Allocated memory is still 209.7MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.79ms. Allocated memory is still 209.7MB. Free memory was 151.7MB in the beginning and 155.6MB in the end (delta: -3.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.36ms. Allocated memory is still 209.7MB. Free memory was 155.6MB in the beginning and 149.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.17ms. Allocated memory is still 209.7MB. Free memory was 149.3MB in the beginning and 144.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 760.58ms. Allocated memory is still 209.7MB. Free memory was 144.0MB in the beginning and 100.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 723498.14ms. Allocated memory was 209.7MB in the beginning and 683.7MB in the end (delta: 474.0MB). Free memory was 99.5MB in the beginning and 127.8MB in the end (delta: -28.3MB). Peak memory consumption was 446.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1263]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1271]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 441 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 599 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 723.3s, OverallIterations: 70, TraceHistogramMax: 10, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.2s, AutomataDifference: 551.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318563 SdHoareTripleChecker+Valid, 211.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318563 mSDsluCounter, 422451 SdHoareTripleChecker+Invalid, 179.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393355 mSDsCounter, 32318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 432347 IncrementalHoareTripleChecker+Invalid, 464665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32318 mSolverCounterUnsat, 29939 mSDtfsCounter, 432347 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8125 GetRequests, 1640 SyntacticMatches, 33 SemanticMatches, 6452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205002 ImplicationChecksByTransitivity, 410.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4485occurred in iteration=42, InterpolantAutomatonStates: 4033, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 69 MinimizatonAttempts, 74908 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 8.2s SatisfiabilityAnalysisTime, 153.9s InterpolantComputationTime, 26332 NumberOfCodeBlocks, 26282 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 26505 ConstructedInterpolants, 0 QuantifiedInterpolants, 968420 SizeOfPredicates, 23 NumberOfNonLiveVariables, 991 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 77 InterpolantComputations, 66 PerfectInterpolantSequences, 14700/15223 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown