/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:01:11,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:01:11,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:01:11,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:01:11,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:01:11,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:01:11,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:01:11,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:01:11,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:01:11,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:01:11,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:01:11,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:01:11,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:01:11,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:01:11,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:01:11,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:01:11,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:01:11,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:01:11,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:01:11,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:01:11,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:01:11,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:01:11,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:01:11,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:01:11,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:01:11,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:01:11,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:01:11,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:01:11,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:01:11,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:01:11,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:01:11,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:01:11,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:01:11,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:01:11,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:01:11,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:01:11,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:01:11,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:01:11,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:01:11,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:01:11,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:01:11,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:01:11,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:01:11,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:01:11,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:01:11,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:01:11,608 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:01:11,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:01:11,608 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:01:11,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:01:11,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:01:11,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:01:11,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:01:11,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:01:11,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:01:11,611 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:01:11,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:01:11,611 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:01:11,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:01:11,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:01:11,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:01:11,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:01:11,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:01:11,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:01:11,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:01:11,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:01:11,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:01:11,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:01:11,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:01:11,614 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:01:11,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:01:11,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:01:11,614 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:01:11,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:01:11,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:01:11,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:01:11,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:01:11,924 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:01:11,925 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2020-10-06 00:01:11,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95d1d4f/fc59027422d647da9e8fd27d7571552e/FLAG60ac69fa5 [2020-10-06 00:01:12,555 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:01:12,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2020-10-06 00:01:12,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95d1d4f/fc59027422d647da9e8fd27d7571552e/FLAG60ac69fa5 [2020-10-06 00:01:12,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd95d1d4f/fc59027422d647da9e8fd27d7571552e [2020-10-06 00:01:12,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:01:12,863 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:01:12,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:01:12,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:01:12,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:01:12,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:01:12" (1/1) ... [2020-10-06 00:01:12,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea24fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:12, skipping insertion in model container [2020-10-06 00:01:12,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:01:12" (1/1) ... [2020-10-06 00:01:12,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:01:12,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:01:13,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:01:13,509 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:01:13,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:01:13,648 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:01:13,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13 WrapperNode [2020-10-06 00:01:13,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:01:13,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:01:13,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:01:13,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:01:13,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:01:13,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:01:13,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:01:13,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:01:13,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... [2020-10-06 00:01:13,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:01:13,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:01:13,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:01:13,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:01:13,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:01:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2020-10-06 00:01:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2020-10-06 00:01:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2020-10-06 00:01:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2020-10-06 00:01:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-06 00:01:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:01:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2020-10-06 00:01:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2020-10-06 00:01:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-06 00:01:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:01:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:01:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-06 00:01:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:01:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:01:13,844 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:01:14,903 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:01:14,903 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-06 00:01:14,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:01:14 BoogieIcfgContainer [2020-10-06 00:01:14,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:01:14,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:01:14,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:01:14,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:01:14,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:01:12" (1/3) ... [2020-10-06 00:01:14,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8ca7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:01:14, skipping insertion in model container [2020-10-06 00:01:14,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:01:13" (2/3) ... [2020-10-06 00:01:14,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8ca7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:01:14, skipping insertion in model container [2020-10-06 00:01:14,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:01:14" (3/3) ... [2020-10-06 00:01:14,916 INFO L109 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2020-10-06 00:01:14,927 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:01:14,927 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:01:14,936 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:01:14,937 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:01:14,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,986 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,987 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,987 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,987 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,996 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,996 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,997 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,999 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,999 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:14,999 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,001 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,002 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,002 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,005 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,005 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,008 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,009 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,009 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,009 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,011 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,011 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,016 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,017 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,017 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,017 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,025 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,025 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,028 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,029 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,030 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,031 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,033 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,034 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,034 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,034 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,034 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,034 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,035 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,036 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,036 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,036 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,038 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,039 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,045 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,046 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,047 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,047 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,047 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,047 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,048 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,049 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,049 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,049 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,049 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,049 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,050 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,051 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,051 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,051 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,051 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,051 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,052 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,052 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,057 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,057 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,057 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,057 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,057 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,058 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,059 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,059 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,059 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,059 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,059 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,060 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,060 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,060 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,069 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,069 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,070 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,070 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,070 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,070 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,070 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,071 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,072 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:01:15,103 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-06 00:01:15,127 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:01:15,127 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:01:15,127 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:01:15,127 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:01:15,128 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:01:15,128 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:01:15,128 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:01:15,128 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:01:15,151 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 171 transitions, 384 flow [2020-10-06 00:01:15,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 157 places, 171 transitions, 384 flow [2020-10-06 00:01:15,255 INFO L129 PetriNetUnfolder]: 23/179 cut-off events. [2020-10-06 00:01:15,256 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-06 00:01:15,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 179 events. 23/179 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2020-10-06 00:01:15,274 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 157 places, 171 transitions, 384 flow [2020-10-06 00:01:15,357 INFO L129 PetriNetUnfolder]: 23/179 cut-off events. [2020-10-06 00:01:15,358 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-06 00:01:15,363 INFO L80 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 179 events. 23/179 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2020-10-06 00:01:15,376 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10120 [2020-10-06 00:01:15,377 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:01:18,384 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2020-10-06 00:01:18,520 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-06 00:01:18,677 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-06 00:01:18,800 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-06 00:01:18,833 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20473 [2020-10-06 00:01:18,833 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2020-10-06 00:01:18,836 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 76 transitions, 194 flow [2020-10-06 00:01:19,125 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4685 states. [2020-10-06 00:01:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states. [2020-10-06 00:01:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:01:19,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:19,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:19,148 INFO L427 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1429150528, now seen corresponding path program 1 times [2020-10-06 00:01:19,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:19,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340581560] [2020-10-06 00:01:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:19,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340581560] [2020-10-06 00:01:19,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:19,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:01:19,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572763910] [2020-10-06 00:01:19,430 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:19,435 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:19,453 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-06 00:01:19,453 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:19,458 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:19,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:19,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:19,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:19,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:19,477 INFO L87 Difference]: Start difference. First operand 4685 states. Second operand 3 states. [2020-10-06 00:01:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:19,605 INFO L93 Difference]: Finished difference Result 5823 states and 21672 transitions. [2020-10-06 00:01:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:19,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-06 00:01:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:19,750 INFO L225 Difference]: With dead ends: 5823 [2020-10-06 00:01:19,750 INFO L226 Difference]: Without dead ends: 4979 [2020-10-06 00:01:19,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2020-10-06 00:01:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4442. [2020-10-06 00:01:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2020-10-06 00:01:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 17172 transitions. [2020-10-06 00:01:20,014 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 17172 transitions. Word has length 12 [2020-10-06 00:01:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:20,015 INFO L479 AbstractCegarLoop]: Abstraction has 4442 states and 17172 transitions. [2020-10-06 00:01:20,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 17172 transitions. [2020-10-06 00:01:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:01:20,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:20,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:20,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:01:20,020 INFO L427 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1348815056, now seen corresponding path program 1 times [2020-10-06 00:01:20,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:20,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054714642] [2020-10-06 00:01:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:20,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054714642] [2020-10-06 00:01:20,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:20,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:01:20,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737808828] [2020-10-06 00:01:20,092 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:20,093 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:20,096 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 00:01:20,096 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:20,097 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:20,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:20,099 INFO L87 Difference]: Start difference. First operand 4442 states and 17172 transitions. Second operand 3 states. [2020-10-06 00:01:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:20,174 INFO L93 Difference]: Finished difference Result 4347 states and 16799 transitions. [2020-10-06 00:01:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:20,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-06 00:01:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:20,214 INFO L225 Difference]: With dead ends: 4347 [2020-10-06 00:01:20,214 INFO L226 Difference]: Without dead ends: 4347 [2020-10-06 00:01:20,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4347 states. [2020-10-06 00:01:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4347 to 4347. [2020-10-06 00:01:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2020-10-06 00:01:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 16799 transitions. [2020-10-06 00:01:20,382 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 16799 transitions. Word has length 13 [2020-10-06 00:01:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:20,383 INFO L479 AbstractCegarLoop]: Abstraction has 4347 states and 16799 transitions. [2020-10-06 00:01:20,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 16799 transitions. [2020-10-06 00:01:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:01:20,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:20,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:20,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:01:20,387 INFO L427 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1348815207, now seen corresponding path program 1 times [2020-10-06 00:01:20,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:20,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038634889] [2020-10-06 00:01:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:20,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038634889] [2020-10-06 00:01:20,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:20,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:01:20,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570884727] [2020-10-06 00:01:20,464 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:20,466 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:20,467 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 00:01:20,467 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:20,468 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:20,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:20,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:20,469 INFO L87 Difference]: Start difference. First operand 4347 states and 16799 transitions. Second operand 3 states. [2020-10-06 00:01:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:20,616 INFO L93 Difference]: Finished difference Result 4252 states and 16426 transitions. [2020-10-06 00:01:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:20,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-06 00:01:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:20,666 INFO L225 Difference]: With dead ends: 4252 [2020-10-06 00:01:20,666 INFO L226 Difference]: Without dead ends: 4252 [2020-10-06 00:01:20,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2020-10-06 00:01:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 4252. [2020-10-06 00:01:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4252 states. [2020-10-06 00:01:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 16426 transitions. [2020-10-06 00:01:20,799 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 16426 transitions. Word has length 13 [2020-10-06 00:01:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:20,799 INFO L479 AbstractCegarLoop]: Abstraction has 4252 states and 16426 transitions. [2020-10-06 00:01:20,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 16426 transitions. [2020-10-06 00:01:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:01:20,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:20,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:20,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:01:20,806 INFO L427 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash -367488622, now seen corresponding path program 1 times [2020-10-06 00:01:20,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:20,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875022493] [2020-10-06 00:01:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:20,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875022493] [2020-10-06 00:01:20,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:20,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:01:20,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802550605] [2020-10-06 00:01:20,887 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:20,889 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:20,893 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 49 transitions. [2020-10-06 00:01:20,893 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:20,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:20,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:20,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:20,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:20,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:20,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:20,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:20,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:20,986 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [50049#(or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0))] [2020-10-06 00:01:20,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:01:20,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:01:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:20,988 INFO L87 Difference]: Start difference. First operand 4252 states and 16426 transitions. Second operand 7 states. [2020-10-06 00:01:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:21,908 INFO L93 Difference]: Finished difference Result 12455 states and 46588 transitions. [2020-10-06 00:01:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-06 00:01:21,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-06 00:01:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:21,976 INFO L225 Difference]: With dead ends: 12455 [2020-10-06 00:01:21,976 INFO L226 Difference]: Without dead ends: 12455 [2020-10-06 00:01:21,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-10-06 00:01:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12455 states. [2020-10-06 00:01:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12455 to 5251. [2020-10-06 00:01:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5251 states. [2020-10-06 00:01:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 20177 transitions. [2020-10-06 00:01:22,259 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 20177 transitions. Word has length 17 [2020-10-06 00:01:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:22,259 INFO L479 AbstractCegarLoop]: Abstraction has 5251 states and 20177 transitions. [2020-10-06 00:01:22,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:01:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 20177 transitions. [2020-10-06 00:01:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:01:22,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:22,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:22,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:01:22,268 INFO L427 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash -282524690, now seen corresponding path program 1 times [2020-10-06 00:01:22,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:22,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586289206] [2020-10-06 00:01:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:22,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586289206] [2020-10-06 00:01:22,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:22,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:01:22,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919015015] [2020-10-06 00:01:22,326 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:22,328 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:22,333 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 49 transitions. [2020-10-06 00:01:22,333 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:22,339 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:22,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:22,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:22,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:22,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:22,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:22,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:22,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:22,398 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [73035#(or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0))] [2020-10-06 00:01:22,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:01:22,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:01:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:22,399 INFO L87 Difference]: Start difference. First operand 5251 states and 20177 transitions. Second operand 7 states. [2020-10-06 00:01:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:23,224 INFO L93 Difference]: Finished difference Result 12691 states and 46410 transitions. [2020-10-06 00:01:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-06 00:01:23,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-06 00:01:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:23,270 INFO L225 Difference]: With dead ends: 12691 [2020-10-06 00:01:23,270 INFO L226 Difference]: Without dead ends: 12691 [2020-10-06 00:01:23,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-06 00:01:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12691 states. [2020-10-06 00:01:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12691 to 5047. [2020-10-06 00:01:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2020-10-06 00:01:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 19193 transitions. [2020-10-06 00:01:23,511 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 19193 transitions. Word has length 17 [2020-10-06 00:01:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:23,512 INFO L479 AbstractCegarLoop]: Abstraction has 5047 states and 19193 transitions. [2020-10-06 00:01:23,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:01:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 19193 transitions. [2020-10-06 00:01:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:01:23,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:23,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:23,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:01:23,520 INFO L427 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1278040972, now seen corresponding path program 2 times [2020-10-06 00:01:23,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:23,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861486176] [2020-10-06 00:01:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:23,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861486176] [2020-10-06 00:01:23,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:23,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:01:23,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150392774] [2020-10-06 00:01:23,590 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:23,594 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:23,600 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 65 transitions. [2020-10-06 00:01:23,600 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:23,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-06 00:01:23,699 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 00:01:23,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 00:01:23,701 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-06 00:01:23,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:3 [2020-10-06 00:01:23,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-06 00:01:23,743 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 00:01:23,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 00:01:23,745 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-06 00:01:23,745 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:3 [2020-10-06 00:01:23,754 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:23,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:01:23,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:01:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:01:23,755 INFO L87 Difference]: Start difference. First operand 5047 states and 19193 transitions. Second operand 5 states. [2020-10-06 00:01:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:23,884 INFO L93 Difference]: Finished difference Result 6997 states and 25679 transitions. [2020-10-06 00:01:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:01:23,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-06 00:01:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:23,907 INFO L225 Difference]: With dead ends: 6997 [2020-10-06 00:01:23,907 INFO L226 Difference]: Without dead ends: 6997 [2020-10-06 00:01:23,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:01:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6997 states. [2020-10-06 00:01:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6997 to 6958. [2020-10-06 00:01:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2020-10-06 00:01:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 25612 transitions. [2020-10-06 00:01:24,212 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 25612 transitions. Word has length 17 [2020-10-06 00:01:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:24,212 INFO L479 AbstractCegarLoop]: Abstraction has 6958 states and 25612 transitions. [2020-10-06 00:01:24,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:01:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 25612 transitions. [2020-10-06 00:01:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:01:24,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:24,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:24,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:01:24,222 INFO L427 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash -20729748, now seen corresponding path program 1 times [2020-10-06 00:01:24,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:24,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388493811] [2020-10-06 00:01:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:24,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388493811] [2020-10-06 00:01:24,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:24,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:01:24,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [414854228] [2020-10-06 00:01:24,268 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:24,270 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:24,275 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-10-06 00:01:24,275 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:24,327 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:24,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:01:24,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:01:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:01:24,328 INFO L87 Difference]: Start difference. First operand 6958 states and 25612 transitions. Second operand 4 states. [2020-10-06 00:01:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:24,424 INFO L93 Difference]: Finished difference Result 9734 states and 34559 transitions. [2020-10-06 00:01:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:01:24,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-06 00:01:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:24,438 INFO L225 Difference]: With dead ends: 9734 [2020-10-06 00:01:24,439 INFO L226 Difference]: Without dead ends: 5222 [2020-10-06 00:01:24,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:01:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2020-10-06 00:01:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5183. [2020-10-06 00:01:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5183 states. [2020-10-06 00:01:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 17133 transitions. [2020-10-06 00:01:24,571 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 17133 transitions. Word has length 17 [2020-10-06 00:01:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:24,572 INFO L479 AbstractCegarLoop]: Abstraction has 5183 states and 17133 transitions. [2020-10-06 00:01:24,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:01:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 17133 transitions. [2020-10-06 00:01:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:01:24,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:24,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:24,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:01:24,577 INFO L427 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 716258407, now seen corresponding path program 1 times [2020-10-06 00:01:24,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:24,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726117524] [2020-10-06 00:01:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:24,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726117524] [2020-10-06 00:01:24,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:01:24,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958738545] [2020-10-06 00:01:24,626 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:24,629 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:24,635 INFO L258 McrAutomatonBuilder]: Finished intersection with 45 states and 69 transitions. [2020-10-06 00:01:24,635 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:24,691 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:24,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:24,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:24,693 INFO L87 Difference]: Start difference. First operand 5183 states and 17133 transitions. Second operand 3 states. [2020-10-06 00:01:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:24,731 INFO L93 Difference]: Finished difference Result 5183 states and 17038 transitions. [2020-10-06 00:01:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:24,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-06 00:01:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:24,737 INFO L225 Difference]: With dead ends: 5183 [2020-10-06 00:01:24,738 INFO L226 Difference]: Without dead ends: 3674 [2020-10-06 00:01:24,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2020-10-06 00:01:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3010. [2020-10-06 00:01:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2020-10-06 00:01:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 9727 transitions. [2020-10-06 00:01:24,809 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 9727 transitions. Word has length 19 [2020-10-06 00:01:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:24,809 INFO L479 AbstractCegarLoop]: Abstraction has 3010 states and 9727 transitions. [2020-10-06 00:01:24,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 9727 transitions. [2020-10-06 00:01:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:01:24,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:24,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:24,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:01:24,814 INFO L427 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash -42612842, now seen corresponding path program 1 times [2020-10-06 00:01:24,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:24,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335043891] [2020-10-06 00:01:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:24,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335043891] [2020-10-06 00:01:24,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:24,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:01:24,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125301169] [2020-10-06 00:01:24,853 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:24,855 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:24,859 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 45 transitions. [2020-10-06 00:01:24,860 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:24,883 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:24,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:24,885 INFO L87 Difference]: Start difference. First operand 3010 states and 9727 transitions. Second operand 3 states. [2020-10-06 00:01:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:24,916 INFO L93 Difference]: Finished difference Result 3010 states and 9655 transitions. [2020-10-06 00:01:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:24,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-06 00:01:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:24,920 INFO L225 Difference]: With dead ends: 3010 [2020-10-06 00:01:24,921 INFO L226 Difference]: Without dead ends: 1436 [2020-10-06 00:01:24,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-10-06 00:01:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1290. [2020-10-06 00:01:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2020-10-06 00:01:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3528 transitions. [2020-10-06 00:01:24,953 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3528 transitions. Word has length 19 [2020-10-06 00:01:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:24,953 INFO L479 AbstractCegarLoop]: Abstraction has 1290 states and 3528 transitions. [2020-10-06 00:01:24,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3528 transitions. [2020-10-06 00:01:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-06 00:01:24,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:24,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:25,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:01:25,031 INFO L427 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1652891015, now seen corresponding path program 1 times [2020-10-06 00:01:25,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:25,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839723853] [2020-10-06 00:01:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:25,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839723853] [2020-10-06 00:01:25,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:25,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:01:25,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1279653546] [2020-10-06 00:01:25,074 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:25,077 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:25,084 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-10-06 00:01:25,084 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:25,115 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:25,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:25,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:25,116 INFO L87 Difference]: Start difference. First operand 1290 states and 3528 transitions. Second operand 3 states. [2020-10-06 00:01:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:25,139 INFO L93 Difference]: Finished difference Result 1182 states and 3142 transitions. [2020-10-06 00:01:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:25,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-06 00:01:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:25,142 INFO L225 Difference]: With dead ends: 1182 [2020-10-06 00:01:25,142 INFO L226 Difference]: Without dead ends: 1182 [2020-10-06 00:01:25,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-10-06 00:01:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1130. [2020-10-06 00:01:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2020-10-06 00:01:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3066 transitions. [2020-10-06 00:01:25,166 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3066 transitions. Word has length 22 [2020-10-06 00:01:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:25,166 INFO L479 AbstractCegarLoop]: Abstraction has 1130 states and 3066 transitions. [2020-10-06 00:01:25,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3066 transitions. [2020-10-06 00:01:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-06 00:01:25,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:25,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:25,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:01:25,169 INFO L427 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash -886153004, now seen corresponding path program 1 times [2020-10-06 00:01:25,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:25,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867418200] [2020-10-06 00:01:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:25,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867418200] [2020-10-06 00:01:25,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:25,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:01:25,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [647072200] [2020-10-06 00:01:25,207 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:25,210 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:25,215 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-10-06 00:01:25,215 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:25,217 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:01:25,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:01:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:25,218 INFO L87 Difference]: Start difference. First operand 1130 states and 3066 transitions. Second operand 3 states. [2020-10-06 00:01:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:25,243 INFO L93 Difference]: Finished difference Result 1142 states and 2959 transitions. [2020-10-06 00:01:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:01:25,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-06 00:01:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:25,246 INFO L225 Difference]: With dead ends: 1142 [2020-10-06 00:01:25,246 INFO L226 Difference]: Without dead ends: 1142 [2020-10-06 00:01:25,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:01:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2020-10-06 00:01:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1090. [2020-10-06 00:01:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2020-10-06 00:01:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2883 transitions. [2020-10-06 00:01:25,266 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2883 transitions. Word has length 22 [2020-10-06 00:01:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:25,267 INFO L479 AbstractCegarLoop]: Abstraction has 1090 states and 2883 transitions. [2020-10-06 00:01:25,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:01:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2883 transitions. [2020-10-06 00:01:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-06 00:01:25,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:25,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:25,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:01:25,272 INFO L427 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -886152074, now seen corresponding path program 1 times [2020-10-06 00:01:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:25,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46576872] [2020-10-06 00:01:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:25,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46576872] [2020-10-06 00:01:25,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:25,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:01:25,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215993328] [2020-10-06 00:01:25,349 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:25,352 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:25,357 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-10-06 00:01:25,357 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:25,391 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:25,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:01:25,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:01:25,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:01:25,392 INFO L87 Difference]: Start difference. First operand 1090 states and 2883 transitions. Second operand 5 states. [2020-10-06 00:01:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:25,497 INFO L93 Difference]: Finished difference Result 1862 states and 4671 transitions. [2020-10-06 00:01:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:01:25,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-06 00:01:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:25,501 INFO L225 Difference]: With dead ends: 1862 [2020-10-06 00:01:25,501 INFO L226 Difference]: Without dead ends: 1670 [2020-10-06 00:01:25,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2020-10-06 00:01:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1338. [2020-10-06 00:01:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2020-10-06 00:01:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 3546 transitions. [2020-10-06 00:01:25,528 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 3546 transitions. Word has length 22 [2020-10-06 00:01:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:25,528 INFO L479 AbstractCegarLoop]: Abstraction has 1338 states and 3546 transitions. [2020-10-06 00:01:25,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:01:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 3546 transitions. [2020-10-06 00:01:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:01:25,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:25,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:25,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 00:01:25,532 INFO L427 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash -931030371, now seen corresponding path program 1 times [2020-10-06 00:01:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:25,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649326273] [2020-10-06 00:01:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:25,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649326273] [2020-10-06 00:01:25,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:25,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:01:25,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397256493] [2020-10-06 00:01:25,567 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:25,571 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:25,587 INFO L258 McrAutomatonBuilder]: Finished intersection with 92 states and 183 transitions. [2020-10-06 00:01:25,587 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:25,861 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [164992#(< ~idx~0 1), 164991#(< qrcu_reader2Thread1of1ForFork2_~myidx~1 1)] [2020-10-06 00:01:25,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:01:25,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:01:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:01:25,863 INFO L87 Difference]: Start difference. First operand 1338 states and 3546 transitions. Second operand 6 states. [2020-10-06 00:01:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:25,959 INFO L93 Difference]: Finished difference Result 1550 states and 4008 transitions. [2020-10-06 00:01:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:01:25,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-06 00:01:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:25,962 INFO L225 Difference]: With dead ends: 1550 [2020-10-06 00:01:25,962 INFO L226 Difference]: Without dead ends: 1468 [2020-10-06 00:01:25,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 18 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-10-06 00:01:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1185. [2020-10-06 00:01:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2020-10-06 00:01:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 3006 transitions. [2020-10-06 00:01:25,995 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 3006 transitions. Word has length 23 [2020-10-06 00:01:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:25,995 INFO L479 AbstractCegarLoop]: Abstraction has 1185 states and 3006 transitions. [2020-10-06 00:01:25,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:01:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 3006 transitions. [2020-10-06 00:01:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:01:25,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:25,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:25,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 00:01:26,000 INFO L427 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1195948336, now seen corresponding path program 1 times [2020-10-06 00:01:26,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:26,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293059645] [2020-10-06 00:01:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:26,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293059645] [2020-10-06 00:01:26,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:26,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-06 00:01:26,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657283061] [2020-10-06 00:01:26,127 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:26,131 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:26,149 INFO L258 McrAutomatonBuilder]: Finished intersection with 100 states and 205 transitions. [2020-10-06 00:01:26,149 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:26,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:26,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:26,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:26,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:26,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:26,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,363 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,740 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:26,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:26,745 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [168928#(or (< 0 qrcu_reader1Thread1of1ForFork1_~myidx~0) (<= ~ctr1~0 0) (and (<= 1 (+ ~ctr1~0 ~ctr2~0)) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0))), 168929#(and (or (<= ~ctr1~0 0) (< 0 ~idx~0) (= ~idx~0 0)) (or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0) (< 0 ~idx~0))), 168926#(or (< 0 qrcu_reader1Thread1of1ForFork1_~myidx~0) (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0)), 168927#(or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0) (< 0 ~idx~0)), 168924#(<= 3 (+ ~ctr1~0 ~ctr2~0)), 168925#(or (<= ~ctr1~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0)))] [2020-10-06 00:01:26,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-06 00:01:26,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-06 00:01:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-06 00:01:26,746 INFO L87 Difference]: Start difference. First operand 1185 states and 3006 transitions. Second operand 15 states. [2020-10-06 00:01:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:28,852 INFO L93 Difference]: Finished difference Result 2033 states and 4881 transitions. [2020-10-06 00:01:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-10-06 00:01:28,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-06 00:01:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:28,855 INFO L225 Difference]: With dead ends: 2033 [2020-10-06 00:01:28,856 INFO L226 Difference]: Without dead ends: 1983 [2020-10-06 00:01:28,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=606, Invalid=1844, Unknown=0, NotChecked=0, Total=2450 [2020-10-06 00:01:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2020-10-06 00:01:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1147. [2020-10-06 00:01:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2020-10-06 00:01:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 2825 transitions. [2020-10-06 00:01:28,889 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 2825 transitions. Word has length 23 [2020-10-06 00:01:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:28,890 INFO L479 AbstractCegarLoop]: Abstraction has 1147 states and 2825 transitions. [2020-10-06 00:01:28,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-06 00:01:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2825 transitions. [2020-10-06 00:01:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:01:28,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:28,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:28,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 00:01:28,893 INFO L427 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1280912268, now seen corresponding path program 1 times [2020-10-06 00:01:28,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:28,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230761754] [2020-10-06 00:01:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:28,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230761754] [2020-10-06 00:01:28,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:28,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-06 00:01:28,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877468314] [2020-10-06 00:01:28,999 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:29,002 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:29,018 INFO L258 McrAutomatonBuilder]: Finished intersection with 100 states and 205 transitions. [2020-10-06 00:01:29,018 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:29,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:29,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:29,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,067 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:29,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:29,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:29,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,517 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,674 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,722 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:29,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:29,832 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [173338#(or (< 0 qrcu_reader1Thread1of1ForFork1_~myidx~0) (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0)), 173339#(or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0) (< 0 ~idx~0)), 173336#(<= 3 (+ ~ctr1~0 ~ctr2~0)), 173337#(or (<= ~ctr1~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 173340#(or (< 0 qrcu_reader1Thread1of1ForFork1_~myidx~0) (<= ~ctr1~0 0) (and (<= 1 (+ ~ctr1~0 ~ctr2~0)) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0))), 173341#(and (or (<= ~ctr1~0 0) (< 0 ~idx~0) (= ~idx~0 0)) (or (<= 1 (+ ~ctr1~0 ~ctr2~0)) (<= ~ctr1~0 0) (< 0 ~idx~0)))] [2020-10-06 00:01:29,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-06 00:01:29,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-06 00:01:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-06 00:01:29,834 INFO L87 Difference]: Start difference. First operand 1147 states and 2825 transitions. Second operand 15 states. [2020-10-06 00:01:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:32,106 INFO L93 Difference]: Finished difference Result 1887 states and 4549 transitions. [2020-10-06 00:01:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-10-06 00:01:32,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-06 00:01:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:32,110 INFO L225 Difference]: With dead ends: 1887 [2020-10-06 00:01:32,110 INFO L226 Difference]: Without dead ends: 1779 [2020-10-06 00:01:32,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=612, Invalid=1838, Unknown=0, NotChecked=0, Total=2450 [2020-10-06 00:01:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2020-10-06 00:01:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1016. [2020-10-06 00:01:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2020-10-06 00:01:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 2546 transitions. [2020-10-06 00:01:32,134 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 2546 transitions. Word has length 23 [2020-10-06 00:01:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:32,135 INFO L479 AbstractCegarLoop]: Abstraction has 1016 states and 2546 transitions. [2020-10-06 00:01:32,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-06 00:01:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 2546 transitions. [2020-10-06 00:01:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:01:32,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:32,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:32,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-06 00:01:32,138 INFO L427 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1128328506, now seen corresponding path program 1 times [2020-10-06 00:01:32,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:32,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054534512] [2020-10-06 00:01:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:32,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054534512] [2020-10-06 00:01:32,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:32,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:01:32,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003135475] [2020-10-06 00:01:32,177 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:32,180 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:32,193 INFO L258 McrAutomatonBuilder]: Finished intersection with 84 states and 167 transitions. [2020-10-06 00:01:32,193 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:32,417 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [177335#(< qrcu_reader1Thread1of1ForFork1_~myidx~0 1), 177336#(< ~idx~0 1)] [2020-10-06 00:01:32,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:01:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:32,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:01:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:01:32,418 INFO L87 Difference]: Start difference. First operand 1016 states and 2546 transitions. Second operand 6 states. [2020-10-06 00:01:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:32,485 INFO L93 Difference]: Finished difference Result 1059 states and 2688 transitions. [2020-10-06 00:01:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:01:32,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-06 00:01:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:32,487 INFO L225 Difference]: With dead ends: 1059 [2020-10-06 00:01:32,487 INFO L226 Difference]: Without dead ends: 976 [2020-10-06 00:01:32,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 14 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2020-10-06 00:01:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 771. [2020-10-06 00:01:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-10-06 00:01:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1946 transitions. [2020-10-06 00:01:32,504 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1946 transitions. Word has length 23 [2020-10-06 00:01:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:32,504 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 1946 transitions. [2020-10-06 00:01:32,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:01:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1946 transitions. [2020-10-06 00:01:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:32,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:32,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:32,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-06 00:01:32,507 INFO L427 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1509948242, now seen corresponding path program 1 times [2020-10-06 00:01:32,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:32,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811706517] [2020-10-06 00:01:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:32,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811706517] [2020-10-06 00:01:32,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:32,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:01:32,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648351965] [2020-10-06 00:01:32,583 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:32,590 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:32,617 INFO L258 McrAutomatonBuilder]: Finished intersection with 97 states and 188 transitions. [2020-10-06 00:01:32,617 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:32,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,723 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,738 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,839 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:32,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:32,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-06 00:01:32,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,003 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [179947#(and (<= 0 ~ctr2~0) (or (<= 1 ~ctr2~0) (<= qrcu_reader1Thread1of1ForFork1_~myidx~0 0))), 179948#(or (< 0 qrcu_reader1Thread1of1ForFork1_~myidx~0) (<= 0 ~ctr2~0)), 179949#(or (<= 0 ~ctr2~0) (< 0 ~idx~0))] [2020-10-06 00:01:33,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 00:01:33,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 00:01:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:01:33,005 INFO L87 Difference]: Start difference. First operand 771 states and 1946 transitions. Second operand 10 states. [2020-10-06 00:01:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:33,256 INFO L93 Difference]: Finished difference Result 924 states and 2336 transitions. [2020-10-06 00:01:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 00:01:33,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-06 00:01:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:33,258 INFO L225 Difference]: With dead ends: 924 [2020-10-06 00:01:33,258 INFO L226 Difference]: Without dead ends: 689 [2020-10-06 00:01:33,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 19 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2020-10-06 00:01:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2020-10-06 00:01:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 564. [2020-10-06 00:01:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2020-10-06 00:01:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1400 transitions. [2020-10-06 00:01:33,270 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1400 transitions. Word has length 28 [2020-10-06 00:01:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:33,270 INFO L479 AbstractCegarLoop]: Abstraction has 564 states and 1400 transitions. [2020-10-06 00:01:33,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 00:01:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1400 transitions. [2020-10-06 00:01:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:33,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:33,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:33,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-06 00:01:33,272 INFO L427 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2093632144, now seen corresponding path program 1 times [2020-10-06 00:01:33,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:33,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314836160] [2020-10-06 00:01:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:33,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314836160] [2020-10-06 00:01:33,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:33,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:01:33,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648388070] [2020-10-06 00:01:33,343 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:33,347 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:33,365 INFO L258 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2020-10-06 00:01:33,365 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:33,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:33,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:33,632 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [182022#(or (< 0 qrcu_reader2Thread1of1ForFork2_~myidx~1) (<= 0 ~ctr2~0)), 182023#(or (<= 0 ~ctr2~0) (< 0 ~idx~0)), 182021#(and (or (<= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 1 ~ctr2~0)) (<= 0 ~ctr2~0))] [2020-10-06 00:01:33,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 00:01:33,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 00:01:33,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:01:33,633 INFO L87 Difference]: Start difference. First operand 564 states and 1400 transitions. Second operand 10 states. [2020-10-06 00:01:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:33,875 INFO L93 Difference]: Finished difference Result 660 states and 1682 transitions. [2020-10-06 00:01:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-06 00:01:33,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-06 00:01:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:33,877 INFO L225 Difference]: With dead ends: 660 [2020-10-06 00:01:33,877 INFO L226 Difference]: Without dead ends: 388 [2020-10-06 00:01:33,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 22 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2020-10-06 00:01:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-10-06 00:01:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 344. [2020-10-06 00:01:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-06 00:01:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 834 transitions. [2020-10-06 00:01:33,888 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 834 transitions. Word has length 28 [2020-10-06 00:01:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:33,888 INFO L479 AbstractCegarLoop]: Abstraction has 344 states and 834 transitions. [2020-10-06 00:01:33,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 00:01:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 834 transitions. [2020-10-06 00:01:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:33,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:33,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:33,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-06 00:01:33,890 INFO L427 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:33,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1721070390, now seen corresponding path program 2 times [2020-10-06 00:01:33,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:33,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736842851] [2020-10-06 00:01:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:33,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736842851] [2020-10-06 00:01:33,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:33,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:01:33,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221152128] [2020-10-06 00:01:33,925 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:33,933 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:33,949 INFO L258 McrAutomatonBuilder]: Finished intersection with 68 states and 114 transitions. [2020-10-06 00:01:33,949 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:33,954 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:33,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:01:33,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:33,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:01:33,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:01:33,955 INFO L87 Difference]: Start difference. First operand 344 states and 834 transitions. Second operand 4 states. [2020-10-06 00:01:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:34,003 INFO L93 Difference]: Finished difference Result 352 states and 862 transitions. [2020-10-06 00:01:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:01:34,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-06 00:01:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:34,005 INFO L225 Difference]: With dead ends: 352 [2020-10-06 00:01:34,005 INFO L226 Difference]: Without dead ends: 344 [2020-10-06 00:01:34,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:01:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-10-06 00:01:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 336. [2020-10-06 00:01:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-10-06 00:01:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 806 transitions. [2020-10-06 00:01:34,013 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 806 transitions. Word has length 28 [2020-10-06 00:01:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:34,013 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 806 transitions. [2020-10-06 00:01:34,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:01:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 806 transitions. [2020-10-06 00:01:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:34,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:34,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:34,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-06 00:01:34,014 INFO L427 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -582438657, now seen corresponding path program 1 times [2020-10-06 00:01:34,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:34,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379587875] [2020-10-06 00:01:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:34,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379587875] [2020-10-06 00:01:34,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:34,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:01:34,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2096836721] [2020-10-06 00:01:34,060 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:34,064 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:34,080 INFO L258 McrAutomatonBuilder]: Finished intersection with 82 states and 142 transitions. [2020-10-06 00:01:34,080 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:34,083 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:34,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:34,119 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [184420#(and (or (<= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr2~0)) (<= 1 ~ctr2~0))] [2020-10-06 00:01:34,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:01:34,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:34,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:01:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:34,121 INFO L87 Difference]: Start difference. First operand 336 states and 806 transitions. Second operand 7 states. [2020-10-06 00:01:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:34,261 INFO L93 Difference]: Finished difference Result 364 states and 914 transitions. [2020-10-06 00:01:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-06 00:01:34,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-06 00:01:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:34,262 INFO L225 Difference]: With dead ends: 364 [2020-10-06 00:01:34,262 INFO L226 Difference]: Without dead ends: 218 [2020-10-06 00:01:34,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-10-06 00:01:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-10-06 00:01:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 180. [2020-10-06 00:01:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-06 00:01:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 438 transitions. [2020-10-06 00:01:34,266 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 438 transitions. Word has length 28 [2020-10-06 00:01:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:34,266 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 438 transitions. [2020-10-06 00:01:34,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:01:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 438 transitions. [2020-10-06 00:01:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:34,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:34,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:34,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-06 00:01:34,268 INFO L427 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash 716425012, now seen corresponding path program 2 times [2020-10-06 00:01:34,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:34,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077274811] [2020-10-06 00:01:34,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:34,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077274811] [2020-10-06 00:01:34,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:34,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:01:34,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882181300] [2020-10-06 00:01:34,307 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:34,311 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:34,325 INFO L258 McrAutomatonBuilder]: Finished intersection with 67 states and 112 transitions. [2020-10-06 00:01:34,325 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:34,332 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:34,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:01:34,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:01:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:01:34,333 INFO L87 Difference]: Start difference. First operand 180 states and 438 transitions. Second operand 4 states. [2020-10-06 00:01:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:34,360 INFO L93 Difference]: Finished difference Result 188 states and 466 transitions. [2020-10-06 00:01:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:01:34,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-06 00:01:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:34,361 INFO L225 Difference]: With dead ends: 188 [2020-10-06 00:01:34,361 INFO L226 Difference]: Without dead ends: 180 [2020-10-06 00:01:34,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:01:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-06 00:01:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2020-10-06 00:01:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-06 00:01:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 410 transitions. [2020-10-06 00:01:34,366 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 410 transitions. Word has length 28 [2020-10-06 00:01:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:34,366 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 410 transitions. [2020-10-06 00:01:34,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:01:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 410 transitions. [2020-10-06 00:01:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:01:34,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:34,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:01:34,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-06 00:01:34,368 INFO L427 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -121465774, now seen corresponding path program 1 times [2020-10-06 00:01:34,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:34,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117765654] [2020-10-06 00:01:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:34,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117765654] [2020-10-06 00:01:34,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:01:34,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:01:34,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986702692] [2020-10-06 00:01:34,454 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:34,460 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:34,476 INFO L258 McrAutomatonBuilder]: Finished intersection with 76 states and 130 transitions. [2020-10-06 00:01:34,476 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:34,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:34,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:01:34,528 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [185704#(and (or (<= 2 ~ctr2~0) (<= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)) (<= 1 ~ctr2~0))] [2020-10-06 00:01:34,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:01:34,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:34,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:01:34,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:01:34,529 INFO L87 Difference]: Start difference. First operand 172 states and 410 transitions. Second operand 7 states. [2020-10-06 00:01:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:34,630 INFO L93 Difference]: Finished difference Result 162 states and 419 transitions. [2020-10-06 00:01:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:01:34,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-06 00:01:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:34,631 INFO L225 Difference]: With dead ends: 162 [2020-10-06 00:01:34,631 INFO L226 Difference]: Without dead ends: 0 [2020-10-06 00:01:34,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:01:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-06 00:01:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-06 00:01:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-06 00:01:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-06 00:01:34,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-10-06 00:01:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:34,633 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-06 00:01:34,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:01:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-06 00:01:34,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-06 00:01:34,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-06 00:01:34,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:01:34 BasicIcfg [2020-10-06 00:01:34,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:01:34,640 INFO L168 Benchmark]: Toolchain (without parser) took 21776.62 ms. Allocated memory was 140.5 MB in the beginning and 763.4 MB in the end (delta: 622.9 MB). Free memory was 102.6 MB in the beginning and 183.6 MB in the end (delta: -81.0 MB). Peak memory consumption was 541.9 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,640 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.76 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.49 ms. Allocated memory is still 203.4 MB. Free memory was 159.7 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,642 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 155.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,643 INFO L168 Benchmark]: RCFGBuilder took 1153.78 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 154.5 MB in the beginning and 165.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,643 INFO L168 Benchmark]: TraceAbstraction took 19731.04 ms. Allocated memory was 235.9 MB in the beginning and 763.4 MB in the end (delta: 527.4 MB). Free memory was 165.5 MB in the beginning and 183.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 509.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:34,646 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.76 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.49 ms. Allocated memory is still 203.4 MB. Free memory was 159.7 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 155.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1153.78 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 154.5 MB in the beginning and 165.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19731.04 ms. Allocated memory was 235.9 MB in the beginning and 763.4 MB in the end (delta: 527.4 MB). Free memory was 165.5 MB in the beginning and 183.6 MB in the end (delta: -18.1 MB). Peak memory consumption was 509.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 157 ProgramPointsBefore, 66 ProgramPointsAfterwards, 171 TransitionsBefore, 76 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 4 ChoiceCompositions, 5110 VarBasedMoverChecksPositive, 84 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 20473 CheckedPairsTotal, 117 TotalNumberOfCompositions - PositiveResult [Line: 701]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 708]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 2026 SDtfs, 3388 SDslu, 4622 SDs, 0 SdLazy, 3654 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 634 SyntacticMatches, 125 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6958occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 19019 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 470 NumberOfCodeBlocks, 470 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 30302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 correct! Received shutdown request...