/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-MCRwithDepranks-Lazy-NoForkJoinOpt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-04 04:53:51,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-04 04:53:51,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-04 04:53:51,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-04 04:53:51,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-04 04:53:51,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-04 04:53:51,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-04 04:53:51,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-04 04:53:51,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-04 04:53:51,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-04 04:53:51,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-04 04:53:51,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-04 04:53:51,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-04 04:53:51,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-04 04:53:51,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-04 04:53:51,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-04 04:53:51,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-04 04:53:51,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-04 04:53:51,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-04 04:53:51,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-04 04:53:51,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-04 04:53:51,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-04 04:53:51,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-04 04:53:51,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-04 04:53:51,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-04 04:53:51,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-04 04:53:51,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-04 04:53:51,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-04 04:53:51,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-04 04:53:51,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-04 04:53:51,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-04 04:53:51,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-04 04:53:51,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-04 04:53:51,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-04 04:53:51,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-04 04:53:51,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-04 04:53:51,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-04 04:53:51,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-04 04:53:51,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-04 04:53:51,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-04 04:53:51,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-04 04:53:51,447 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-MCRwithDepranks-Lazy-NoForkJoinOpt.epf [2022-03-04 04:53:51,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-04 04:53:51,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-04 04:53:51,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-04 04:53:51,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-04 04:53:51,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-04 04:53:51,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-04 04:53:51,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Use SBE=true [2022-03-04 04:53:51,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-04 04:53:51,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-04 04:53:51,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-04 04:53:51,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-04 04:53:51,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-04 04:53:51,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-04 04:53:51,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-04 04:53:51,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-04 04:53:51,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-04 04:53:51,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-04 04:53:51,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-04 04:53:51,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-04 04:53:51,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-04 04:53:51,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-04 04:53:51,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-04 04:53:51,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-04 04:53:51,657 INFO L275 PluginConnector]: CDTParser initialized [2022-03-04 04:53:51,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i [2022-03-04 04:53:51,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d9fad6/e83dd7845c5a48d5adf87a6c11c8e7eb/FLAG173f020b7 [2022-03-04 04:53:52,101 INFO L306 CDTParser]: Found 1 translation units. [2022-03-04 04:53:52,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i [2022-03-04 04:53:52,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d9fad6/e83dd7845c5a48d5adf87a6c11c8e7eb/FLAG173f020b7 [2022-03-04 04:53:52,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286d9fad6/e83dd7845c5a48d5adf87a6c11c8e7eb [2022-03-04 04:53:52,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-04 04:53:52,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-04 04:53:52,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-04 04:53:52,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-04 04:53:52,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-04 04:53:52,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:52,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28209c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52, skipping insertion in model container [2022-03-04 04:53:52,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:52,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-04 04:53:52,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-04 04:53:52,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-04 04:53:52,910 INFO L203 MainTranslator]: Completed pre-run [2022-03-04 04:53:52,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-04 04:53:52,989 INFO L208 MainTranslator]: Completed translation [2022-03-04 04:53:52,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52 WrapperNode [2022-03-04 04:53:52,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-04 04:53:52,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-04 04:53:52,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-04 04:53:52,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-04 04:53:52,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,036 INFO L137 Inliner]: procedures = 368, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-03-04 04:53:53,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-04 04:53:53,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-04 04:53:53,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-04 04:53:53,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-04 04:53:53,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-04 04:53:53,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-04 04:53:53,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-04 04:53:53,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-04 04:53:53,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (1/1) ... [2022-03-04 04:53:53,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-04 04:53:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:53:53,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-04 04:53:53,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-04 04:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-04 04:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-04 04:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-04 04:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-04 04:53:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-04 04:53:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-04 04:53:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-04 04:53:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-04 04:53:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-04 04:53:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-04 04:53:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-04 04:53:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-04 04:53:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-04 04:53:53,132 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-04 04:53:53,235 INFO L234 CfgBuilder]: Building ICFG [2022-03-04 04:53:53,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-04 04:53:53,463 INFO L275 CfgBuilder]: Performing block encoding [2022-03-04 04:53:53,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-04 04:53:53,473 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-04 04:53:53,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:53 BoogieIcfgContainer [2022-03-04 04:53:53,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-04 04:53:53,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-04 04:53:53,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-04 04:53:53,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-04 04:53:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:53:52" (1/3) ... [2022-03-04 04:53:53,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:53, skipping insertion in model container [2022-03-04 04:53:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:53:52" (2/3) ... [2022-03-04 04:53:53,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59dba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:53, skipping insertion in model container [2022-03-04 04:53:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:53" (3/3) ... [2022-03-04 04:53:53,481 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2022-03-04 04:53:53,484 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-04 04:53:53,484 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-04 04:53:53,485 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-03-04 04:53:53,485 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-04 04:53:53,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,532 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,546 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:53:53,548 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-04 04:53:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-04 04:53:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:53:53,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-04 04:53:53,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-04 04:53:53,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-04 04:53:53,619 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=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=true [2022-03-04 04:53:53,621 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-03-04 04:53:53,658 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 41 transitions and produced 42 states. [2022-03-04 04:53:53,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2052627791, now seen corresponding path program 1 times [2022-03-04 04:53:53,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:53,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013116644] [2022-03-04 04:53:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:53,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:53,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013116644] [2022-03-04 04:53:53,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013116644] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:53,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:53,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:53,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514177817] [2022-03-04 04:53:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:53,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:53,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:53,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:53,991 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:53,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:53,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,035 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 50 transitions and produced 51 states. [2022-03-04 04:53:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-04 04:53:54,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash 320042173, now seen corresponding path program 1 times [2022-03-04 04:53:54,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475642474] [2022-03-04 04:53:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:54,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:54,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475642474] [2022-03-04 04:53:54,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475642474] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:54,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:54,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:54,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168710523] [2022-03-04 04:53:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:54,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:54,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:54,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,189 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:54,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:54,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,237 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 59 transitions and produced 60 states. [2022-03-04 04:53:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-04 04:53:54,239 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -170333930, now seen corresponding path program 1 times [2022-03-04 04:53:54,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145845349] [2022-03-04 04:53:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:54,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:54,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145845349] [2022-03-04 04:53:54,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145845349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:54,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:54,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-04 04:53:54,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659025315] [2022-03-04 04:53:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:54,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:53:54,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:53:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-04 04:53:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,348 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:54,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,440 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 95 transitions and produced 96 states. [2022-03-04 04:53:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-04 04:53:54,441 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2000222690, now seen corresponding path program 1 times [2022-03-04 04:53:54,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808099024] [2022-03-04 04:53:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:54,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:54,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808099024] [2022-03-04 04:53:54,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808099024] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:54,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:54,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-04 04:53:54,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832687452] [2022-03-04 04:53:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:54,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:53:54,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:53:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-04 04:53:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,530 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:54,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,561 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 116 transitions and produced 117 states. [2022-03-04 04:53:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-04 04:53:54,563 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1579953091, now seen corresponding path program 1 times [2022-03-04 04:53:54,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130945455] [2022-03-04 04:53:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:54,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:54,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130945455] [2022-03-04 04:53:54,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130945455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:54,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:54,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-04 04:53:54,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82785322] [2022-03-04 04:53:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:54,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:53:54,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:53:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-04 04:53:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,645 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:54,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:54,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,675 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 135 transitions and produced 136 states. [2022-03-04 04:53:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-04 04:53:54,677 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1742525625, now seen corresponding path program 1 times [2022-03-04 04:53:54,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377573897] [2022-03-04 04:53:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:54,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:54,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377573897] [2022-03-04 04:53:54,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377573897] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:54,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:54,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:54,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394192785] [2022-03-04 04:53:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:54,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:54,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,809 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:54,809 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-03-04 04:53:54,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:54,902 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 162 transitions and produced 163 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:54,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-04 04:53:54,904 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash -659221700, now seen corresponding path program 1 times [2022-03-04 04:53:54,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:54,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990526846] [2022-03-04 04:53:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:55,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:55,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990526846] [2022-03-04 04:53:55,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990526846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:55,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:55,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:55,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764152828] [2022-03-04 04:53:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:55,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:55,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,026 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:55,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.8) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:55,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,117 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 171 transitions and produced 172 states. [2022-03-04 04:53:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-04 04:53:55,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 840174017, now seen corresponding path program 1 times [2022-03-04 04:53:55,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:55,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726248158] [2022-03-04 04:53:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:55,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:55,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726248158] [2022-03-04 04:53:55,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726248158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:55,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:55,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:55,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132697580] [2022-03-04 04:53:55,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:55,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:55,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,245 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:55,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.4) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:55,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,311 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 180 transitions and produced 181 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-04 04:53:55,312 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1433665594, now seen corresponding path program 1 times [2022-03-04 04:53:55,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:55,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761773094] [2022-03-04 04:53:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:55,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:55,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761773094] [2022-03-04 04:53:55,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761773094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:55,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:55,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-04 04:53:55,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856442894] [2022-03-04 04:53:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:55,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:53:55,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:53:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-04 04:53:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,372 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:55,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.5) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:55,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,415 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 187 transitions and produced 188 states. [2022-03-04 04:53:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-04 04:53:55,416 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2136151530, now seen corresponding path program 1 times [2022-03-04 04:53:55,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:55,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385461352] [2022-03-04 04:53:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:55,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:55,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385461352] [2022-03-04 04:53:55,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385461352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:55,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:55,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:55,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497660474] [2022-03-04 04:53:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:55,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:55,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,517 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:55,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.2) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,635 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 195 transitions and produced 196 states. [2022-03-04 04:53:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-04 04:53:55,636 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 631364335, now seen corresponding path program 1 times [2022-03-04 04:53:55,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:55,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028189033] [2022-03-04 04:53:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:53:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:53:55,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:53:55,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028189033] [2022-03-04 04:53:55,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028189033] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:53:55,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:53:55,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:53:55,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392892007] [2022-03-04 04:53:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:53:55,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:53:55,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:53:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:53:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,737 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:55,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-04 04:53:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:55,845 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 812 transitions and produced 521 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:55,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-04 04:53:55,846 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-03-04 04:53:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:53:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1846914063, now seen corresponding path program 1 times [2022-03-04 04:53:55,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:53:55,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136329996] [2022-03-04 04:53:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:53:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:53:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-04 04:53:55,880 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-04 04:53:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-04 04:53:55,935 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-04 04:53:55,935 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-04 04:53:55,936 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2022-03-04 04:53:55,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2022-03-04 04:53:55,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2022-03-04 04:53:55,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2022-03-04 04:53:55,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-04 04:53:55,943 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-04 04:53:55,949 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-04 04:53:55,949 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-04 04:53:56,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:56 BasicIcfg [2022-03-04 04:53:56,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-04 04:53:56,016 INFO L158 Benchmark]: Toolchain (without parser) took 3536.90ms. Allocated memory was 190.8MB in the beginning and 256.9MB in the end (delta: 66.1MB). Free memory was 136.5MB in the beginning and 138.2MB in the end (delta: -1.7MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,018 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-04 04:53:56,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.41ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 136.9MB in the end (delta: -534.4kB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 190.8MB. Free memory was 136.9MB in the beginning and 133.8MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,020 INFO L158 Benchmark]: Boogie Preprocessor took 21.41ms. Allocated memory is still 190.8MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,020 INFO L158 Benchmark]: RCFGBuilder took 415.40ms. Allocated memory is still 190.8MB. Free memory was 131.7MB in the beginning and 112.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,020 INFO L158 Benchmark]: TraceAbstraction took 2540.80ms. Allocated memory was 190.8MB in the beginning and 256.9MB in the end (delta: 66.1MB). Free memory was 111.7MB in the beginning and 138.2MB in the end (delta: -26.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-03-04 04:53:56,021 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.41ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 136.9MB in the end (delta: -534.4kB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 190.8MB. Free memory was 136.9MB in the beginning and 133.8MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.41ms. Allocated memory is still 190.8MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.40ms. Allocated memory is still 190.8MB. Free memory was 131.7MB in the beginning and 112.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2540.80ms. Allocated memory was 190.8MB in the beginning and 256.9MB in the end (delta: 66.1MB). Free memory was 111.7MB in the beginning and 138.2MB in the end (delta: -26.5MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - 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: 1253]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1233] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1234] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1245] 0 pthread_t t1; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, t1={9:0}] [L1246] CALL, EXPR 0 new(3) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, x=3] [L1229] 0 p->datum = x VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1230] 0 p->next = ((void *)0) VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1231] 0 return p; VAL [\old(x)=3, \result={-2:0}, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1246] RET, EXPR 0 new(3) [L1246] 0 A = new(3) VAL [A={-2:0}, A = new(3)=57, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, new(3)={-2:0}, t1={9:0}] [L1247] CALL, EXPR 0 new(5) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, malloc(sizeof(struct s))={-3:0}, p={-3:0}, x=5] [L1229] 0 p->datum = x VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1230] 0 p->next = ((void *)0) VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1231] 0 return p; VAL [\old(x)=5, \result={-3:0}, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1247] RET, EXPR 0 new(5) [L1247] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B = new(5)=44, B_mutex={2:0}, new(5)={-3:0}, t1={9:0}] [L1248] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={9:0}] [L1249] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, t1={9:0}] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, t1={9:0}] [L1251] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1253] 0 *data = 42 VAL [*data = 42=52, A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1237] EXPR 1 A->datum VAL [A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] [L1253] 0 *data = 42 VAL [*data = 42=52, A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9: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: A->datum [1251] * C: B = new(5) [1247] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: A = new(3) [1246] * C: p->next = ((void *)0) [1230] * C: A->datum [1237] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: p->next = ((void *)0) [1230] * C: A->datum++ [1237] and C: *data = 42 [1253] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that 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: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 236 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-04 04:53:56,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-03-04 04:53:56,311 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...