/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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 03:22:48,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 03:22:48,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 03:22:48,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 03:22:48,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 03:22:48,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 03:22:48,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 03:22:48,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 03:22:48,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 03:22:48,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 03:22:48,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 03:22:48,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 03:22:48,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 03:22:48,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 03:22:48,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 03:22:48,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 03:22:48,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 03:22:48,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 03:22:48,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 03:22:48,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 03:22:48,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 03:22:48,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 03:22:48,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 03:22:48,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 03:22:48,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 03:22:48,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 03:22:48,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 03:22:48,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 03:22:48,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 03:22:48,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 03:22:48,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 03:22:48,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 03:22:48,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 03:22:48,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 03:22:48,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 03:22:48,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 03:22:48,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 03:22:48,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 03:22:48,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 03:22:48,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 03:22:48,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 03:22:48,731 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2022-02-19 03:22:48,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 03:22:48,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 03:22:48,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 03:22:48,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 03:22:48,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 03:22:48,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 03:22:48,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 03:22:48,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 03:22:48,770 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 03:22:48,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 03:22:48,771 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 03:22:48,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 03:22:48,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 03:22:48,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 03:22:48,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 03:22:48,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 03:22:48,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 03:22:48,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 03:22:48,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 03:22:48,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 03:22:48,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 03:22:48,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 03:22:48,775 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 03:22:48,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 03:22:48,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 03:22:48,776 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-19 03:22:48,776 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-19 03:22:48,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-19 03:22:48,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 03:22:49,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 03:22:49,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 03:22:49,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-19 03:22:49,025 INFO L275 PluginConnector]: CDTParser initialized [2022-02-19 03:22:49,026 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-02-19 03:22:49,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc6d71c9/54b831a0bae8437c990063b00d170115/FLAGe1172b6b4 [2022-02-19 03:22:49,584 INFO L306 CDTParser]: Found 1 translation units. [2022-02-19 03:22:49,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i [2022-02-19 03:22:49,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc6d71c9/54b831a0bae8437c990063b00d170115/FLAGe1172b6b4 [2022-02-19 03:22:49,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc6d71c9/54b831a0bae8437c990063b00d170115 [2022-02-19 03:22:49,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 03:22:49,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-19 03:22:49,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-19 03:22:49,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-19 03:22:49,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-19 03:22:49,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:22:49" (1/1) ... [2022-02-19 03:22:49,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1725d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:49, skipping insertion in model container [2022-02-19 03:22:49,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:22:49" (1/1) ... [2022-02-19 03:22:49,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-19 03:22:49,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-19 03:22:50,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 03:22:50,403 INFO L203 MainTranslator]: Completed pre-run [2022-02-19 03:22:50,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 03:22:50,511 INFO L208 MainTranslator]: Completed translation [2022-02-19 03:22:50,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50 WrapperNode [2022-02-19 03:22:50,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-19 03:22:50,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 03:22:50,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 03:22:50,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 03:22:50,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,560 INFO L137 Inliner]: procedures = 368, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-02-19 03:22:50,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 03:22:50,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 03:22:50,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 03:22:50,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 03:22:50,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 03:22:50,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 03:22:50,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 03:22:50,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 03:22:50,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (1/1) ... [2022-02-19 03:22:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 03:22:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:22:50,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-19 03:22:50,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-19 03:22:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-19 03:22:50,652 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-19 03:22:50,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-19 03:22:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-19 03:22:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 03:22:50,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 03:22:50,654 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 03:22:50,760 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 03:22:50,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 03:22:51,122 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 03:22:51,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 03:22:51,130 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-19 03:22:51,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:22:51 BoogieIcfgContainer [2022-02-19 03:22:51,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 03:22:51,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 03:22:51,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 03:22:51,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 03:22:51,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:22:49" (1/3) ... [2022-02-19 03:22:51,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:22:51, skipping insertion in model container [2022-02-19 03:22:51,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:50" (2/3) ... [2022-02-19 03:22:51,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770b288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:22:51, skipping insertion in model container [2022-02-19 03:22:51,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:22:51" (3/3) ... [2022-02-19 03:22:51,138 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2022-02-19 03:22:51,142 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 03:22:51,142 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 03:22:51,142 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-02-19 03:22:51,142 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 03:22:51,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,217 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,217 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,221 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,222 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,222 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,225 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,226 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,227 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,228 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,229 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,230 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,230 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,234 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,235 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,236 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,237 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,248 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:22:51,249 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-19 03:22:51,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 03:22:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:22:51,300 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-02-19 03:22:51,308 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-02-19 03:22:51,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-02-19 03:22:51,341 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=true, mMcrOverapproximateWrwc=true [2022-02-19 03:22:51,341 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-19 03:22:51,451 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1678385605, now seen corresponding path program 1 times [2022-02-19 03:22:51,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:51,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014315029] [2022-02-19 03:22:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:51,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:51,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014315029] [2022-02-19 03:22:51,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014315029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:51,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:51,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 03:22:51,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910501303] [2022-02-19 03:22:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:51,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:22:51,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:22:51,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:22:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:51,877 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:51,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 50.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:51,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:51,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 03:22:51,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1501407425, now seen corresponding path program 1 times [2022-02-19 03:22:51,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:51,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968948559] [2022-02-19 03:22:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:52,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:52,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968948559] [2022-02-19 03:22:52,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968948559] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:52,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:52,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-19 03:22:52,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258238873] [2022-02-19 03:22:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:52,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-19 03:22:52,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-19 03:22:52,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-19 03:22:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:52,265 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:52,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:52,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:52,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 03:22:53,520 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash -852845884, now seen corresponding path program 1 times [2022-02-19 03:22:53,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:53,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062436591] [2022-02-19 03:22:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:53,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:53,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062436591] [2022-02-19 03:22:53,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062436591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:53,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:53,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-19 03:22:53,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862708119] [2022-02-19 03:22:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:53,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-19 03:22:53,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-19 03:22:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-19 03:22:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:53,689 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:53,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:53,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:53,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-19 03:22:53,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1330568649, now seen corresponding path program 1 times [2022-02-19 03:22:53,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:53,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079384366] [2022-02-19 03:22:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:53,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:53,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079384366] [2022-02-19 03:22:53,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079384366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:53,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:53,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 03:22:53,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313457265] [2022-02-19 03:22:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:53,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:22:53,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:22:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:22:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:53,949 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:53,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 61.0) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:53,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:53,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:53,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:54,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-19 03:22:54,001 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1353328045, now seen corresponding path program 1 times [2022-02-19 03:22:54,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:54,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138706369] [2022-02-19 03:22:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:54,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:54,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138706369] [2022-02-19 03:22:54,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138706369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:54,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:54,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-19 03:22:54,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146567760] [2022-02-19 03:22:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:54,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-19 03:22:54,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-19 03:22:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-19 03:22:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:54,168 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:54,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:54,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:54,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:54,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:54,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:54,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-19 03:22:55,443 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1566935118, now seen corresponding path program 1 times [2022-02-19 03:22:55,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:55,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304724592] [2022-02-19 03:22:55,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:55,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:55,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304724592] [2022-02-19 03:22:55,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304724592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:55,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:55,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-19 03:22:55,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715948177] [2022-02-19 03:22:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:55,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-19 03:22:55,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-19 03:22:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-19 03:22:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:55,609 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:55,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:55,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:55,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-19 03:22:55,752 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash -828110487, now seen corresponding path program 1 times [2022-02-19 03:22:55,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:55,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833271306] [2022-02-19 03:22:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:56,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:56,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833271306] [2022-02-19 03:22:56,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833271306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:56,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:56,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-19 03:22:56,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052253610] [2022-02-19 03:22:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:56,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 03:22:56,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 03:22:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-19 03:22:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:56,093 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:56,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:56,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:56,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:56,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:56,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-19 03:22:56,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -208602405, now seen corresponding path program 2 times [2022-02-19 03:22:56,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:56,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665467347] [2022-02-19 03:22:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:57,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:57,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665467347] [2022-02-19 03:22:57,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665467347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:57,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:57,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-19 03:22:57,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626871726] [2022-02-19 03:22:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:57,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 03:22:57,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 03:22:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-02-19 03:22:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:57,130 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:57,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:57,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:57,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-19 03:22:57,789 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -971137495, now seen corresponding path program 3 times [2022-02-19 03:22:57,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:57,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410769630] [2022-02-19 03:22:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:58,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:58,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410769630] [2022-02-19 03:22:58,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410769630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:58,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:58,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-19 03:22:58,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509681000] [2022-02-19 03:22:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:58,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 03:22:58,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 03:22:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-02-19 03:22:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:58,086 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:58,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-19 03:22:58,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-19 03:22:58,809 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash 649514523, now seen corresponding path program 4 times [2022-02-19 03:22:58,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:58,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343881688] [2022-02-19 03:22:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:22:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:22:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:22:59,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:22:59,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343881688] [2022-02-19 03:22:59,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343881688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:22:59,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:22:59,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-19 03:22:59,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038089574] [2022-02-19 03:22:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:22:59,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 03:22:59,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:22:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 03:22:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-02-19 03:22:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:59,095 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:22:59,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.705882352941176) internal successors, (148), 18 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-02-19 03:22:59,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:22:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:22:59,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-19 03:22:59,964 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:22:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:22:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash 302836845, now seen corresponding path program 1 times [2022-02-19 03:22:59,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:22:59,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671047891] [2022-02-19 03:22:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:22:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:23:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:23:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:23:00,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:23:00,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671047891] [2022-02-19 03:23:00,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671047891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:23:00,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:23:00,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-19 03:23:00,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470258320] [2022-02-19 03:23:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:23:00,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 03:23:00,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:23:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 03:23:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-02-19 03:23:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:23:00,283 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:23:00,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.764705882352942) internal successors, (149), 18 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:23:00,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:00,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:00,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:00,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-19 03:23:03,252 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:23:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:23:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1692810245, now seen corresponding path program 1 times [2022-02-19 03:23:03,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:23:03,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125559768] [2022-02-19 03:23:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:23:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:23:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:23:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:23:03,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:23:03,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125559768] [2022-02-19 03:23:03,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125559768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:23:03,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:23:03,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:23:03,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944503012] [2022-02-19 03:23:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:23:03,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:23:03,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:23:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:23:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:23:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:23:03,329 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:23:03,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:03,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:23:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-19 03:23:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:23:12,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-19 03:23:12,320 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-02-19 03:23:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:23:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash 868237865, now seen corresponding path program 2 times [2022-02-19 03:23:12,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:23:12,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687026189] [2022-02-19 03:23:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:23:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:23:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-19 03:23:12,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-19 03:23:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-19 03:23:12,440 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-19 03:23:12,441 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-19 03:23:12,442 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-02-19 03:23:12,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-02-19 03:23:12,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-02-19 03:23:12,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-02-19 03:23:12,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-02-19 03:23:12,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-02-19 03:23:12,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-19 03:23:12,456 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-19 03:23:12,457 INFO L309 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-02-19 03:23:12,461 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 03:23:12,461 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 03:23:12,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 03:23:12 BasicIcfg [2022-02-19 03:23:12,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 03:23:12,551 INFO L158 Benchmark]: Toolchain (without parser) took 22665.39ms. Allocated memory was 178.3MB in the beginning and 256.9MB in the end (delta: 78.6MB). Free memory was 127.5MB in the beginning and 216.0MB in the end (delta: -88.5MB). Peak memory consumption was 105.5MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,552 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 178.3MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 03:23:12,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.19ms. Allocated memory is still 178.3MB. Free memory was 127.3MB in the beginning and 131.6MB in the end (delta: -4.2MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 178.3MB. Free memory was 131.6MB in the beginning and 128.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,552 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,553 INFO L158 Benchmark]: RCFGBuilder took 539.46ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 106.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,553 INFO L158 Benchmark]: TraceAbstraction took 21418.01ms. Allocated memory was 178.3MB in the beginning and 256.9MB in the end (delta: 78.6MB). Free memory was 106.0MB in the beginning and 216.0MB in the end (delta: -110.0MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. [2022-02-19 03:23:12,554 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.55ms. Allocated memory is still 178.3MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 620.19ms. Allocated memory is still 178.3MB. Free memory was 127.3MB in the beginning and 131.6MB in the end (delta: -4.2MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 178.3MB. Free memory was 131.6MB in the beginning and 128.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.46ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 106.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 21418.01ms. Allocated memory was 178.3MB in the beginning and 256.9MB in the end (delta: 78.6MB). Free memory was 106.0MB in the beginning and 216.0MB in the end (delta: -110.0MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2683, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 260, negative conditional: 132, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2585, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 162, negative conditional: 34, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2585, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 162, negative conditional: 34, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 914, positive unconditional: 1509, negative: 358, negative conditional: 196, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 639, positive unconditional: 1784, negative: 358, negative conditional: 118, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 639, positive unconditional: 1784, negative: 358, negative conditional: 118, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1793, positive: 1573, positive conditional: 94, positive unconditional: 1479, negative: 220, negative conditional: 89, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1793, positive: 1468, positive conditional: 0, positive unconditional: 1468, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 325, positive: 105, positive conditional: 94, positive unconditional: 11, negative: 210, negative conditional: 83, negative unconditional: 127, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13663, positive: 365, positive conditional: 322, positive unconditional: 43, negative: 528, negative conditional: 181, negative unconditional: 347, unknown: 12770, unknown conditional: 7070, unknown unconditional: 5700] ], Cache Queries: [ total: 2781, positive: 850, positive conditional: 545, positive unconditional: 305, negative: 138, negative conditional: 29, negative unconditional: 109, unknown: 1793, unknown conditional: 183, unknown unconditional: 1610] , Statistics on independence cache: Total cache size (in pairs): 1793, Positive cache size: 1573, Positive conditional cache size: 94, Positive unconditional cache size: 1479, Negative cache size: 220, Negative conditional cache size: 89, Negative unconditional cache size: 131, Eliminated conditions: 353, Maximal queried relation: 8, Independence queries for same thread: 98 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 6.2s, Number of persistent set computation: 425, Number of trivial persistent sets: 379, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1607, positive: 1479, positive conditional: 0, positive unconditional: 1479, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2683, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 260, negative conditional: 132, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2585, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 162, negative conditional: 34, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2585, positive: 2423, positive conditional: 944, positive unconditional: 1479, negative: 162, negative conditional: 34, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 914, positive unconditional: 1509, negative: 358, negative conditional: 196, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 639, positive unconditional: 1784, negative: 358, negative conditional: 118, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2781, positive: 2423, positive conditional: 639, positive unconditional: 1784, negative: 358, negative conditional: 118, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1793, positive: 1573, positive conditional: 94, positive unconditional: 1479, negative: 220, negative conditional: 89, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1793, positive: 1468, positive conditional: 0, positive unconditional: 1468, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 325, positive: 105, positive conditional: 94, positive unconditional: 11, negative: 210, negative conditional: 83, negative unconditional: 127, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13663, positive: 365, positive conditional: 322, positive unconditional: 43, negative: 528, negative conditional: 181, negative unconditional: 347, unknown: 12770, unknown conditional: 7070, unknown unconditional: 5700] ], Cache Queries: [ total: 2781, positive: 850, positive conditional: 545, positive unconditional: 305, negative: 138, negative conditional: 29, negative unconditional: 109, unknown: 1793, unknown conditional: 183, unknown unconditional: 1610] , Statistics on independence cache: Total cache size (in pairs): 1793, Positive cache size: 1573, Positive conditional cache size: 94, Positive unconditional cache size: 1479, Negative cache size: 220, Negative conditional cache size: 89, Negative unconditional cache size: 131, Eliminated conditions: 353, Maximal queried relation: 8, Independence queries for same thread: 98 - 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: 1237]: 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)=61, 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}, 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}, 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}, 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=3, 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=3, A->datum++=57, A->datum++=3, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] [L1253] 0 *data = 42 VAL [*data = 42=58, A={-2:0}, A->datum=3, A->datum++=57, A->datum++=3, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A->datum=3, A->datum++=57, A->datum++=3, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2: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++ [1237] * C: A = new(3) [1246] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: A->datum [1251] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: A->datum++ [1237] * C: p->next = ((void *)0) [1230] * C: A->datum++ [1237] * C: A->datum [1237] * C: p->next = ((void *)0) [1230] * C: B = new(5) [1247] * C: A->datum++ [1237] * C: *data = 42 [1253] and C: A->datum++ [1237] - 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 for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 236 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 17.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 148, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1561 ConstructedInterpolants, 0 QuantifiedInterpolants, 5384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-19 03:23:12,690 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-02-19 03:23:12,883 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...