/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/ldv-races/race-3_2b-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 01:47:28,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:47:28,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:47:28,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:47:28,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:47:28,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:47:28,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:47:28,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:47:28,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:47:28,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:47:28,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:47:28,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:47:28,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:47:28,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:47:28,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:47:28,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:47:28,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:47:28,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:47:28,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:47:28,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:47:28,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:47:28,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:47:28,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:47:28,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:47:28,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:47:28,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:47:28,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:47:28,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:47:28,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:47:28,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:47:28,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:47:28,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:47:28,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:47:28,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:47:28,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:47:28,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:47:28,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:47:28,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:47:28,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:47:28,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:47:28,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:47:28,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-09 01:47:28,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:47:28,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:47:28,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:47:28,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:47:28,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:47:28,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:47:28,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:47:28,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:47:28,520 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:47:28,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:47:28,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:47:28,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:47:28,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:47:28,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:47:28,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:47:28,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:47:28,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:47:28,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:47:28,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-09 01:47:28,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:47:28,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:47:28,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:47:28,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:47:28,767 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:47:28,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i [2022-02-09 01:47:28,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c0efd0/d61223ca5c2e40198427d35c7f7cac38/FLAG378fcdefd [2022-02-09 01:47:29,396 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:47:29,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i [2022-02-09 01:47:29,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c0efd0/d61223ca5c2e40198427d35c7f7cac38/FLAG378fcdefd [2022-02-09 01:47:29,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c0efd0/d61223ca5c2e40198427d35c7f7cac38 [2022-02-09 01:47:29,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:47:29,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:47:29,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:47:29,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:47:29,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:47:29,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:47:29" (1/1) ... [2022-02-09 01:47:29,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2596c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:29, skipping insertion in model container [2022-02-09 01:47:29,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:47:29" (1/1) ... [2022-02-09 01:47:29,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:47:29,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:47:30,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i[76084,76097] [2022-02-09 01:47:30,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:47:30,642 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:47:30,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i[76084,76097] [2022-02-09 01:47:30,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:47:30,816 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:47:30,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30 WrapperNode [2022-02-09 01:47:30,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:47:30,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:47:30,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:47:30,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:47:30,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,879 INFO L137 Inliner]: procedures = 481, calls = 45, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 206 [2022-02-09 01:47:30,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:47:30,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:47:30,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:47:30,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:47:30,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:47:30,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:47:30,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:47:30,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:47:30,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (1/1) ... [2022-02-09 01:47:30,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:47:30,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:47:31,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 01:47:31,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:47:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-02-09 01:47:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-02-09 01:47:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:47:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:47:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 01:47:31,060 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 01:47:31,306 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:47:31,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:47:31,701 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:47:31,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:47:31,710 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-09 01:47:31,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:47:31 BoogieIcfgContainer [2022-02-09 01:47:31,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:47:31,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:47:31,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:47:31,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:47:31,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:47:29" (1/3) ... [2022-02-09 01:47:31,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2891f878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:47:31, skipping insertion in model container [2022-02-09 01:47:31,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:47:30" (2/3) ... [2022-02-09 01:47:31,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2891f878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:47:31, skipping insertion in model container [2022-02-09 01:47:31,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:47:31" (3/3) ... [2022-02-09 01:47:31,726 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2b-container_of-global.i [2022-02-09 01:47:31,730 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:47:31,730 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:47:31,730 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-09 01:47:31,730 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:47:31,786 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,786 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,787 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,788 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,789 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,790 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,791 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,792 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,793 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,794 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,795 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,796 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,797 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,798 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,799 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,800 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,800 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,800 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,800 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,800 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,801 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,802 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,803 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,804 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,805 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,806 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,807 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,808 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,809 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,810 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,811 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,812 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,813 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,814 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,815 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,816 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,816 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,816 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,816 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,816 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,817 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,818 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,819 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,820 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,821 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,822 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,823 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,823 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,823 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,823 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,823 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,824 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,825 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,826 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,827 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,828 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,829 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,830 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,836 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,836 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,836 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,836 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,837 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,838 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,840 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,840 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,841 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:47:31,846 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-09 01:47:31,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:47:31,903 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 [2022-02-09 01:47:31,903 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-02-09 01:47:31,923 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 315 places, 317 transitions, 650 flow [2022-02-09 01:47:34,911 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105789 states, 105597 states have (on average 2.952792219475932) internal successors, (311806), 105788 states have internal predecessors, (311806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 105789 states, 105597 states have (on average 2.952792219475932) internal successors, (311806), 105788 states have internal predecessors, (311806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-09 01:47:35,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:35,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:47:35,147 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1840180247, now seen corresponding path program 1 times [2022-02-09 01:47:35,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:35,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664859143] [2022-02-09 01:47:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:35,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:35,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:35,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664859143] [2022-02-09 01:47:35,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664859143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:35,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:35,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:35,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601813402] [2022-02-09 01:47:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:35,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:35,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:35,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:35,826 INFO L87 Difference]: Start difference. First operand has 105789 states, 105597 states have (on average 2.952792219475932) internal successors, (311806), 105788 states have internal predecessors, (311806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:37,561 INFO L93 Difference]: Finished difference Result 103191 states and 301571 transitions. [2022-02-09 01:47:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-09 01:47:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:38,275 INFO L225 Difference]: With dead ends: 103191 [2022-02-09 01:47:38,275 INFO L226 Difference]: Without dead ends: 102785 [2022-02-09 01:47:38,277 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-02-09 01:47:38,279 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 3 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:38,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 473 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:47:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102785 states. [2022-02-09 01:47:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102785 to 102785. [2022-02-09 01:47:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102785 states, 102548 states have (on average 2.92901860592113) internal successors, (300365), 102784 states have internal predecessors, (300365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102785 states to 102785 states and 300365 transitions. [2022-02-09 01:47:42,649 INFO L78 Accepts]: Start accepts. Automaton has 102785 states and 300365 transitions. Word has length 43 [2022-02-09 01:47:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:42,650 INFO L470 AbstractCegarLoop]: Abstraction has 102785 states and 300365 transitions. [2022-02-09 01:47:42,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 102785 states and 300365 transitions. [2022-02-09 01:47:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-09 01:47:42,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:42,651 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] [2022-02-09 01:47:42,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:47:42,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1599150069, now seen corresponding path program 1 times [2022-02-09 01:47:42,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:42,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132412204] [2022-02-09 01:47:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:42,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:42,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:42,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132412204] [2022-02-09 01:47:42,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132412204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:42,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:42,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:42,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596776459] [2022-02-09 01:47:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:42,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:42,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:42,869 INFO L87 Difference]: Start difference. First operand 102785 states and 300365 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:44,049 INFO L93 Difference]: Finished difference Result 102784 states and 300364 transitions. [2022-02-09 01:47:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:44,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-09 01:47:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:44,690 INFO L225 Difference]: With dead ends: 102784 [2022-02-09 01:47:44,690 INFO L226 Difference]: Without dead ends: 102784 [2022-02-09 01:47:44,690 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-02-09 01:47:44,691 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:44,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 816 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 01:47:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102784 states. [2022-02-09 01:47:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102784 to 102784. [2022-02-09 01:47:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102784 states, 102548 states have (on average 2.929008854390139) internal successors, (300364), 102783 states have internal predecessors, (300364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102784 states to 102784 states and 300364 transitions. [2022-02-09 01:47:48,244 INFO L78 Accepts]: Start accepts. Automaton has 102784 states and 300364 transitions. Word has length 51 [2022-02-09 01:47:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:48,246 INFO L470 AbstractCegarLoop]: Abstraction has 102784 states and 300364 transitions. [2022-02-09 01:47:48,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102784 states and 300364 transitions. [2022-02-09 01:47:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-09 01:47:48,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:48,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:47:48,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:47:48,249 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1158199009, now seen corresponding path program 1 times [2022-02-09 01:47:48,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:48,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833751895] [2022-02-09 01:47:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:48,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:48,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:48,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833751895] [2022-02-09 01:47:48,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833751895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:48,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:48,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:48,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196707542] [2022-02-09 01:47:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:48,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:48,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:48,397 INFO L87 Difference]: Start difference. First operand 102784 states and 300364 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:49,417 INFO L93 Difference]: Finished difference Result 102788 states and 300368 transitions. [2022-02-09 01:47:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-09 01:47:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:49,846 INFO L225 Difference]: With dead ends: 102788 [2022-02-09 01:47:49,846 INFO L226 Difference]: Without dead ends: 102788 [2022-02-09 01:47:49,847 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-02-09 01:47:49,854 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 160 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:49,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 420 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:47:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102788 states. [2022-02-09 01:47:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102788 to 102783. [2022-02-09 01:47:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102783 states, 102548 states have (on average 2.928999102859149) internal successors, (300363), 102782 states have internal predecessors, (300363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102783 states to 102783 states and 300363 transitions. [2022-02-09 01:47:53,295 INFO L78 Accepts]: Start accepts. Automaton has 102783 states and 300363 transitions. Word has length 58 [2022-02-09 01:47:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:53,295 INFO L470 AbstractCegarLoop]: Abstraction has 102783 states and 300363 transitions. [2022-02-09 01:47:53,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 102783 states and 300363 transitions. [2022-02-09 01:47:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-09 01:47:53,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:53,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:47:53,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 01:47:53,298 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -13695806, now seen corresponding path program 1 times [2022-02-09 01:47:53,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:53,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605993687] [2022-02-09 01:47:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:53,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:53,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:53,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605993687] [2022-02-09 01:47:53,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605993687] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:53,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:53,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:53,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433669140] [2022-02-09 01:47:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:53,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:53,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:53,514 INFO L87 Difference]: Start difference. First operand 102783 states and 300363 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:54,554 INFO L93 Difference]: Finished difference Result 102787 states and 300367 transitions. [2022-02-09 01:47:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:54,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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-02-09 01:47:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:54,951 INFO L225 Difference]: With dead ends: 102787 [2022-02-09 01:47:54,952 INFO L226 Difference]: Without dead ends: 102787 [2022-02-09 01:47:54,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-02-09 01:47:54,954 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 140 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:54,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 433 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 01:47:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102787 states. [2022-02-09 01:47:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102787 to 102782. [2022-02-09 01:47:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102782 states, 102548 states have (on average 2.9289893513281586) internal successors, (300362), 102781 states have internal predecessors, (300362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102782 states to 102782 states and 300362 transitions. [2022-02-09 01:47:58,381 INFO L78 Accepts]: Start accepts. Automaton has 102782 states and 300362 transitions. Word has length 71 [2022-02-09 01:47:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:58,381 INFO L470 AbstractCegarLoop]: Abstraction has 102782 states and 300362 transitions. [2022-02-09 01:47:58,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 102782 states and 300362 transitions. [2022-02-09 01:47:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-09 01:47:58,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:58,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:47:58,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 01:47:58,383 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1677420701, now seen corresponding path program 1 times [2022-02-09 01:47:58,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:58,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112020228] [2022-02-09 01:47:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:58,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:58,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:58,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112020228] [2022-02-09 01:47:58,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112020228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:58,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:58,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:47:58,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417699267] [2022-02-09 01:47:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:58,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:47:58,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:58,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:47:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:47:58,509 INFO L87 Difference]: Start difference. First operand 102782 states and 300362 transitions. Second operand has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:59,314 INFO L93 Difference]: Finished difference Result 102781 states and 300361 transitions. [2022-02-09 01:47:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:47:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-02-09 01:47:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:59,818 INFO L225 Difference]: With dead ends: 102781 [2022-02-09 01:47:59,818 INFO L226 Difference]: Without dead ends: 102781 [2022-02-09 01:47:59,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:47:59,819 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:59,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 566 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:48:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102781 states. [2022-02-09 01:48:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102781 to 102781. [2022-02-09 01:48:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102781 states, 102548 states have (on average 2.9289795997971684) internal successors, (300361), 102780 states have internal predecessors, (300361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102781 states to 102781 states and 300361 transitions. [2022-02-09 01:48:02,913 INFO L78 Accepts]: Start accepts. Automaton has 102781 states and 300361 transitions. Word has length 86 [2022-02-09 01:48:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:02,913 INFO L470 AbstractCegarLoop]: Abstraction has 102781 states and 300361 transitions. [2022-02-09 01:48:02,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 102781 states and 300361 transitions. [2022-02-09 01:48:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-09 01:48:02,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:02,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:02,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 01:48:02,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 85619990, now seen corresponding path program 1 times [2022-02-09 01:48:02,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:02,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584915232] [2022-02-09 01:48:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:02,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:03,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:03,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584915232] [2022-02-09 01:48:03,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584915232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:03,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:03,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:48:03,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167425885] [2022-02-09 01:48:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:03,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:48:03,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:48:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:48:03,019 INFO L87 Difference]: Start difference. First operand 102781 states and 300361 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:03,937 INFO L93 Difference]: Finished difference Result 97196 states and 283769 transitions. [2022-02-09 01:48:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:48:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-09 01:48:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:04,232 INFO L225 Difference]: With dead ends: 97196 [2022-02-09 01:48:04,233 INFO L226 Difference]: Without dead ends: 97196 [2022-02-09 01:48:04,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:48:04,234 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 196 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:04,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 551 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:48:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97196 states. [2022-02-09 01:48:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97196 to 97155. [2022-02-09 01:48:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97155 states, 97004 states have (on average 2.9249206218300277) internal successors, (283729), 97154 states have internal predecessors, (283729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97155 states to 97155 states and 283729 transitions. [2022-02-09 01:48:07,117 INFO L78 Accepts]: Start accepts. Automaton has 97155 states and 283729 transitions. Word has length 95 [2022-02-09 01:48:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:07,117 INFO L470 AbstractCegarLoop]: Abstraction has 97155 states and 283729 transitions. [2022-02-09 01:48:07,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 97155 states and 283729 transitions. [2022-02-09 01:48:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-09 01:48:07,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:07,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:07,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-09 01:48:07,119 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1204766771, now seen corresponding path program 1 times [2022-02-09 01:48:07,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:07,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906636033] [2022-02-09 01:48:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:07,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:07,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:07,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906636033] [2022-02-09 01:48:07,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906636033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:07,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:07,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:07,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311836558] [2022-02-09 01:48:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:07,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:07,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:07,272 INFO L87 Difference]: Start difference. First operand 97155 states and 283729 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:08,780 INFO L93 Difference]: Finished difference Result 102793 states and 300295 transitions. [2022-02-09 01:48:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-09 01:48:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:09,277 INFO L225 Difference]: With dead ends: 102793 [2022-02-09 01:48:09,277 INFO L226 Difference]: Without dead ends: 102793 [2022-02-09 01:48:09,277 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-02-09 01:48:09,278 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 177 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:09,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 909 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:48:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102793 states. [2022-02-09 01:48:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102793 to 101649. [2022-02-09 01:48:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101649 states, 101499 states have (on average 2.925477098296535) internal successors, (296933), 101648 states have internal predecessors, (296933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101649 states to 101649 states and 296933 transitions. [2022-02-09 01:48:12,910 INFO L78 Accepts]: Start accepts. Automaton has 101649 states and 296933 transitions. Word has length 98 [2022-02-09 01:48:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:12,911 INFO L470 AbstractCegarLoop]: Abstraction has 101649 states and 296933 transitions. [2022-02-09 01:48:12,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101649 states and 296933 transitions. [2022-02-09 01:48:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-09 01:48:12,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:12,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:12,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-09 01:48:12,913 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1810508390, now seen corresponding path program 1 times [2022-02-09 01:48:12,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:12,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427542875] [2022-02-09 01:48:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:12,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:13,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:13,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427542875] [2022-02-09 01:48:13,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427542875] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:13,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:13,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:13,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411894836] [2022-02-09 01:48:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:13,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-09 01:48:13,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-09 01:48:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-09 01:48:13,124 INFO L87 Difference]: Start difference. First operand 101649 states and 296933 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:14,320 INFO L93 Difference]: Finished difference Result 101677 states and 296960 transitions. [2022-02-09 01:48:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-09 01:48:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:14,789 INFO L225 Difference]: With dead ends: 101677 [2022-02-09 01:48:14,790 INFO L226 Difference]: Without dead ends: 101677 [2022-02-09 01:48:14,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-09 01:48:14,790 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 86 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:14,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1127 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:48:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101677 states. [2022-02-09 01:48:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101677 to 101637. [2022-02-09 01:48:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101637 states, 101488 states have (on average 2.9256759419832887) internal successors, (296921), 101636 states have internal predecessors, (296921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101637 states to 101637 states and 296921 transitions. [2022-02-09 01:48:17,883 INFO L78 Accepts]: Start accepts. Automaton has 101637 states and 296921 transitions. Word has length 100 [2022-02-09 01:48:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:17,883 INFO L470 AbstractCegarLoop]: Abstraction has 101637 states and 296921 transitions. [2022-02-09 01:48:17,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101637 states and 296921 transitions. [2022-02-09 01:48:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-09 01:48:17,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:17,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:17,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 01:48:17,885 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1301793336, now seen corresponding path program 1 times [2022-02-09 01:48:17,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:17,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171745515] [2022-02-09 01:48:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:17,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:18,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:18,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171745515] [2022-02-09 01:48:18,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171745515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:18,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:18,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:18,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936597543] [2022-02-09 01:48:18,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:18,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:18,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:18,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:18,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:18,416 INFO L87 Difference]: Start difference. First operand 101637 states and 296921 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:20,026 INFO L93 Difference]: Finished difference Result 114444 states and 334720 transitions. [2022-02-09 01:48:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-02-09 01:48:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:20,409 INFO L225 Difference]: With dead ends: 114444 [2022-02-09 01:48:20,410 INFO L226 Difference]: Without dead ends: 114444 [2022-02-09 01:48:20,410 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-02-09 01:48:20,410 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 345 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:20,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 1501 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:48:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114444 states. [2022-02-09 01:48:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114444 to 111737. [2022-02-09 01:48:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111737 states, 111588 states have (on average 2.9279671649281283) internal successors, (326726), 111736 states have internal predecessors, (326726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111737 states to 111737 states and 326726 transitions. [2022-02-09 01:48:23,628 INFO L78 Accepts]: Start accepts. Automaton has 111737 states and 326726 transitions. Word has length 104 [2022-02-09 01:48:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:23,629 INFO L470 AbstractCegarLoop]: Abstraction has 111737 states and 326726 transitions. [2022-02-09 01:48:23,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 111737 states and 326726 transitions. [2022-02-09 01:48:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-09 01:48:23,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:23,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:23,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-09 01:48:23,631 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1968245462, now seen corresponding path program 1 times [2022-02-09 01:48:23,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:23,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464327418] [2022-02-09 01:48:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:23,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:23,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:23,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464327418] [2022-02-09 01:48:23,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464327418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:23,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:23,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:23,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21671662] [2022-02-09 01:48:23,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:23,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:23,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:23,761 INFO L87 Difference]: Start difference. First operand 111737 states and 326726 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:25,444 INFO L93 Difference]: Finished difference Result 117497 states and 343654 transitions. [2022-02-09 01:48:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:25,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-09 01:48:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:26,137 INFO L225 Difference]: With dead ends: 117497 [2022-02-09 01:48:26,137 INFO L226 Difference]: Without dead ends: 117497 [2022-02-09 01:48:26,137 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-02-09 01:48:26,138 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 178 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:26,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 877 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-09 01:48:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117497 states. [2022-02-09 01:48:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117497 to 116222. [2022-02-09 01:48:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116222 states, 116074 states have (on average 2.9283302031462686) internal successors, (339903), 116221 states have internal predecessors, (339903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116222 states to 116222 states and 339903 transitions. [2022-02-09 01:48:29,369 INFO L78 Accepts]: Start accepts. Automaton has 116222 states and 339903 transitions. Word has length 106 [2022-02-09 01:48:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:29,370 INFO L470 AbstractCegarLoop]: Abstraction has 116222 states and 339903 transitions. [2022-02-09 01:48:29,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 116222 states and 339903 transitions. [2022-02-09 01:48:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-09 01:48:29,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:29,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:29,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-09 01:48:29,373 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1160066615, now seen corresponding path program 1 times [2022-02-09 01:48:29,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:29,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654216030] [2022-02-09 01:48:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:29,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:29,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:29,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654216030] [2022-02-09 01:48:29,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654216030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:29,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:29,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:29,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44135034] [2022-02-09 01:48:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:29,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:29,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:29,502 INFO L87 Difference]: Start difference. First operand 116222 states and 339903 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:31,077 INFO L93 Difference]: Finished difference Result 129482 states and 378990 transitions. [2022-02-09 01:48:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-02-09 01:48:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:31,823 INFO L225 Difference]: With dead ends: 129482 [2022-02-09 01:48:31,823 INFO L226 Difference]: Without dead ends: 129482 [2022-02-09 01:48:31,824 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-02-09 01:48:31,824 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 350 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:31,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 1070 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:48:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129482 states. [2022-02-09 01:48:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129482 to 126340. [2022-02-09 01:48:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126340 states, 126192 states have (on average 2.9297499049068088) internal successors, (369711), 126339 states have internal predecessors, (369711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126340 states to 126340 states and 369711 transitions. [2022-02-09 01:48:35,376 INFO L78 Accepts]: Start accepts. Automaton has 126340 states and 369711 transitions. Word has length 110 [2022-02-09 01:48:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:35,376 INFO L470 AbstractCegarLoop]: Abstraction has 126340 states and 369711 transitions. [2022-02-09 01:48:35,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 126340 states and 369711 transitions. [2022-02-09 01:48:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-09 01:48:35,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:35,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:35,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-09 01:48:35,382 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1447726433, now seen corresponding path program 1 times [2022-02-09 01:48:35,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:35,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663901250] [2022-02-09 01:48:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:35,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:35,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:35,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663901250] [2022-02-09 01:48:35,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663901250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:35,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:35,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:35,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990585349] [2022-02-09 01:48:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:35,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:35,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:35,983 INFO L87 Difference]: Start difference. First operand 126340 states and 369711 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:37,526 INFO L93 Difference]: Finished difference Result 145369 states and 425966 transitions. [2022-02-09 01:48:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-02-09 01:48:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:38,018 INFO L225 Difference]: With dead ends: 145369 [2022-02-09 01:48:38,019 INFO L226 Difference]: Without dead ends: 145369 [2022-02-09 01:48:38,019 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-02-09 01:48:38,019 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 353 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:38,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 1120 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:48:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145369 states. [2022-02-09 01:48:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145369 to 136138. [2022-02-09 01:48:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136138 states, 135990 states have (on average 2.9314949628649165) internal successors, (398654), 136137 states have internal predecessors, (398654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136138 states to 136138 states and 398654 transitions. [2022-02-09 01:48:42,724 INFO L78 Accepts]: Start accepts. Automaton has 136138 states and 398654 transitions. Word has length 111 [2022-02-09 01:48:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:42,725 INFO L470 AbstractCegarLoop]: Abstraction has 136138 states and 398654 transitions. [2022-02-09 01:48:42,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 136138 states and 398654 transitions. [2022-02-09 01:48:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-09 01:48:42,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:42,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:42,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-09 01:48:42,748 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1487030232, now seen corresponding path program 1 times [2022-02-09 01:48:42,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:42,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137360693] [2022-02-09 01:48:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:42,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:42,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:42,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137360693] [2022-02-09 01:48:42,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137360693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:42,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:42,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:42,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254549511] [2022-02-09 01:48:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:42,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:42,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:42,965 INFO L87 Difference]: Start difference. First operand 136138 states and 398654 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:45,268 INFO L93 Difference]: Finished difference Result 174251 states and 510736 transitions. [2022-02-09 01:48:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-02-09 01:48:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:46,614 INFO L225 Difference]: With dead ends: 174251 [2022-02-09 01:48:46,614 INFO L226 Difference]: Without dead ends: 174251 [2022-02-09 01:48:46,615 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-02-09 01:48:46,615 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 262 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:46,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 993 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:48:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174251 states. [2022-02-09 01:48:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174251 to 140946. [2022-02-09 01:48:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140946 states, 140800 states have (on average 2.93171875) internal successors, (412786), 140945 states have internal predecessors, (412786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140946 states to 140946 states and 412786 transitions. [2022-02-09 01:48:51,098 INFO L78 Accepts]: Start accepts. Automaton has 140946 states and 412786 transitions. Word has length 113 [2022-02-09 01:48:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:51,099 INFO L470 AbstractCegarLoop]: Abstraction has 140946 states and 412786 transitions. [2022-02-09 01:48:51,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 140946 states and 412786 transitions. [2022-02-09 01:48:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-09 01:48:51,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:51,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:51,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-09 01:48:51,107 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1264784000, now seen corresponding path program 1 times [2022-02-09 01:48:51,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:51,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117925194] [2022-02-09 01:48:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:51,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:51,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:51,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117925194] [2022-02-09 01:48:51,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117925194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:51,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:51,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:51,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803479390] [2022-02-09 01:48:51,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:51,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:51,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:51,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:51,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:51,220 INFO L87 Difference]: Start difference. First operand 140946 states and 412786 transitions. Second operand has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:53,109 INFO L93 Difference]: Finished difference Result 147743 states and 430813 transitions. [2022-02-09 01:48:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-02-09 01:48:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:53,734 INFO L225 Difference]: With dead ends: 147743 [2022-02-09 01:48:53,735 INFO L226 Difference]: Without dead ends: 147743 [2022-02-09 01:48:53,735 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-02-09 01:48:53,735 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 328 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:53,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 705 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:48:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147743 states. [2022-02-09 01:48:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147743 to 145801. [2022-02-09 01:48:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145801 states, 145655 states have (on average 2.931962514160173) internal successors, (427055), 145800 states have internal predecessors, (427055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145801 states to 145801 states and 427055 transitions. [2022-02-09 01:48:57,959 INFO L78 Accepts]: Start accepts. Automaton has 145801 states and 427055 transitions. Word has length 117 [2022-02-09 01:48:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:57,960 INFO L470 AbstractCegarLoop]: Abstraction has 145801 states and 427055 transitions. [2022-02-09 01:48:57,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 145801 states and 427055 transitions. [2022-02-09 01:48:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-09 01:48:57,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:57,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:48:57,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-09 01:48:57,968 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash -912171791, now seen corresponding path program 1 times [2022-02-09 01:48:57,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:57,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317547171] [2022-02-09 01:48:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:57,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:58,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:58,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317547171] [2022-02-09 01:48:58,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317547171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:58,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:58,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:58,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855026259] [2022-02-09 01:48:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:58,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:58,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:58,072 INFO L87 Difference]: Start difference. First operand 145801 states and 427055 transitions. Second operand has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:00,224 INFO L93 Difference]: Finished difference Result 167205 states and 490268 transitions. [2022-02-09 01:49:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:49:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-02-09 01:49:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:00,859 INFO L225 Difference]: With dead ends: 167205 [2022-02-09 01:49:00,859 INFO L226 Difference]: Without dead ends: 167205 [2022-02-09 01:49:00,860 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-02-09 01:49:00,860 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 354 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:00,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1180 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-09 01:49:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167205 states. [2022-02-09 01:49:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167205 to 156852. [2022-02-09 01:49:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156852 states, 156709 states have (on average 2.9332010286582135) internal successors, (459659), 156851 states have internal predecessors, (459659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156852 states to 156852 states and 459659 transitions. [2022-02-09 01:49:05,976 INFO L78 Accepts]: Start accepts. Automaton has 156852 states and 459659 transitions. Word has length 117 [2022-02-09 01:49:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:05,977 INFO L470 AbstractCegarLoop]: Abstraction has 156852 states and 459659 transitions. [2022-02-09 01:49:05,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 156852 states and 459659 transitions. [2022-02-09 01:49:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-09 01:49:05,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:05,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:49:05,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-09 01:49:05,984 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 693171552, now seen corresponding path program 1 times [2022-02-09 01:49:05,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:05,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150653018] [2022-02-09 01:49:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:05,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:06,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:06,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150653018] [2022-02-09 01:49:06,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150653018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:06,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:06,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:49:06,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864443924] [2022-02-09 01:49:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:06,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:49:06,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:49:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:49:06,098 INFO L87 Difference]: Start difference. First operand 156852 states and 459659 transitions. Second operand has 6 states, 5 states have (on average 23.6) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:07,871 INFO L93 Difference]: Finished difference Result 174143 states and 510657 transitions. [2022-02-09 01:49:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:49:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.6) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-09 01:49:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:09,121 INFO L225 Difference]: With dead ends: 174143 [2022-02-09 01:49:09,122 INFO L226 Difference]: Without dead ends: 171983 [2022-02-09 01:49:09,123 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-02-09 01:49:09,123 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 352 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:09,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 941 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:49:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171983 states. [2022-02-09 01:49:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171983 to 164715. [2022-02-09 01:49:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164715 states, 164572 states have (on average 2.9324004083319157) internal successors, (482591), 164714 states have internal predecessors, (482591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164715 states to 164715 states and 482591 transitions. [2022-02-09 01:49:15,150 INFO L78 Accepts]: Start accepts. Automaton has 164715 states and 482591 transitions. Word has length 118 [2022-02-09 01:49:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:15,151 INFO L470 AbstractCegarLoop]: Abstraction has 164715 states and 482591 transitions. [2022-02-09 01:49:15,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.6) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 164715 states and 482591 transitions. [2022-02-09 01:49:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-09 01:49:15,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:15,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:49:15,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-09 01:49:15,159 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 919582511, now seen corresponding path program 1 times [2022-02-09 01:49:15,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:15,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160027728] [2022-02-09 01:49:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:15,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:49:15,238 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-09 01:49:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:49:15,325 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-09 01:49:15,325 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-09 01:49:15,326 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2022-02-09 01:49:15,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2022-02-09 01:49:15,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2022-02-09 01:49:15,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2022-02-09 01:49:15,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2022-02-09 01:49:15,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2022-02-09 01:49:15,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2022-02-09 01:49:15,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2022-02-09 01:49:15,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2022-02-09 01:49:15,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 27 remaining) [2022-02-09 01:49:15,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (11 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2022-02-09 01:49:15,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2022-02-09 01:49:15,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2022-02-09 01:49:15,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2022-02-09 01:49:15,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2022-02-09 01:49:15,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2022-02-09 01:49:15,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-09 01:49:15,335 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:49:15,340 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 01:49:15,340 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 01:49:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 01:49:15 BasicIcfg [2022-02-09 01:49:15,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 01:49:15,416 INFO L158 Benchmark]: Toolchain (without parser) took 105613.40ms. Allocated memory was 185.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 131.0MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-02-09 01:49:15,416 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 185.6MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 01:49:15,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1012.09ms. Allocated memory was 185.6MB in the beginning and 234.9MB in the end (delta: 49.3MB). Free memory was 130.9MB in the beginning and 168.0MB in the end (delta: -37.1MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-02-09 01:49:15,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.97ms. Allocated memory is still 234.9MB. Free memory was 168.0MB in the beginning and 163.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-09 01:49:15,416 INFO L158 Benchmark]: Boogie Preprocessor took 62.70ms. Allocated memory is still 234.9MB. Free memory was 163.9MB in the beginning and 160.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 01:49:15,417 INFO L158 Benchmark]: RCFGBuilder took 774.02ms. Allocated memory is still 234.9MB. Free memory was 159.7MB in the beginning and 131.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-02-09 01:49:15,417 INFO L158 Benchmark]: TraceAbstraction took 103694.87ms. Allocated memory was 234.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-02-09 01:49:15,418 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.18ms. Allocated memory is still 185.6MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1012.09ms. Allocated memory was 185.6MB in the beginning and 234.9MB in the end (delta: 49.3MB). Free memory was 130.9MB in the beginning and 168.0MB in the end (delta: -37.1MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.97ms. Allocated memory is still 234.9MB. Free memory was 168.0MB in the beginning and 163.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.70ms. Allocated memory is still 234.9MB. Free memory was 163.9MB in the beginning and 160.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 774.02ms. Allocated memory is still 234.9MB. Free memory was 159.7MB in the beginning and 131.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 103694.87ms. Allocated memory was 234.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1710]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1706] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={3:0}, t2={4:0}] [L1744] CALL, EXPR 0 my_drv_init() [L1738] 0 return 0; VAL [\result=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1744] RET, EXPR 0 my_drv_init() [L1744] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1745] COND TRUE 0 ret==0 VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1746] 0 int probe_ret; VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1747] 0 struct my_data data; VAL [data={5:0}, my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1748] CALL 0 my_drv_probe(&data) [L1716] 0 data->shared.a = 0 VAL [data={5:0}, data={5:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1717] 0 data->shared.b = 0 VAL [data={5:0}, data={5:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1718] EXPR 0 data->shared.a VAL [data={5:0}, data={5:0}, data->shared.a=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1718] EXPR 0 data->shared.a==0 VAL [data={5:0}, data={5:0}, data->shared.a=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1718] CALL 0 ldv_assert(data->shared.a==0) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1718] RET 0 ldv_assert(data->shared.a==0) [L1719] EXPR 0 data->shared.b VAL [data={5:0}, data={5:0}, data->shared.b=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1719] EXPR 0 data->shared.b==0 VAL [data={5:0}, data={5:0}, data->shared.b=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1719] CALL 0 ldv_assert(data->shared.b==0) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1719] RET 0 ldv_assert(data->shared.b==0) [L1720] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, data={5:0}, data={5:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1721] COND FALSE 0 !(\read(res)) VAL [data={5:0}, data={5:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1723] 0 my_dev = &data->dev VAL [data={5:0}, data={5:0}, my_dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1724] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={5:0}, data={5:0}, my_dev={5:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=6, res=0, t1={3:0}, t2={4:0}] [L1708] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1710] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1725] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, data->shared.a = 1=1161, my_dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=7, res=0, t1={3:0}, t2={4:0}] [L1708] 2 struct my_data *data; VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1161, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1161, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1161, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1710] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1155, my_dev={5:24}, t1={3:0}, t2={4:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [1709] * C: my_dev = &data->dev [1723] * C: data->shared.b = 0 [1717] * C: data->shared.a = 0 [1716] * C: data->shared.a = 0 [1716] * C: data->shared.a==0 [1718] * C: data->shared.a = 0 [1716] * C: data->shared.b==0 [1719] * C: data->shared.b = 0 [1717] * C: data->shared.b==0 [1719] * C: data->shared.a==0 [1718] * C: data->shared.a==0 [1718] * C: data->shared.b = 0 [1717] * C: data->shared.a==0 [1718] * C: data->shared.b = 0 [1717] * C: data->shared.a = 0 [1716] * C: data->shared.b==0 [1719] * C: data->shared.b==0 [1719] and C: data->shared.a = 1 [1710] - UnprovableResult [Line: 1716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1734]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 347 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 103.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3286 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3286 mSDsluCounter, 13682 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7304 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6789 IncrementalHoareTripleChecker+Invalid, 7177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 6498 mSDtfsCounter, 6789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164715occurred in iteration=16, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 62.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 70458 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1617 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1482 ConstructedInterpolants, 0 QuantifiedInterpolants, 2659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-09 01:49:15,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...