/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-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-aed12abd52951161f3584c1e4a16827ff4d06934-aed12ab [2021-10-14 12:09:52,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-14 12:09:52,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-14 12:09:52,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-14 12:09:52,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-14 12:09:52,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-14 12:09:52,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-14 12:09:52,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-14 12:09:52,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-14 12:09:52,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-14 12:09:52,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-14 12:09:52,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-14 12:09:52,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-14 12:09:52,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-14 12:09:52,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-14 12:09:52,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-14 12:09:52,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-14 12:09:52,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-14 12:09:52,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-14 12:09:52,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-14 12:09:52,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-14 12:09:52,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-14 12:09:52,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-14 12:09:52,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-14 12:09:52,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-14 12:09:52,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-14 12:09:52,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-14 12:09:52,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-14 12:09:52,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-14 12:09:52,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-14 12:09:52,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-14 12:09:52,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-14 12:09:52,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-14 12:09:52,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-14 12:09:52,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-14 12:09:52,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-14 12:09:52,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-14 12:09:52,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-14 12:09:52,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-14 12:09:52,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-14 12:09:52,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-14 12:09:52,569 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-PN-NoLbe.epf [2021-10-14 12:09:52,587 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-14 12:09:52,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-14 12:09:52,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-14 12:09:52,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-14 12:09:52,588 INFO L138 SettingsManager]: * Use SBE=true [2021-10-14 12:09:52,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-14 12:09:52,588 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-14 12:09:52,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-14 12:09:52,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-14 12:09:52,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-14 12:09:52,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-14 12:09:52,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 12:09:52,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-14 12:09:52,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-14 12:09:52,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-14 12:09:52,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-14 12:09:52,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-14 12:09:52,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-14 12:09:52,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-14 12:09:52,592 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 [2021-10-14 12:09:52,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-14 12:09:52,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-14 12:09:52,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-14 12:09:52,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-14 12:09:52,781 INFO L275 PluginConnector]: CDTParser initialized [2021-10-14 12:09:52,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2021-10-14 12:09:52,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b50cc91/fc676654691e4a3982c72579a76f4e70/FLAGf2aa771de [2021-10-14 12:09:53,300 INFO L306 CDTParser]: Found 1 translation units. [2021-10-14 12:09:53,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2021-10-14 12:09:53,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b50cc91/fc676654691e4a3982c72579a76f4e70/FLAGf2aa771de [2021-10-14 12:09:53,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b50cc91/fc676654691e4a3982c72579a76f4e70 [2021-10-14 12:09:53,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-14 12:09:53,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-14 12:09:53,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-14 12:09:53,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-14 12:09:53,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-14 12:09:53,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:09:53" (1/1) ... [2021-10-14 12:09:53,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7acbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:53, skipping insertion in model container [2021-10-14 12:09:53,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:09:53" (1/1) ... [2021-10-14 12:09:53,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-14 12:09:53,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-14 12:09:54,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 12:09:54,246 INFO L203 MainTranslator]: Completed pre-run [2021-10-14 12:09:54,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 12:09:54,354 INFO L208 MainTranslator]: Completed translation [2021-10-14 12:09:54,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54 WrapperNode [2021-10-14 12:09:54,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-14 12:09:54,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-14 12:09:54,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-14 12:09:54,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-14 12:09:54,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-14 12:09:54,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-14 12:09:54,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-14 12:09:54,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-14 12:09:54,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-14 12:09:54,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-14 12:09:54,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-14 12:09:54,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-14 12:09:54,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (1/1) ... [2021-10-14 12:09:54,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 12:09:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-14 12:09:54,524 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) [2021-10-14 12:09:54,541 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 [2021-10-14 12:09:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-14 12:09:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-14 12:09:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-14 12:09:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-14 12:09:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-14 12:09:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-14 12:09:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-14 12:09:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-14 12:09:54,576 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-14 12:09:55,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-14 12:09:55,124 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-14 12:09:55,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:09:55 BoogieIcfgContainer [2021-10-14 12:09:55,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-14 12:09:55,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-14 12:09:55,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-14 12:09:55,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-14 12:09:55,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:09:53" (1/3) ... [2021-10-14 12:09:55,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133b6c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:09:55, skipping insertion in model container [2021-10-14 12:09:55,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:09:54" (2/3) ... [2021-10-14 12:09:55,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133b6c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:09:55, skipping insertion in model container [2021-10-14 12:09:55,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:09:55" (3/3) ... [2021-10-14 12:09:55,134 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2021-10-14 12:09:55,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-14 12:09:55,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2021-10-14 12:09:55,138 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-14 12:09:55,170 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,171 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,172 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,173 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,174 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,175 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,176 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,177 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,178 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,179 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,180 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,181 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,182 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,183 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,183 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,183 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,183 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,185 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,186 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,187 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,188 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,193 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,193 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,193 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,201 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,202 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,203 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,203 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,205 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,205 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,205 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,205 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,206 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,207 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,207 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,207 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,209 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 12:09:55,214 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-14 12:09:55,249 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-14 12:09:55,255 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=false, mConcurrency=PETRI_NET, 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 [2021-10-14 12:09:55,255 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2021-10-14 12:09:55,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 278 places, 274 transitions, 553 flow [2021-10-14 12:09:55,363 INFO L129 PetriNetUnfolder]: 0/273 cut-off events. [2021-10-14 12:09:55,363 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:55,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 273 events. 0/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 124 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-10-14 12:09:55,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 274 transitions, 553 flow [2021-10-14 12:09:55,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 262 transitions, 527 flow [2021-10-14 12:09:55,375 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-10-14 12:09:55,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:55,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:55,376 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:55,376 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1064028689, now seen corresponding path program 1 times [2021-10-14 12:09:55,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:55,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474858319] [2021-10-14 12:09:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:55,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:55,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:55,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474858319] [2021-10-14 12:09:55,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474858319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:55,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:55,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:55,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808547995] [2021-10-14 12:09:55,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:55,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:55,654 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 274 [2021-10-14 12:09:55,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:55,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:55,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 274 [2021-10-14 12:09:55,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:56,086 INFO L129 PetriNetUnfolder]: 432/1726 cut-off events. [2021-10-14 12:09:56,087 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:56,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 1726 events. 432/1726 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9977 event pairs, 432 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2487. Up to 956 conditions per place. [2021-10-14 12:09:56,103 INFO L132 encePairwiseOnDemand]: 256/274 looper letters, 91 selfloop transitions, 15 changer transitions 0/259 dead transitions. [2021-10-14 12:09:56,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 259 transitions, 733 flow [2021-10-14 12:09:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1093 transitions. [2021-10-14 12:09:56,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6648418491484185 [2021-10-14 12:09:56,120 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1093 transitions. [2021-10-14 12:09:56,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1093 transitions. [2021-10-14 12:09:56,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:56,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1093 transitions. [2021-10-14 12:09:56,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,141 INFO L186 Difference]: Start difference. First operand has 266 places, 262 transitions, 527 flow. Second operand 6 states and 1093 transitions. [2021-10-14 12:09:56,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 259 transitions, 733 flow [2021-10-14 12:09:56,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 259 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-14 12:09:56,153 INFO L242 Difference]: Finished difference. Result has 267 places, 259 transitions, 550 flow [2021-10-14 12:09:56,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=267, PETRI_TRANSITIONS=259} [2021-10-14 12:09:56,155 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, 1 predicate places. [2021-10-14 12:09:56,156 INFO L470 AbstractCegarLoop]: Abstraction has has 267 places, 259 transitions, 550 flow [2021-10-14 12:09:56,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,157 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:56,157 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:56,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-14 12:09:56,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1698070239, now seen corresponding path program 1 times [2021-10-14 12:09:56,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:56,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63201322] [2021-10-14 12:09:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:56,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:56,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:56,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63201322] [2021-10-14 12:09:56,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63201322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:56,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:56,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:56,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251687081] [2021-10-14 12:09:56,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:56,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:56,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:56,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 274 [2021-10-14 12:09:56,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 259 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:56,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 274 [2021-10-14 12:09:56,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:56,644 INFO L129 PetriNetUnfolder]: 432/1723 cut-off events. [2021-10-14 12:09:56,645 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-14 12:09:56,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1723 events. 432/1723 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10026 event pairs, 432 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2528. Up to 953 conditions per place. [2021-10-14 12:09:56,652 INFO L132 encePairwiseOnDemand]: 256/274 looper letters, 88 selfloop transitions, 15 changer transitions 0/256 dead transitions. [2021-10-14 12:09:56,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 256 transitions, 750 flow [2021-10-14 12:09:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2021-10-14 12:09:56,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6630170316301703 [2021-10-14 12:09:56,655 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1090 transitions. [2021-10-14 12:09:56,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1090 transitions. [2021-10-14 12:09:56,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:56,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1090 transitions. [2021-10-14 12:09:56,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.66666666666666) internal successors, (1090), 6 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,660 INFO L186 Difference]: Start difference. First operand has 267 places, 259 transitions, 550 flow. Second operand 6 states and 1090 transitions. [2021-10-14 12:09:56,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 256 transitions, 750 flow [2021-10-14 12:09:56,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 256 transitions, 720 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-10-14 12:09:56,669 INFO L242 Difference]: Finished difference. Result has 264 places, 256 transitions, 544 flow [2021-10-14 12:09:56,669 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=264, PETRI_TRANSITIONS=256} [2021-10-14 12:09:56,670 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -2 predicate places. [2021-10-14 12:09:56,670 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 256 transitions, 544 flow [2021-10-14 12:09:56,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,671 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:56,671 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:56,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-14 12:09:56,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash -713295493, now seen corresponding path program 1 times [2021-10-14 12:09:56,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:56,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472405354] [2021-10-14 12:09:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:56,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:56,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:56,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472405354] [2021-10-14 12:09:56,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472405354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:56,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:56,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-14 12:09:56,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218307606] [2021-10-14 12:09:56,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 12:09:56,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 12:09:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 12:09:56,739 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 274 [2021-10-14 12:09:56,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 256 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:56,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 274 [2021-10-14 12:09:56,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:56,788 INFO L129 PetriNetUnfolder]: 1/310 cut-off events. [2021-10-14 12:09:56,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:56,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 310 events. 1/310 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 320 event pairs, 1 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 191. Up to 10 conditions per place. [2021-10-14 12:09:56,789 INFO L132 encePairwiseOnDemand]: 271/274 looper letters, 7 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2021-10-14 12:09:56,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 255 transitions, 560 flow [2021-10-14 12:09:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 12:09:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-14 12:09:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2021-10-14 12:09:56,791 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.975669099756691 [2021-10-14 12:09:56,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2021-10-14 12:09:56,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2021-10-14 12:09:56,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:56,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2021-10-14 12:09:56,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,795 INFO L186 Difference]: Start difference. First operand has 264 places, 256 transitions, 544 flow. Second operand 3 states and 802 transitions. [2021-10-14 12:09:56,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 255 transitions, 560 flow [2021-10-14 12:09:56,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 255 transitions, 530 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-10-14 12:09:56,799 INFO L242 Difference]: Finished difference. Result has 260 places, 255 transitions, 516 flow [2021-10-14 12:09:56,799 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=260, PETRI_TRANSITIONS=255} [2021-10-14 12:09:56,799 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -6 predicate places. [2021-10-14 12:09:56,799 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 255 transitions, 516 flow [2021-10-14 12:09:56,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,800 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:56,800 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:56,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-14 12:09:56,800 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 505389812, now seen corresponding path program 1 times [2021-10-14 12:09:56,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:56,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265773484] [2021-10-14 12:09:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:56,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:56,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:56,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265773484] [2021-10-14 12:09:56,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265773484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:56,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:56,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:56,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661365648] [2021-10-14 12:09:56,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:56,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:56,916 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 274 [2021-10-14 12:09:56,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 255 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 178.16666666666666) internal successors, (1069), 6 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:56,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:56,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 274 [2021-10-14 12:09:56,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:57,320 INFO L129 PetriNetUnfolder]: 476/1866 cut-off events. [2021-10-14 12:09:57,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:57,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1866 events. 476/1866 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11083 event pairs, 476 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2840. Up to 1041 conditions per place. [2021-10-14 12:09:57,327 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 88 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2021-10-14 12:09:57,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 254 transitions, 700 flow [2021-10-14 12:09:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1132 transitions. [2021-10-14 12:09:57,330 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6885644768856448 [2021-10-14 12:09:57,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1132 transitions. [2021-10-14 12:09:57,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1132 transitions. [2021-10-14 12:09:57,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:57,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1132 transitions. [2021-10-14 12:09:57,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,335 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,336 INFO L186 Difference]: Start difference. First operand has 260 places, 255 transitions, 516 flow. Second operand 6 states and 1132 transitions. [2021-10-14 12:09:57,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 254 transitions, 700 flow [2021-10-14 12:09:57,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 254 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-14 12:09:57,340 INFO L242 Difference]: Finished difference. Result has 262 places, 254 transitions, 520 flow [2021-10-14 12:09:57,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=262, PETRI_TRANSITIONS=254} [2021-10-14 12:09:57,340 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -4 predicate places. [2021-10-14 12:09:57,340 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 254 transitions, 520 flow [2021-10-14 12:09:57,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.16666666666666) internal successors, (1069), 6 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:57,341 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:57,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-14 12:09:57,341 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1359116631, now seen corresponding path program 1 times [2021-10-14 12:09:57,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:57,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414426574] [2021-10-14 12:09:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:57,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:57,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:57,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414426574] [2021-10-14 12:09:57,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414426574] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:57,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:57,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-14 12:09:57,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746947111] [2021-10-14 12:09:57,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 12:09:57,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 12:09:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 12:09:57,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 274 [2021-10-14 12:09:57,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 254 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:57,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 274 [2021-10-14 12:09:57,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:57,409 INFO L129 PetriNetUnfolder]: 1/280 cut-off events. [2021-10-14 12:09:57,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:57,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 280 events. 1/280 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 157 event pairs, 1 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 198. Up to 10 conditions per place. [2021-10-14 12:09:57,411 INFO L132 encePairwiseOnDemand]: 271/274 looper letters, 7 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2021-10-14 12:09:57,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 253 transitions, 536 flow [2021-10-14 12:09:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 12:09:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-14 12:09:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2021-10-14 12:09:57,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.975669099756691 [2021-10-14 12:09:57,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2021-10-14 12:09:57,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2021-10-14 12:09:57,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:57,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2021-10-14 12:09:57,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,415 INFO L186 Difference]: Start difference. First operand has 262 places, 254 transitions, 520 flow. Second operand 3 states and 802 transitions. [2021-10-14 12:09:57,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 253 transitions, 536 flow [2021-10-14 12:09:57,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 253 transitions, 526 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-10-14 12:09:57,419 INFO L242 Difference]: Finished difference. Result has 258 places, 253 transitions, 512 flow [2021-10-14 12:09:57,419 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2021-10-14 12:09:57,420 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -8 predicate places. [2021-10-14 12:09:57,420 INFO L470 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 512 flow [2021-10-14 12:09:57,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,420 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:57,420 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:57,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-14 12:09:57,421 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash -929590632, now seen corresponding path program 1 times [2021-10-14 12:09:57,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:57,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274805257] [2021-10-14 12:09:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:57,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:57,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:57,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274805257] [2021-10-14 12:09:57,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274805257] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:57,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:57,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:57,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631477769] [2021-10-14 12:09:57,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:57,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:57,532 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 274 [2021-10-14 12:09:57,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:57,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 274 [2021-10-14 12:09:57,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:57,873 INFO L129 PetriNetUnfolder]: 476/1821 cut-off events. [2021-10-14 12:09:57,873 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-14 12:09:57,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 1821 events. 476/1821 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10807 event pairs, 476 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 2738. Up to 1040 conditions per place. [2021-10-14 12:09:57,878 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 87 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2021-10-14 12:09:57,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 252 transitions, 694 flow [2021-10-14 12:09:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2021-10-14 12:09:57,881 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6879562043795621 [2021-10-14 12:09:57,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2021-10-14 12:09:57,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2021-10-14 12:09:57,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:57,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2021-10-14 12:09:57,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,887 INFO L186 Difference]: Start difference. First operand has 258 places, 253 transitions, 512 flow. Second operand 6 states and 1131 transitions. [2021-10-14 12:09:57,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 252 transitions, 694 flow [2021-10-14 12:09:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 252 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-14 12:09:57,891 INFO L242 Difference]: Finished difference. Result has 260 places, 252 transitions, 516 flow [2021-10-14 12:09:57,892 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=260, PETRI_TRANSITIONS=252} [2021-10-14 12:09:57,892 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -6 predicate places. [2021-10-14 12:09:57,892 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 252 transitions, 516 flow [2021-10-14 12:09:57,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,892 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:57,892 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:57,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-14 12:09:57,893 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1145660403, now seen corresponding path program 1 times [2021-10-14 12:09:57,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:57,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513637601] [2021-10-14 12:09:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:57,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:57,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:57,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513637601] [2021-10-14 12:09:57,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513637601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:57,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:57,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:57,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549314358] [2021-10-14 12:09:57,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:57,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:57,991 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 274 [2021-10-14 12:09:57,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 252 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:57,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:57,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 274 [2021-10-14 12:09:57,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:58,478 INFO L129 PetriNetUnfolder]: 602/2210 cut-off events. [2021-10-14 12:09:58,478 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-10-14 12:09:58,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 2210 events. 602/2210 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13913 event pairs, 432 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 3336. Up to 1199 conditions per place. [2021-10-14 12:09:58,486 INFO L132 encePairwiseOnDemand]: 251/274 looper letters, 89 selfloop transitions, 70 changer transitions 0/321 dead transitions. [2021-10-14 12:09:58,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 321 transitions, 972 flow [2021-10-14 12:09:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2021-10-14 12:09:58,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7360097323600974 [2021-10-14 12:09:58,489 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2021-10-14 12:09:58,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2021-10-14 12:09:58,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:58,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2021-10-14 12:09:58,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,494 INFO L186 Difference]: Start difference. First operand has 260 places, 252 transitions, 516 flow. Second operand 6 states and 1210 transitions. [2021-10-14 12:09:58,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 321 transitions, 972 flow [2021-10-14 12:09:58,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 321 transitions, 962 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-10-14 12:09:58,499 INFO L242 Difference]: Finished difference. Result has 265 places, 321 transitions, 968 flow [2021-10-14 12:09:58,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=265, PETRI_TRANSITIONS=321} [2021-10-14 12:09:58,500 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, -1 predicate places. [2021-10-14 12:09:58,500 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 321 transitions, 968 flow [2021-10-14 12:09:58,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:58,501 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:58,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-14 12:09:58,502 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -276324755, now seen corresponding path program 1 times [2021-10-14 12:09:58,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:58,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856581430] [2021-10-14 12:09:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:58,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:58,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:58,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856581430] [2021-10-14 12:09:58,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856581430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:58,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:58,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-14 12:09:58,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062387391] [2021-10-14 12:09:58,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 12:09:58,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 12:09:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 12:09:58,586 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 274 [2021-10-14 12:09:58,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 321 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:58,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 274 [2021-10-14 12:09:58,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:58,677 INFO L129 PetriNetUnfolder]: 92/784 cut-off events. [2021-10-14 12:09:58,677 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2021-10-14 12:09:58,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 784 events. 92/784 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3185 event pairs, 14 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 1030. Up to 136 conditions per place. [2021-10-14 12:09:58,681 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 12 selfloop transitions, 5 changer transitions 0/293 dead transitions. [2021-10-14 12:09:58,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 293 transitions, 818 flow [2021-10-14 12:09:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 12:09:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-14 12:09:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2021-10-14 12:09:58,683 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9720194647201946 [2021-10-14 12:09:58,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2021-10-14 12:09:58,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2021-10-14 12:09:58,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:58,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2021-10-14 12:09:58,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,686 INFO L186 Difference]: Start difference. First operand has 265 places, 321 transitions, 968 flow. Second operand 3 states and 799 transitions. [2021-10-14 12:09:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 293 transitions, 818 flow [2021-10-14 12:09:58,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 293 transitions, 802 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-10-14 12:09:58,695 INFO L242 Difference]: Finished difference. Result has 268 places, 291 transitions, 783 flow [2021-10-14 12:09:58,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=268, PETRI_TRANSITIONS=291} [2021-10-14 12:09:58,696 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, 2 predicate places. [2021-10-14 12:09:58,696 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 291 transitions, 783 flow [2021-10-14 12:09:58,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,697 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:58,697 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:58,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-14 12:09:58,697 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash 144389636, now seen corresponding path program 1 times [2021-10-14 12:09:58,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:58,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789404324] [2021-10-14 12:09:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:58,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:58,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:58,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789404324] [2021-10-14 12:09:58,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789404324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:58,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:58,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 12:09:58,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604342860] [2021-10-14 12:09:58,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 12:09:58,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 12:09:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 12:09:58,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 274 [2021-10-14 12:09:58,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 291 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:58,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:58,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 274 [2021-10-14 12:09:58,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:09:59,273 INFO L129 PetriNetUnfolder]: 479/1771 cut-off events. [2021-10-14 12:09:59,273 INFO L130 PetriNetUnfolder]: For 232/252 co-relation queries the response was YES. [2021-10-14 12:09:59,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1771 events. 479/1771 cut-off events. For 232/252 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10206 event pairs, 273 based on Foata normal form. 19/1773 useless extension candidates. Maximal degree in co-relation 3306. Up to 1026 conditions per place. [2021-10-14 12:09:59,281 INFO L132 encePairwiseOnDemand]: 253/274 looper letters, 123 selfloop transitions, 68 changer transitions 1/358 dead transitions. [2021-10-14 12:09:59,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 358 transitions, 1363 flow [2021-10-14 12:09:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 12:09:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-14 12:09:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2021-10-14 12:09:59,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7335766423357665 [2021-10-14 12:09:59,308 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1206 transitions. [2021-10-14 12:09:59,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1206 transitions. [2021-10-14 12:09:59,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:09:59,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1206 transitions. [2021-10-14 12:09:59,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:59,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:59,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:59,313 INFO L186 Difference]: Start difference. First operand has 268 places, 291 transitions, 783 flow. Second operand 6 states and 1206 transitions. [2021-10-14 12:09:59,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 358 transitions, 1363 flow [2021-10-14 12:09:59,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 358 transitions, 1358 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-14 12:09:59,319 INFO L242 Difference]: Finished difference. Result has 276 places, 357 transitions, 1219 flow [2021-10-14 12:09:59,319 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1219, PETRI_PLACES=276, PETRI_TRANSITIONS=357} [2021-10-14 12:09:59,319 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, 10 predicate places. [2021-10-14 12:09:59,319 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 357 transitions, 1219 flow [2021-10-14 12:09:59,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:59,320 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:09:59,320 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:09:59,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-14 12:09:59,320 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:09:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:09:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash -569654686, now seen corresponding path program 1 times [2021-10-14 12:09:59,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:09:59,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602043633] [2021-10-14 12:09:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:09:59,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:09:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:09:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:09:59,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:09:59,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602043633] [2021-10-14 12:09:59,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602043633] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:09:59,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:09:59,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 12:09:59,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973588722] [2021-10-14 12:09:59,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 12:09:59,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:09:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 12:09:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-10-14 12:09:59,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2021-10-14 12:09:59,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 357 transitions, 1219 flow. Second operand has 22 states, 22 states have (on average 131.95454545454547) internal successors, (2903), 22 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:09:59,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:09:59,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2021-10-14 12:09:59,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:10:01,219 INFO L129 PetriNetUnfolder]: 895/2984 cut-off events. [2021-10-14 12:10:01,219 INFO L130 PetriNetUnfolder]: For 966/966 co-relation queries the response was YES. [2021-10-14 12:10:01,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 2984 events. 895/2984 cut-off events. For 966/966 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 20009 event pairs, 72 based on Foata normal form. 6/2979 useless extension candidates. Maximal degree in co-relation 6566. Up to 789 conditions per place. [2021-10-14 12:10:01,235 INFO L132 encePairwiseOnDemand]: 242/274 looper letters, 322 selfloop transitions, 70 changer transitions 60/567 dead transitions. [2021-10-14 12:10:01,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 567 transitions, 2943 flow [2021-10-14 12:10:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 12:10:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-14 12:10:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5165 transitions. [2021-10-14 12:10:01,245 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.496062235881675 [2021-10-14 12:10:01,245 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5165 transitions. [2021-10-14 12:10:01,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5165 transitions. [2021-10-14 12:10:01,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:10:01,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5165 transitions. [2021-10-14 12:10:01,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 135.92105263157896) internal successors, (5165), 38 states have internal predecessors, (5165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:01,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:01,277 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:01,278 INFO L186 Difference]: Start difference. First operand has 276 places, 357 transitions, 1219 flow. Second operand 38 states and 5165 transitions. [2021-10-14 12:10:01,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 567 transitions, 2943 flow [2021-10-14 12:10:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 567 transitions, 2847 flow, removed 48 selfloop flow, removed 0 redundant places. [2021-10-14 12:10:01,290 INFO L242 Difference]: Finished difference. Result has 328 places, 389 transitions, 1559 flow [2021-10-14 12:10:01,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1559, PETRI_PLACES=328, PETRI_TRANSITIONS=389} [2021-10-14 12:10:01,290 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, 62 predicate places. [2021-10-14 12:10:01,291 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 389 transitions, 1559 flow [2021-10-14 12:10:01,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 131.95454545454547) internal successors, (2903), 22 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:01,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:10:01,292 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:10:01,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-14 12:10:01,292 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:10:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:10:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1628257678, now seen corresponding path program 1 times [2021-10-14 12:10:01,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:10:01,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521211427] [2021-10-14 12:10:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:10:01,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:10:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 12:10:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-14 12:10:01,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 12:10:01,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521211427] [2021-10-14 12:10:01,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521211427] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 12:10:01,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 12:10:01,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-14 12:10:01,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667751451] [2021-10-14 12:10:01,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-14 12:10:01,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 12:10:01,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-14 12:10:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-10-14 12:10:01,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2021-10-14 12:10:01,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 389 transitions, 1559 flow. Second operand has 22 states, 22 states have (on average 131.1818181818182) internal successors, (2886), 22 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:01,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-14 12:10:01,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2021-10-14 12:10:01,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-14 12:10:04,116 INFO L129 PetriNetUnfolder]: 842/2754 cut-off events. [2021-10-14 12:10:04,116 INFO L130 PetriNetUnfolder]: For 2159/2160 co-relation queries the response was YES. [2021-10-14 12:10:04,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 2754 events. 842/2754 cut-off events. For 2159/2160 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17639 event pairs, 114 based on Foata normal form. 7/2751 useless extension candidates. Maximal degree in co-relation 7096. Up to 573 conditions per place. [2021-10-14 12:10:04,132 INFO L132 encePairwiseOnDemand]: 236/274 looper letters, 340 selfloop transitions, 106 changer transitions 31/594 dead transitions. [2021-10-14 12:10:04,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 594 transitions, 3423 flow [2021-10-14 12:10:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-14 12:10:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-10-14 12:10:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5807 transitions. [2021-10-14 12:10:04,142 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4928704803938211 [2021-10-14 12:10:04,142 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 5807 transitions. [2021-10-14 12:10:04,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 5807 transitions. [2021-10-14 12:10:04,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-14 12:10:04,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 5807 transitions. [2021-10-14 12:10:04,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 135.04651162790697) internal successors, (5807), 43 states have internal predecessors, (5807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:04,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 274.0) internal successors, (12056), 44 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:04,166 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 274.0) internal successors, (12056), 44 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:04,166 INFO L186 Difference]: Start difference. First operand has 328 places, 389 transitions, 1559 flow. Second operand 43 states and 5807 transitions. [2021-10-14 12:10:04,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 594 transitions, 3423 flow [2021-10-14 12:10:04,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 594 transitions, 3387 flow, removed 4 selfloop flow, removed 11 redundant places. [2021-10-14 12:10:04,190 INFO L242 Difference]: Finished difference. Result has 359 places, 414 transitions, 1967 flow [2021-10-14 12:10:04,191 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1967, PETRI_PLACES=359, PETRI_TRANSITIONS=414} [2021-10-14 12:10:04,191 INFO L334 CegarLoopForPetriNet]: 266 programPoint places, 93 predicate places. [2021-10-14 12:10:04,191 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 414 transitions, 1967 flow [2021-10-14 12:10:04,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 131.1818181818182) internal successors, (2886), 22 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 12:10:04,192 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-14 12:10:04,192 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 12:10:04,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-14 12:10:04,192 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2021-10-14 12:10:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 12:10:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash 650577910, now seen corresponding path program 1 times [2021-10-14 12:10:04,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 12:10:04,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738461269] [2021-10-14 12:10:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 12:10:04,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 12:10:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-14 12:10:04,247 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-14 12:10:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-14 12:10:04,361 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-14 12:10:04,361 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-14 12:10:04,362 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 12:10:04,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-14 12:10:04,370 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-14 12:10:04,370 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-14 12:10:04,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:10:04 BasicIcfg [2021-10-14 12:10:04,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-14 12:10:04,465 INFO L168 Benchmark]: Toolchain (without parser) took 10643.92 ms. Allocated memory was 175.1 MB in the beginning and 569.4 MB in the end (delta: 394.3 MB). Free memory was 121.2 MB in the beginning and 250.5 MB in the end (delta: -129.3 MB). Peak memory consumption was 266.0 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,465 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 175.1 MB. Free memory is still 140.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 12:10:04,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.76 ms. Allocated memory was 175.1 MB in the beginning and 224.4 MB in the end (delta: 49.3 MB). Free memory was 121.0 MB in the beginning and 174.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 11.6 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 224.4 MB. Free memory was 174.4 MB in the beginning and 170.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,466 INFO L168 Benchmark]: Boogie Preprocessor took 66.78 ms. Allocated memory is still 224.4 MB. Free memory was 170.8 MB in the beginning and 167.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,466 INFO L168 Benchmark]: RCFGBuilder took 643.12 ms. Allocated memory is still 224.4 MB. Free memory was 167.6 MB in the beginning and 143.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,466 INFO L168 Benchmark]: TraceAbstraction took 9336.87 ms. Allocated memory was 224.4 MB in the beginning and 569.4 MB in the end (delta: 345.0 MB). Free memory was 143.0 MB in the beginning and 250.5 MB in the end (delta: -107.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 8.0 GB. [2021-10-14 12:10:04,467 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.11 ms. Allocated memory is still 175.1 MB. Free memory is still 140.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 528.76 ms. Allocated memory was 175.1 MB in the beginning and 224.4 MB in the end (delta: 49.3 MB). Free memory was 121.0 MB in the beginning and 174.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 11.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 224.4 MB. Free memory was 174.4 MB in the beginning and 170.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.78 ms. Allocated memory is still 224.4 MB. Free memory was 170.8 MB in the beginning and 167.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 643.12 ms. Allocated memory is still 224.4 MB. Free memory was 167.6 MB in the beginning and 143.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9336.87 ms. Allocated memory was 224.4 MB in the beginning and 569.4 MB in the end (delta: 345.0 MB). Free memory was 143.0 MB in the beginning and 250.5 MB in the end (delta: -107.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1228]: the program contains a data race the program contains a data race We found a FailurePath: [L1216-L1219] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1224] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}] [L1225] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1236] 0 pthread_t t1; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1237] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1239] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1241] 0 A->next = p VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1242] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1244] 0 B->next = p VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1245] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1248] 0 p->datum VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1251] 0 p = B->next VAL [A={-3:0}, A->next=121, A->next={-2:0}, A->next->datum=139, A->next->datum=9, A->next->datum++=132, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1252] 0 p->datum VAL [A={-3:0}, A->next=121, A->next={-2:0}, A->next->datum=139, A->next->datum=9, A->next->datum++=132, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1228] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next=121, A->next->datum=139, A->next->datum=9, A->next->datum++=132, A->next->datum++=134, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1228] 1 A->next->datum++ VAL [A={-3:0}, A->next=121, A->next={-2:0}, A->next->datum=139, A->next->datum=9, A->next->datum++=132, A->next->datum++=134, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1242]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1244]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1245]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 346 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9124.1ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6646.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 114.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 748 SDtfs, 1370 SDslu, 1286 SDs, 0 SdLazy, 5839 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2499.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 1372.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1967occurred in iteration=11, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.9ms SsaConstructionTime, 321.7ms SatisfiabilityAnalysisTime, 1671.4ms InterpolantComputationTime, 1621 NumberOfCodeBlocks, 1621 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1402 ConstructedInterpolants, 0 QuantifiedInterpolants, 8234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-14 12:10:04,493 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...