/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:46:36,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:46:36,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:46:37,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:46:37,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:46:37,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:46:37,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:46:37,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:46:37,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:46:37,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:46:37,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:46:37,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:46:37,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:46:37,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:46:37,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:46:37,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:46:37,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:46:37,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:46:37,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:46:37,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:46:37,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:46:37,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:46:37,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:46:37,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:46:37,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:46:37,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:46:37,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:46:37,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:46:37,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:46:37,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:46:37,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:46:37,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:46:37,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:46:37,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:46:37,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:46:37,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:46:37,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:46:37,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:46:37,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:46:37,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:46:37,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:46:37,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-21 11:46:37,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:46:37,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:46:37,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:46:37,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:46:37,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:46:37,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:46:37,102 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:46:37,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:46:37,102 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:46:37,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:46:37,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:46:37,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:46:37,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:46:37,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:46:37,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:46:37,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:46:37,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:46:37,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 11:46:37,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:46:37,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:46:37,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:46:37,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:46:37,410 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:46:37,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2021-08-21 11:46:37,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3485a6e71/eff31770e24b49ef9e67e1289ffbdac3/FLAGb5ff2023c [2021-08-21 11:46:37,900 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:46:37,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2021-08-21 11:46:37,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3485a6e71/eff31770e24b49ef9e67e1289ffbdac3/FLAGb5ff2023c [2021-08-21 11:46:38,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3485a6e71/eff31770e24b49ef9e67e1289ffbdac3 [2021-08-21 11:46:38,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:46:38,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:46:38,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:46:38,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:46:38,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:46:38,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d86a7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38, skipping insertion in model container [2021-08-21 11:46:38,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:46:38,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:46:38,350 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 11:46:38,606 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-21 11:46:38,614 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-21 11:46:38,615 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-21 11:46:38,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-21 11:46:38,682 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-21 11:46:38,684 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-21 11:46:38,686 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-21 11:46:38,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:46:38,701 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:46:38,714 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 11:46:38,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-21 11:46:38,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-21 11:46:38,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-21 11:46:38,745 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-21 11:46:38,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-21 11:46:38,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-21 11:46:38,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-21 11:46:38,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:46:38,811 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:46:38,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38 WrapperNode [2021-08-21 11:46:38,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:46:38,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:46:38,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:46:38,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:46:38,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:46:38,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:46:38,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:46:38,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:46:38,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:46:38,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:46:38,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:46:38,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:46:38,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (1/1) ... [2021-08-21 11:46:38,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:46:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:46:38,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 11:46:38,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 11:46:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-08-21 11:46:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-08-21 11:46:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-08-21 11:46:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-08-21 11:46:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:46:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:46:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 11:46:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:46:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-21 11:46:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:46:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:46:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:46:38,978 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:46:39,375 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:46:39,376 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-08-21 11:46:39,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:46:39 BoogieIcfgContainer [2021-08-21 11:46:39,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:46:39,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:46:39,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:46:39,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:46:39,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:46:38" (1/3) ... [2021-08-21 11:46:39,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c81421a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:46:39, skipping insertion in model container [2021-08-21 11:46:39,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:46:38" (2/3) ... [2021-08-21 11:46:39,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c81421a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:46:39, skipping insertion in model container [2021-08-21 11:46:39,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:46:39" (3/3) ... [2021-08-21 11:46:39,382 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-08-21 11:46:39,385 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:46:39,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:46:39,385 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-08-21 11:46:39,385 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:46:39,412 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,414 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,415 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,426 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,432 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,433 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,434 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,435 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,436 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,437 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,438 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,439 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,440 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,441 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,442 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,446 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,447 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,447 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,447 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,450 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,450 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,451 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:46:39,455 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-21 11:46:39,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:46:39,486 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 11:46:39,486 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-08-21 11:46:39,495 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 206 places, 216 transitions, 448 flow [2021-08-21 11:46:41,487 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 84868 states, 84863 states have (on average 3.2662173149664753) internal successors, (277181), 84867 states have internal predecessors, (277181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 84868 states, 84863 states have (on average 3.2662173149664753) internal successors, (277181), 84867 states have internal predecessors, (277181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-21 11:46:41,974 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:41,975 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:46:41,975 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:46:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1691269654, now seen corresponding path program 1 times [2021-08-21 11:46:41,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:41,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722214425] [2021-08-21 11:46:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:41,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:42,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:42,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722214425] [2021-08-21 11:46:42,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722214425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:42,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:42,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 11:46:42,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613230366] [2021-08-21 11:46:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 11:46:42,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:42,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 11:46:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-21 11:46:42,889 INFO L87 Difference]: Start difference. First operand has 84868 states, 84863 states have (on average 3.2662173149664753) internal successors, (277181), 84867 states have internal predecessors, (277181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:45,907 INFO L93 Difference]: Finished difference Result 94952 states and 292406 transitions. [2021-08-21 11:46:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-21 11:46:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-21 11:46:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:46,402 INFO L225 Difference]: With dead ends: 94952 [2021-08-21 11:46:46,402 INFO L226 Difference]: Without dead ends: 94892 [2021-08-21 11:46:46,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1474.2ms TimeCoverageRelationStatistics Valid=452, Invalid=1270, Unknown=0, NotChecked=0, Total=1722 [2021-08-21 11:46:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94892 states. [2021-08-21 11:46:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94892 to 90308. [2021-08-21 11:46:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90308 states, 90304 states have (on average 3.081768249468462) internal successors, (278296), 90307 states have internal predecessors, (278296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90308 states to 90308 states and 278296 transitions. [2021-08-21 11:46:49,959 INFO L78 Accepts]: Start accepts. Automaton has 90308 states and 278296 transitions. Word has length 80 [2021-08-21 11:46:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:46:49,959 INFO L470 AbstractCegarLoop]: Abstraction has 90308 states and 278296 transitions. [2021-08-21 11:46:49,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 90308 states and 278296 transitions. [2021-08-21 11:46:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:46:50,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:46:50,055 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:46:50,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:46:50,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:46:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:46:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1395660344, now seen corresponding path program 1 times [2021-08-21 11:46:50,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:46:50,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432160861] [2021-08-21 11:46:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:46:50,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:46:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:46:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:46:50,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:46:50,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432160861] [2021-08-21 11:46:50,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432160861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:46:50,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:46:50,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 11:46:50,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255336464] [2021-08-21 11:46:50,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 11:46:50,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:46:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 11:46:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:46:50,615 INFO L87 Difference]: Start difference. First operand 90308 states and 278296 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:46:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:46:56,112 INFO L93 Difference]: Finished difference Result 191833 states and 592521 transitions. [2021-08-21 11:46:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-21 11:46:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:46:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:46:56,775 INFO L225 Difference]: With dead ends: 191833 [2021-08-21 11:46:56,775 INFO L226 Difference]: Without dead ends: 191203 [2021-08-21 11:46:56,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2836.2ms TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2021-08-21 11:46:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191203 states. [2021-08-21 11:47:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191203 to 113045. [2021-08-21 11:47:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113045 states, 113041 states have (on average 3.086340354384692) internal successors, (348883), 113044 states have internal predecessors, (348883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113045 states to 113045 states and 348883 transitions. [2021-08-21 11:47:01,332 INFO L78 Accepts]: Start accepts. Automaton has 113045 states and 348883 transitions. Word has length 85 [2021-08-21 11:47:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:01,332 INFO L470 AbstractCegarLoop]: Abstraction has 113045 states and 348883 transitions. [2021-08-21 11:47:01,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 113045 states and 348883 transitions. [2021-08-21 11:47:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:01,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:01,418 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:47:01,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:47:01,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:47:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1297657036, now seen corresponding path program 2 times [2021-08-21 11:47:01,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:01,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442831281] [2021-08-21 11:47:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:01,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:02,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:02,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442831281] [2021-08-21 11:47:02,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442831281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:02,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:02,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 11:47:02,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243544410] [2021-08-21 11:47:02,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 11:47:02,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 11:47:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:47:02,254 INFO L87 Difference]: Start difference. First operand 113045 states and 348883 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:07,339 INFO L93 Difference]: Finished difference Result 211147 states and 651879 transitions. [2021-08-21 11:47:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-21 11:47:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:08,361 INFO L225 Difference]: With dead ends: 211147 [2021-08-21 11:47:08,361 INFO L226 Difference]: Without dead ends: 210967 [2021-08-21 11:47:08,363 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2687.8ms TimeCoverageRelationStatistics Valid=653, Invalid=1699, Unknown=0, NotChecked=0, Total=2352 [2021-08-21 11:47:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210967 states. [2021-08-21 11:47:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210967 to 111062. [2021-08-21 11:47:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111062 states, 111058 states have (on average 3.0865043490788597) internal successors, (342781), 111061 states have internal predecessors, (342781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111062 states to 111062 states and 342781 transitions. [2021-08-21 11:47:12,567 INFO L78 Accepts]: Start accepts. Automaton has 111062 states and 342781 transitions. Word has length 85 [2021-08-21 11:47:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:12,567 INFO L470 AbstractCegarLoop]: Abstraction has 111062 states and 342781 transitions. [2021-08-21 11:47:12,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 111062 states and 342781 transitions. [2021-08-21 11:47:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:12,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:12,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:47:12,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:47:12,645 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:47:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1331200176, now seen corresponding path program 3 times [2021-08-21 11:47:12,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:12,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376028406] [2021-08-21 11:47:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:12,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:13,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:13,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376028406] [2021-08-21 11:47:13,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376028406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:13,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:13,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 11:47:13,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800225363] [2021-08-21 11:47:13,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 11:47:13,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 11:47:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:47:13,135 INFO L87 Difference]: Start difference. First operand 111062 states and 342781 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:17,988 INFO L93 Difference]: Finished difference Result 198514 states and 613069 transitions. [2021-08-21 11:47:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-21 11:47:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:19,156 INFO L225 Difference]: With dead ends: 198514 [2021-08-21 11:47:19,156 INFO L226 Difference]: Without dead ends: 198388 [2021-08-21 11:47:19,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2701.0ms TimeCoverageRelationStatistics Valid=615, Invalid=1641, Unknown=0, NotChecked=0, Total=2256 [2021-08-21 11:47:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198388 states. [2021-08-21 11:47:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198388 to 110401. [2021-08-21 11:47:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110401 states, 110397 states have (on average 3.0865603231971885) internal successors, (340747), 110400 states have internal predecessors, (340747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110401 states to 110401 states and 340747 transitions. [2021-08-21 11:47:22,951 INFO L78 Accepts]: Start accepts. Automaton has 110401 states and 340747 transitions. Word has length 85 [2021-08-21 11:47:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:22,951 INFO L470 AbstractCegarLoop]: Abstraction has 110401 states and 340747 transitions. [2021-08-21 11:47:22,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 110401 states and 340747 transitions. [2021-08-21 11:47:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-21 11:47:23,437 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:23,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:47:23,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:47:23,438 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:47:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1499481560, now seen corresponding path program 4 times [2021-08-21 11:47:23,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:23,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561661931] [2021-08-21 11:47:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:23,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:23,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:23,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561661931] [2021-08-21 11:47:23,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561661931] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:23,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:23,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-21 11:47:23,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513884000] [2021-08-21 11:47:23,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-21 11:47:23,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-21 11:47:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-08-21 11:47:23,948 INFO L87 Difference]: Start difference. First operand 110401 states and 340747 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:27,383 INFO L93 Difference]: Finished difference Result 144866 states and 446134 transitions. [2021-08-21 11:47:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-21 11:47:27,383 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-21 11:47:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:27,805 INFO L225 Difference]: With dead ends: 144866 [2021-08-21 11:47:27,805 INFO L226 Difference]: Without dead ends: 144110 [2021-08-21 11:47:27,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1790.2ms TimeCoverageRelationStatistics Valid=407, Invalid=1153, Unknown=0, NotChecked=0, Total=1560 [2021-08-21 11:47:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144110 states. [2021-08-21 11:47:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144110 to 105694. [2021-08-21 11:47:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105694 states, 105690 states have (on average 3.0831677547544705) internal successors, (325860), 105693 states have internal predecessors, (325860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105694 states to 105694 states and 325860 transitions. [2021-08-21 11:47:31,126 INFO L78 Accepts]: Start accepts. Automaton has 105694 states and 325860 transitions. Word has length 85 [2021-08-21 11:47:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:31,126 INFO L470 AbstractCegarLoop]: Abstraction has 105694 states and 325860 transitions. [2021-08-21 11:47:31,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 105694 states and 325860 transitions. [2021-08-21 11:47:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:47:31,226 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:31,226 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:47:31,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:47:31,227 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:47:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash -188007250, now seen corresponding path program 1 times [2021-08-21 11:47:31,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:31,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164342048] [2021-08-21 11:47:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:31,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:32,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:32,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164342048] [2021-08-21 11:47:32,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164342048] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:32,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:32,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 11:47:32,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441152711] [2021-08-21 11:47:32,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 11:47:32,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 11:47:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2021-08-21 11:47:32,310 INFO L87 Difference]: Start difference. First operand 105694 states and 325860 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:47:49,461 INFO L93 Difference]: Finished difference Result 139558 states and 429843 transitions. [2021-08-21 11:47:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-21 11:47:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:47:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:47:49,848 INFO L225 Difference]: With dead ends: 139558 [2021-08-21 11:47:49,848 INFO L226 Difference]: Without dead ends: 139558 [2021-08-21 11:47:49,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 12735.0ms TimeCoverageRelationStatistics Valid=3218, Invalid=7702, Unknown=0, NotChecked=0, Total=10920 [2021-08-21 11:47:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139558 states. [2021-08-21 11:47:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139558 to 122194. [2021-08-21 11:47:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122194 states, 122190 states have (on average 3.087486701039365) internal successors, (377260), 122193 states have internal predecessors, (377260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122194 states to 122194 states and 377260 transitions. [2021-08-21 11:47:53,687 INFO L78 Accepts]: Start accepts. Automaton has 122194 states and 377260 transitions. Word has length 103 [2021-08-21 11:47:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:47:53,688 INFO L470 AbstractCegarLoop]: Abstraction has 122194 states and 377260 transitions. [2021-08-21 11:47:53,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:47:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122194 states and 377260 transitions. [2021-08-21 11:47:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:47:53,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:47:53,826 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:47:53,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:47:53,826 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:47:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:47:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1065077806, now seen corresponding path program 2 times [2021-08-21 11:47:53,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:47:53,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071733279] [2021-08-21 11:47:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:47:53,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:47:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:47:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:47:55,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:47:55,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071733279] [2021-08-21 11:47:55,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071733279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:47:55,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:47:55,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 11:47:55,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850634887] [2021-08-21 11:47:55,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 11:47:55,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:47:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 11:47:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-08-21 11:47:55,132 INFO L87 Difference]: Start difference. First operand 122194 states and 377260 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:18,488 INFO L93 Difference]: Finished difference Result 206372 states and 637008 transitions. [2021-08-21 11:48:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-08-21 11:48:18,489 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:48:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:19,189 INFO L225 Difference]: With dead ends: 206372 [2021-08-21 11:48:19,189 INFO L226 Difference]: Without dead ends: 206372 [2021-08-21 11:48:19,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3888 ImplicationChecksByTransitivity, 16890.2ms TimeCoverageRelationStatistics Valid=4926, Invalid=13706, Unknown=0, NotChecked=0, Total=18632 [2021-08-21 11:48:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206372 states. [2021-08-21 11:48:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206372 to 122464. [2021-08-21 11:48:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122464 states, 122460 states have (on average 3.0875632859709294) internal successors, (378103), 122463 states have internal predecessors, (378103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122464 states to 122464 states and 378103 transitions. [2021-08-21 11:48:23,315 INFO L78 Accepts]: Start accepts. Automaton has 122464 states and 378103 transitions. Word has length 103 [2021-08-21 11:48:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:23,316 INFO L470 AbstractCegarLoop]: Abstraction has 122464 states and 378103 transitions. [2021-08-21 11:48:23,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 122464 states and 378103 transitions. [2021-08-21 11:48:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:48:23,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:23,438 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:48:23,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:48:23,438 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:48:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1043367570, now seen corresponding path program 3 times [2021-08-21 11:48:23,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:23,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786573013] [2021-08-21 11:48:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:23,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:24,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:24,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786573013] [2021-08-21 11:48:24,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786573013] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:24,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:24,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 11:48:24,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591990106] [2021-08-21 11:48:24,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 11:48:24,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 11:48:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2021-08-21 11:48:24,652 INFO L87 Difference]: Start difference. First operand 122464 states and 378103 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:48:49,758 INFO L93 Difference]: Finished difference Result 189932 states and 585400 transitions. [2021-08-21 11:48:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-08-21 11:48:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:48:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:48:50,358 INFO L225 Difference]: With dead ends: 189932 [2021-08-21 11:48:50,358 INFO L226 Difference]: Without dead ends: 189932 [2021-08-21 11:48:50,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4609 ImplicationChecksByTransitivity, 18559.3ms TimeCoverageRelationStatistics Valid=5202, Invalid=15678, Unknown=0, NotChecked=0, Total=20880 [2021-08-21 11:48:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189932 states. [2021-08-21 11:48:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189932 to 122854. [2021-08-21 11:48:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122854 states, 122850 states have (on average 3.0876353276353274) internal successors, (379316), 122853 states have internal predecessors, (379316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122854 states to 122854 states and 379316 transitions. [2021-08-21 11:48:54,723 INFO L78 Accepts]: Start accepts. Automaton has 122854 states and 379316 transitions. Word has length 103 [2021-08-21 11:48:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:48:54,723 INFO L470 AbstractCegarLoop]: Abstraction has 122854 states and 379316 transitions. [2021-08-21 11:48:54,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:48:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 122854 states and 379316 transitions. [2021-08-21 11:48:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:48:54,854 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:48:54,854 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:48:54,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:48:54,854 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:48:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:48:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1488904782, now seen corresponding path program 4 times [2021-08-21 11:48:54,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:48:54,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936229293] [2021-08-21 11:48:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:48:54,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:48:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:48:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:48:56,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:48:56,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936229293] [2021-08-21 11:48:56,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936229293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:48:56,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:48:56,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 11:48:56,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545042350] [2021-08-21 11:48:56,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 11:48:56,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:48:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 11:48:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2021-08-21 11:48:56,053 INFO L87 Difference]: Start difference. First operand 122854 states and 379316 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:10,633 INFO L93 Difference]: Finished difference Result 188746 states and 583236 transitions. [2021-08-21 11:49:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-21 11:49:10,633 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:49:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:11,219 INFO L225 Difference]: With dead ends: 188746 [2021-08-21 11:49:11,219 INFO L226 Difference]: Without dead ends: 188746 [2021-08-21 11:49:11,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 10955.3ms TimeCoverageRelationStatistics Valid=2636, Invalid=6106, Unknown=0, NotChecked=0, Total=8742 [2021-08-21 11:49:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188746 states. [2021-08-21 11:49:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188746 to 135106. [2021-08-21 11:49:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135106 states, 135102 states have (on average 3.088732957321135) internal successors, (417294), 135105 states have internal predecessors, (417294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135106 states to 135106 states and 417294 transitions. [2021-08-21 11:49:15,592 INFO L78 Accepts]: Start accepts. Automaton has 135106 states and 417294 transitions. Word has length 103 [2021-08-21 11:49:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:15,593 INFO L470 AbstractCegarLoop]: Abstraction has 135106 states and 417294 transitions. [2021-08-21 11:49:15,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 135106 states and 417294 transitions. [2021-08-21 11:49:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:49:15,750 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:15,750 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:49:15,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:49:15,751 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:49:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash 697617138, now seen corresponding path program 5 times [2021-08-21 11:49:15,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:15,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349173111] [2021-08-21 11:49:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:15,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:17,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:17,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349173111] [2021-08-21 11:49:17,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349173111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:17,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:17,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 11:49:17,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136246167] [2021-08-21 11:49:17,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 11:49:17,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 11:49:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2021-08-21 11:49:17,056 INFO L87 Difference]: Start difference. First operand 135106 states and 417294 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:40,219 INFO L93 Difference]: Finished difference Result 211467 states and 652616 transitions. [2021-08-21 11:49:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-08-21 11:49:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:49:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:40,913 INFO L225 Difference]: With dead ends: 211467 [2021-08-21 11:49:40,914 INFO L226 Difference]: Without dead ends: 211467 [2021-08-21 11:49:40,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4101 ImplicationChecksByTransitivity, 16884.7ms TimeCoverageRelationStatistics Valid=5194, Invalid=14546, Unknown=0, NotChecked=0, Total=19740 [2021-08-21 11:49:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211467 states. [2021-08-21 11:49:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211467 to 122854. [2021-08-21 11:49:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122854 states, 122850 states have (on average 3.0876353276353274) internal successors, (379316), 122853 states have internal predecessors, (379316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122854 states to 122854 states and 379316 transitions. [2021-08-21 11:49:45,327 INFO L78 Accepts]: Start accepts. Automaton has 122854 states and 379316 transitions. Word has length 103 [2021-08-21 11:49:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:49:45,327 INFO L470 AbstractCegarLoop]: Abstraction has 122854 states and 379316 transitions. [2021-08-21 11:49:45,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 122854 states and 379316 transitions. [2021-08-21 11:49:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:49:45,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:49:45,463 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:49:45,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:49:45,464 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:49:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:49:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1858281620, now seen corresponding path program 6 times [2021-08-21 11:49:45,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:49:45,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927583633] [2021-08-21 11:49:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:49:45,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:49:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:49:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:49:46,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:49:46,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927583633] [2021-08-21 11:49:46,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927583633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:49:46,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:49:46,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 11:49:46,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078738932] [2021-08-21 11:49:46,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 11:49:46,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:49:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 11:49:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2021-08-21 11:49:46,615 INFO L87 Difference]: Start difference. First operand 122854 states and 379316 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:49:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:49:58,138 INFO L93 Difference]: Finished difference Result 160606 states and 496090 transitions. [2021-08-21 11:49:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:49:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:49:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:49:58,664 INFO L225 Difference]: With dead ends: 160606 [2021-08-21 11:49:58,664 INFO L226 Difference]: Without dead ends: 160606 [2021-08-21 11:49:58,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 8288.5ms TimeCoverageRelationStatistics Valid=1773, Invalid=4233, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 11:49:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160606 states. [2021-08-21 11:50:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160606 to 134956. [2021-08-21 11:50:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134956 states, 134952 states have (on average 3.0886166933428183) internal successors, (416815), 134955 states have internal predecessors, (416815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134956 states to 134956 states and 416815 transitions. [2021-08-21 11:50:02,524 INFO L78 Accepts]: Start accepts. Automaton has 134956 states and 416815 transitions. Word has length 103 [2021-08-21 11:50:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:02,524 INFO L470 AbstractCegarLoop]: Abstraction has 134956 states and 416815 transitions. [2021-08-21 11:50:02,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 134956 states and 416815 transitions. [2021-08-21 11:50:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:50:02,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:02,675 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:50:02,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:50:02,675 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:50:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash -250163756, now seen corresponding path program 7 times [2021-08-21 11:50:02,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:02,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102370271] [2021-08-21 11:50:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:02,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:03,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:03,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102370271] [2021-08-21 11:50:03,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102370271] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:03,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:03,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-21 11:50:03,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862380458] [2021-08-21 11:50:03,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-21 11:50:03,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-21 11:50:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2021-08-21 11:50:03,880 INFO L87 Difference]: Start difference. First operand 134956 states and 416815 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:27,504 INFO L93 Difference]: Finished difference Result 201267 states and 621658 transitions. [2021-08-21 11:50:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-08-21 11:50:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:50:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:28,193 INFO L225 Difference]: With dead ends: 201267 [2021-08-21 11:50:28,193 INFO L226 Difference]: Without dead ends: 201267 [2021-08-21 11:50:28,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4344 ImplicationChecksByTransitivity, 17214.2ms TimeCoverageRelationStatistics Valid=5456, Invalid=15714, Unknown=0, NotChecked=0, Total=21170 [2021-08-21 11:50:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201267 states. [2021-08-21 11:50:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201267 to 122854. [2021-08-21 11:50:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122854 states, 122850 states have (on average 3.0876353276353274) internal successors, (379316), 122853 states have internal predecessors, (379316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122854 states to 122854 states and 379316 transitions. [2021-08-21 11:50:32,489 INFO L78 Accepts]: Start accepts. Automaton has 122854 states and 379316 transitions. Word has length 103 [2021-08-21 11:50:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:32,489 INFO L470 AbstractCegarLoop]: Abstraction has 122854 states and 379316 transitions. [2021-08-21 11:50:32,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 122854 states and 379316 transitions. [2021-08-21 11:50:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-21 11:50:32,614 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:32,614 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:50:32,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:50:32,614 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:50:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1291088936, now seen corresponding path program 8 times [2021-08-21 11:50:32,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:32,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600658289] [2021-08-21 11:50:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:32,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:50:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:50:33,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:50:33,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600658289] [2021-08-21 11:50:33,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600658289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:50:33,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:50:33,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-21 11:50:33,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373410768] [2021-08-21 11:50:33,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-21 11:50:33,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:50:33,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-21 11:50:33,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2021-08-21 11:50:33,733 INFO L87 Difference]: Start difference. First operand 122854 states and 379316 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:50:54,648 INFO L93 Difference]: Finished difference Result 172160 states and 530686 transitions. [2021-08-21 11:50:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-08-21 11:50:54,648 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-21 11:50:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:50:55,138 INFO L225 Difference]: With dead ends: 172160 [2021-08-21 11:50:55,139 INFO L226 Difference]: Without dead ends: 172160 [2021-08-21 11:50:55,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3583 ImplicationChecksByTransitivity, 15352.3ms TimeCoverageRelationStatistics Valid=4806, Invalid=13284, Unknown=0, NotChecked=0, Total=18090 [2021-08-21 11:50:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172160 states. [2021-08-21 11:50:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172160 to 126076. [2021-08-21 11:50:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126076 states, 126072 states have (on average 3.0865616473126467) internal successors, (389129), 126075 states have internal predecessors, (389129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126076 states to 126076 states and 389129 transitions. [2021-08-21 11:50:59,467 INFO L78 Accepts]: Start accepts. Automaton has 126076 states and 389129 transitions. Word has length 103 [2021-08-21 11:50:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:50:59,468 INFO L470 AbstractCegarLoop]: Abstraction has 126076 states and 389129 transitions. [2021-08-21 11:50:59,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:50:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 126076 states and 389129 transitions. [2021-08-21 11:50:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:50:59,630 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:50:59,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:50:59,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:50:59,630 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:50:59,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:50:59,631 INFO L82 PathProgramCache]: Analyzing trace with hash -883897449, now seen corresponding path program 1 times [2021-08-21 11:50:59,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:50:59,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737258851] [2021-08-21 11:50:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:50:59,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:50:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:01,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:01,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737258851] [2021-08-21 11:51:01,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737258851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:01,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:01,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:51:01,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367134501] [2021-08-21 11:51:01,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:51:01,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:01,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:51:01,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:51:01,176 INFO L87 Difference]: Start difference. First operand 126076 states and 389129 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:11,263 INFO L93 Difference]: Finished difference Result 264868 states and 818709 transitions. [2021-08-21 11:51:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:51:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:51:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:12,508 INFO L225 Difference]: With dead ends: 264868 [2021-08-21 11:51:12,508 INFO L226 Difference]: Without dead ends: 264868 [2021-08-21 11:51:12,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 4982.0ms TimeCoverageRelationStatistics Valid=1164, Invalid=5478, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:51:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264868 states. [2021-08-21 11:51:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264868 to 181528. [2021-08-21 11:51:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181528 states, 181524 states have (on average 3.0865505387717325) internal successors, (560283), 181527 states have internal predecessors, (560283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181528 states to 181528 states and 560283 transitions. [2021-08-21 11:51:18,122 INFO L78 Accepts]: Start accepts. Automaton has 181528 states and 560283 transitions. Word has length 106 [2021-08-21 11:51:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:18,123 INFO L470 AbstractCegarLoop]: Abstraction has 181528 states and 560283 transitions. [2021-08-21 11:51:18,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 181528 states and 560283 transitions. [2021-08-21 11:51:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:51:18,342 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:18,342 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:51:18,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 11:51:18,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:51:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2082730985, now seen corresponding path program 2 times [2021-08-21 11:51:18,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:18,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459149720] [2021-08-21 11:51:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:18,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:19,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:19,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459149720] [2021-08-21 11:51:19,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459149720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:19,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:19,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:51:19,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333108784] [2021-08-21 11:51:19,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:51:19,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:19,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:51:19,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:51:19,798 INFO L87 Difference]: Start difference. First operand 181528 states and 560283 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:30,934 INFO L93 Difference]: Finished difference Result 335830 states and 1038440 transitions. [2021-08-21 11:51:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:51:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:51:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:32,193 INFO L225 Difference]: With dead ends: 335830 [2021-08-21 11:51:32,193 INFO L226 Difference]: Without dead ends: 335830 [2021-08-21 11:51:32,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5253.3ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:51:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335830 states. [2021-08-21 11:51:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335830 to 182938. [2021-08-21 11:51:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182938 states, 182934 states have (on average 3.0864683437742575) internal successors, (564620), 182937 states have internal predecessors, (564620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182938 states to 182938 states and 564620 transitions. [2021-08-21 11:51:38,553 INFO L78 Accepts]: Start accepts. Automaton has 182938 states and 564620 transitions. Word has length 106 [2021-08-21 11:51:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:38,553 INFO L470 AbstractCegarLoop]: Abstraction has 182938 states and 564620 transitions. [2021-08-21 11:51:38,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 182938 states and 564620 transitions. [2021-08-21 11:51:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:51:38,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:38,783 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:51:38,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 11:51:38,784 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:51:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1665972649, now seen corresponding path program 3 times [2021-08-21 11:51:38,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:38,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892291349] [2021-08-21 11:51:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:38,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:51:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:51:40,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:51:40,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892291349] [2021-08-21 11:51:40,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892291349] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:51:40,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:51:40,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:51:40,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246649136] [2021-08-21 11:51:40,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:51:40,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:51:40,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:51:40,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:51:40,194 INFO L87 Difference]: Start difference. First operand 182938 states and 564620 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:51:51,616 INFO L93 Difference]: Finished difference Result 340390 states and 1051162 transitions. [2021-08-21 11:51:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:51:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:51:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:51:53,119 INFO L225 Difference]: With dead ends: 340390 [2021-08-21 11:51:53,119 INFO L226 Difference]: Without dead ends: 340390 [2021-08-21 11:51:53,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 5419.2ms TimeCoverageRelationStatistics Valid=1239, Invalid=5733, Unknown=0, NotChecked=0, Total=6972 [2021-08-21 11:51:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340390 states. [2021-08-21 11:51:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340390 to 183718. [2021-08-21 11:51:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:51:59,478 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:51:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:51:59,479 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:51:59,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:51:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:51:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:51:59,675 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:51:59,675 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:51:59,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 11:51:59,676 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:51:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:51:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1885157345, now seen corresponding path program 4 times [2021-08-21 11:51:59,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:51:59,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339156723] [2021-08-21 11:51:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:51:59,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:51:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:00,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:00,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339156723] [2021-08-21 11:52:00,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339156723] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:00,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:00,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:52:00,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874962472] [2021-08-21 11:52:00,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:52:00,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:52:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:52:00,966 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:11,641 INFO L93 Difference]: Finished difference Result 323560 states and 999721 transitions. [2021-08-21 11:52:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:52:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:52:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:13,037 INFO L225 Difference]: With dead ends: 323560 [2021-08-21 11:52:13,037 INFO L226 Difference]: Without dead ends: 323560 [2021-08-21 11:52:13,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 5231.4ms TimeCoverageRelationStatistics Valid=1177, Invalid=5629, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:52:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323560 states. [2021-08-21 11:52:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323560 to 183718. [2021-08-21 11:52:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:52:19,104 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:52:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:19,104 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:52:19,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:52:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:52:19,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:19,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:52:19,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 11:52:19,334 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:52:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash -141007891, now seen corresponding path program 5 times [2021-08-21 11:52:19,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:19,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675371663] [2021-08-21 11:52:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:19,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:20,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:20,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675371663] [2021-08-21 11:52:20,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675371663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:20,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:20,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:52:20,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663219695] [2021-08-21 11:52:20,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:52:20,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:52:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:52:20,787 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:32,165 INFO L93 Difference]: Finished difference Result 327310 states and 1011846 transitions. [2021-08-21 11:52:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:52:32,166 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:52:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:33,609 INFO L225 Difference]: With dead ends: 327310 [2021-08-21 11:52:33,609 INFO L226 Difference]: Without dead ends: 327310 [2021-08-21 11:52:33,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 5110.9ms TimeCoverageRelationStatistics Valid=1222, Invalid=5750, Unknown=0, NotChecked=0, Total=6972 [2021-08-21 11:52:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327310 states. [2021-08-21 11:52:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327310 to 183718. [2021-08-21 11:52:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:52:40,132 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:52:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:52:40,133 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:52:40,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:52:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:52:40,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:52:40,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:52:40,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 11:52:40,430 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:52:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:52:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1386556415, now seen corresponding path program 6 times [2021-08-21 11:52:40,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:52:40,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899498320] [2021-08-21 11:52:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:52:40,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:52:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:52:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:52:42,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:52:42,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899498320] [2021-08-21 11:52:42,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899498320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:52:42,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:52:42,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:52:42,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896236167] [2021-08-21 11:52:42,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:52:42,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:52:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:52:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:52:42,183 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:52:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:52:53,507 INFO L93 Difference]: Finished difference Result 334060 states and 1033071 transitions. [2021-08-21 11:52:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:52:53,508 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:52:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:52:54,696 INFO L225 Difference]: With dead ends: 334060 [2021-08-21 11:52:54,697 INFO L226 Difference]: Without dead ends: 334060 [2021-08-21 11:52:54,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 5376.2ms TimeCoverageRelationStatistics Valid=1181, Invalid=5625, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:52:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334060 states. [2021-08-21 11:52:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334060 to 183718. [2021-08-21 11:53:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:53:01,043 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:53:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:01,043 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:53:01,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:53:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:53:01,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:01,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:53:01,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 11:53:01,284 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:53:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 412610391, now seen corresponding path program 7 times [2021-08-21 11:53:01,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:01,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104436621] [2021-08-21 11:53:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:01,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:02,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:02,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104436621] [2021-08-21 11:53:02,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104436621] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:02,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:02,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:53:02,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898723233] [2021-08-21 11:53:02,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:53:02,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:53:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:53:02,667 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:13,448 INFO L93 Difference]: Finished difference Result 340810 states and 1053546 transitions. [2021-08-21 11:53:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:53:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:53:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:14,979 INFO L225 Difference]: With dead ends: 340810 [2021-08-21 11:53:14,980 INFO L226 Difference]: Without dead ends: 340810 [2021-08-21 11:53:14,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5447.4ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:53:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340810 states. [2021-08-21 11:53:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340810 to 183718. [2021-08-21 11:53:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:53:22,261 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:53:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:22,262 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:53:22,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:53:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:53:23,064 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:23,064 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:53:23,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 11:53:23,065 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:53:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1426804225, now seen corresponding path program 8 times [2021-08-21 11:53:23,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:23,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24897189] [2021-08-21 11:53:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:23,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:24,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:24,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24897189] [2021-08-21 11:53:24,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24897189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:24,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:24,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:53:24,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427352533] [2021-08-21 11:53:24,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:53:24,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:24,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:53:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:53:24,692 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:35,209 INFO L93 Difference]: Finished difference Result 344560 states and 1064921 transitions. [2021-08-21 11:53:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:53:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:53:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:36,720 INFO L225 Difference]: With dead ends: 344560 [2021-08-21 11:53:36,720 INFO L226 Difference]: Without dead ends: 344560 [2021-08-21 11:53:36,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5213.0ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:53:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344560 states. [2021-08-21 11:53:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344560 to 183718. [2021-08-21 11:53:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:53:43,087 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:53:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:53:43,087 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:53:43,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:53:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:53:43,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:53:43,718 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:53:43,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 11:53:43,718 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:53:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:53:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash 668528463, now seen corresponding path program 9 times [2021-08-21 11:53:43,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:53:43,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610665250] [2021-08-21 11:53:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:53:43,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:53:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:53:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:53:44,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:53:44,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610665250] [2021-08-21 11:53:44,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610665250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:53:44,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:53:44,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:53:44,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141504267] [2021-08-21 11:53:44,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:53:44,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:53:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:53:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:53:44,913 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:53:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:53:55,741 INFO L93 Difference]: Finished difference Result 346060 states and 1069471 transitions. [2021-08-21 11:53:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:53:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:53:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:53:57,260 INFO L225 Difference]: With dead ends: 346060 [2021-08-21 11:53:57,260 INFO L226 Difference]: Without dead ends: 346060 [2021-08-21 11:53:57,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5053.1ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:53:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346060 states. [2021-08-21 11:54:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346060 to 183718. [2021-08-21 11:54:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183718 states, 183714 states have (on average 3.0864060441773624) internal successors, (567016), 183717 states have internal predecessors, (567016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183718 states to 183718 states and 567016 transitions. [2021-08-21 11:54:04,268 INFO L78 Accepts]: Start accepts. Automaton has 183718 states and 567016 transitions. Word has length 106 [2021-08-21 11:54:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:04,268 INFO L470 AbstractCegarLoop]: Abstraction has 183718 states and 567016 transitions. [2021-08-21 11:54:04,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 183718 states and 567016 transitions. [2021-08-21 11:54:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:54:04,927 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:04,927 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:54:04,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 11:54:04,927 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:54:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2115890147, now seen corresponding path program 10 times [2021-08-21 11:54:04,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:04,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364113186] [2021-08-21 11:54:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:04,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:06,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:06,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364113186] [2021-08-21 11:54:06,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364113186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:06,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:06,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:54:06,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046094886] [2021-08-21 11:54:06,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:54:06,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:06,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:54:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:54:06,076 INFO L87 Difference]: Start difference. First operand 183718 states and 567016 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:16,642 INFO L93 Difference]: Finished difference Result 333310 states and 1030046 transitions. [2021-08-21 11:54:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:54:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:54:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:17,828 INFO L225 Difference]: With dead ends: 333310 [2021-08-21 11:54:17,828 INFO L226 Difference]: Without dead ends: 333310 [2021-08-21 11:54:17,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5002.2ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:54:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333310 states. [2021-08-21 11:54:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333310 to 181018. [2021-08-21 11:54:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181018 states, 181014 states have (on average 3.086866209243484) internal successors, (558766), 181017 states have internal predecessors, (558766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181018 states to 181018 states and 558766 transitions. [2021-08-21 11:54:24,139 INFO L78 Accepts]: Start accepts. Automaton has 181018 states and 558766 transitions. Word has length 106 [2021-08-21 11:54:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:24,139 INFO L470 AbstractCegarLoop]: Abstraction has 181018 states and 558766 transitions. [2021-08-21 11:54:24,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 181018 states and 558766 transitions. [2021-08-21 11:54:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:54:24,370 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:24,370 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:54:24,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-21 11:54:24,370 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:54:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1862605843, now seen corresponding path program 11 times [2021-08-21 11:54:24,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:24,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213526253] [2021-08-21 11:54:24,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:24,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:25,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:25,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213526253] [2021-08-21 11:54:25,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213526253] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:25,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:25,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:54:25,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596432112] [2021-08-21 11:54:25,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:54:25,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:54:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:54:25,704 INFO L87 Difference]: Start difference. First operand 181018 states and 558766 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:36,387 INFO L93 Difference]: Finished difference Result 349756 states and 1081632 transitions. [2021-08-21 11:54:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:54:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:54:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:54:38,080 INFO L225 Difference]: With dead ends: 349756 [2021-08-21 11:54:38,081 INFO L226 Difference]: Without dead ends: 349756 [2021-08-21 11:54:38,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 4986.2ms TimeCoverageRelationStatistics Valid=1167, Invalid=5475, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:54:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349756 states. [2021-08-21 11:54:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349756 to 179254. [2021-08-21 11:54:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179254 states, 179250 states have (on average 3.083821478382148) internal successors, (552775), 179253 states have internal predecessors, (552775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179254 states to 179254 states and 552775 transitions. [2021-08-21 11:54:45,056 INFO L78 Accepts]: Start accepts. Automaton has 179254 states and 552775 transitions. Word has length 106 [2021-08-21 11:54:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:54:45,057 INFO L470 AbstractCegarLoop]: Abstraction has 179254 states and 552775 transitions. [2021-08-21 11:54:45,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 179254 states and 552775 transitions. [2021-08-21 11:54:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:54:45,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:54:45,886 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:54:45,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-21 11:54:45,887 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:54:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:54:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2015603117, now seen corresponding path program 12 times [2021-08-21 11:54:45,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:54:45,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129375047] [2021-08-21 11:54:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:54:45,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:54:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:54:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:54:47,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:54:47,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129375047] [2021-08-21 11:54:47,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129375047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:54:47,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:54:47,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:54:47,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613577661] [2021-08-21 11:54:47,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:54:47,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:54:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:54:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:54:47,242 INFO L87 Difference]: Start difference. First operand 179254 states and 552775 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:54:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:54:59,164 INFO L93 Difference]: Finished difference Result 379996 states and 1173390 transitions. [2021-08-21 11:54:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:54:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:54:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:00,628 INFO L225 Difference]: With dead ends: 379996 [2021-08-21 11:55:00,628 INFO L226 Difference]: Without dead ends: 379996 [2021-08-21 11:55:00,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5530.9ms TimeCoverageRelationStatistics Valid=1257, Invalid=5883, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 11:55:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379996 states. [2021-08-21 11:55:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379996 to 179554. [2021-08-21 11:55:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179554 states, 179550 states have (on average 3.0839042049568364) internal successors, (553715), 179553 states have internal predecessors, (553715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179554 states to 179554 states and 553715 transitions. [2021-08-21 11:55:07,452 INFO L78 Accepts]: Start accepts. Automaton has 179554 states and 553715 transitions. Word has length 106 [2021-08-21 11:55:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:07,453 INFO L470 AbstractCegarLoop]: Abstraction has 179554 states and 553715 transitions. [2021-08-21 11:55:07,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 179554 states and 553715 transitions. [2021-08-21 11:55:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:55:08,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:08,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:55:08,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-21 11:55:08,091 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:55:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1535526877, now seen corresponding path program 13 times [2021-08-21 11:55:08,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:08,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276331651] [2021-08-21 11:55:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:08,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:09,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:09,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276331651] [2021-08-21 11:55:09,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276331651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:09,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:09,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-08-21 11:55:09,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681010663] [2021-08-21 11:55:09,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-21 11:55:09,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-21 11:55:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2021-08-21 11:55:09,243 INFO L87 Difference]: Start difference. First operand 179554 states and 553715 transitions. Second operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:21,380 INFO L93 Difference]: Finished difference Result 348346 states and 1076605 transitions. [2021-08-21 11:55:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:55:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:55:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:22,626 INFO L225 Difference]: With dead ends: 348346 [2021-08-21 11:55:22,626 INFO L226 Difference]: Without dead ends: 348346 [2021-08-21 11:55:22,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 5482.5ms TimeCoverageRelationStatistics Valid=1306, Invalid=6004, Unknown=0, NotChecked=0, Total=7310 [2021-08-21 11:55:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348346 states. [2021-08-21 11:55:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348346 to 179524. [2021-08-21 11:55:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179524 states, 179520 states have (on average 3.0839126559714796) internal successors, (553624), 179523 states have internal predecessors, (553624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179524 states to 179524 states and 553624 transitions. [2021-08-21 11:55:29,930 INFO L78 Accepts]: Start accepts. Automaton has 179524 states and 553624 transitions. Word has length 106 [2021-08-21 11:55:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:29,931 INFO L470 AbstractCegarLoop]: Abstraction has 179524 states and 553624 transitions. [2021-08-21 11:55:29,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 179524 states and 553624 transitions. [2021-08-21 11:55:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:55:30,202 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:30,202 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:55:30,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-21 11:55:30,203 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:55:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash -490638359, now seen corresponding path program 14 times [2021-08-21 11:55:30,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:30,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156103415] [2021-08-21 11:55:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:30,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:31,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:31,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156103415] [2021-08-21 11:55:31,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156103415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:31,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:31,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-08-21 11:55:31,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658912507] [2021-08-21 11:55:31,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-21 11:55:31,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-21 11:55:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2021-08-21 11:55:31,953 INFO L87 Difference]: Start difference. First operand 179524 states and 553624 transitions. Second operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:55:44,221 INFO L93 Difference]: Finished difference Result 349756 states and 1081632 transitions. [2021-08-21 11:55:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:55:44,221 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:55:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:55:45,765 INFO L225 Difference]: With dead ends: 349756 [2021-08-21 11:55:45,765 INFO L226 Difference]: Without dead ends: 349756 [2021-08-21 11:55:45,765 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 6126.8ms TimeCoverageRelationStatistics Valid=1354, Invalid=6128, Unknown=0, NotChecked=0, Total=7482 [2021-08-21 11:55:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349756 states. [2021-08-21 11:55:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349756 to 179284. [2021-08-21 11:55:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179284 states, 179280 states have (on average 3.0838130298973674) internal successors, (552866), 179283 states have internal predecessors, (552866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179284 states to 179284 states and 552866 transitions. [2021-08-21 11:55:52,222 INFO L78 Accepts]: Start accepts. Automaton has 179284 states and 552866 transitions. Word has length 106 [2021-08-21 11:55:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:55:52,222 INFO L470 AbstractCegarLoop]: Abstraction has 179284 states and 552866 transitions. [2021-08-21 11:55:52,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:55:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 179284 states and 552866 transitions. [2021-08-21 11:55:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:55:52,465 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:55:52,465 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:55:52,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-21 11:55:52,465 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:55:52,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:55:52,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1036925947, now seen corresponding path program 15 times [2021-08-21 11:55:52,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:55:52,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873659050] [2021-08-21 11:55:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:55:52,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:55:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:55:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:55:53,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:55:53,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873659050] [2021-08-21 11:55:53,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873659050] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:55:53,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:55:53,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:55:53,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978058391] [2021-08-21 11:55:53,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:55:53,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:55:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:55:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:55:53,880 INFO L87 Difference]: Start difference. First operand 179284 states and 552866 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:05,255 INFO L93 Difference]: Finished difference Result 356506 states and 1102857 transitions. [2021-08-21 11:56:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:56:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:56:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:06,564 INFO L225 Difference]: With dead ends: 356506 [2021-08-21 11:56:06,564 INFO L226 Difference]: Without dead ends: 356506 [2021-08-21 11:56:06,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 5246.1ms TimeCoverageRelationStatistics Valid=1183, Invalid=5623, Unknown=0, NotChecked=0, Total=6806 [2021-08-21 11:56:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356506 states. [2021-08-21 11:56:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356506 to 179194. [2021-08-21 11:56:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179194 states, 179190 states have (on average 3.083838383838384) internal successors, (552593), 179193 states have internal predecessors, (552593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179194 states to 179194 states and 552593 transitions. [2021-08-21 11:56:13,653 INFO L78 Accepts]: Start accepts. Automaton has 179194 states and 552593 transitions. Word has length 106 [2021-08-21 11:56:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:13,653 INFO L470 AbstractCegarLoop]: Abstraction has 179194 states and 552593 transitions. [2021-08-21 11:56:13,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 179194 states and 552593 transitions. [2021-08-21 11:56:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:56:13,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:13,911 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:56:13,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-21 11:56:13,911 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:56:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 62979923, now seen corresponding path program 16 times [2021-08-21 11:56:13,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:13,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241503367] [2021-08-21 11:56:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:13,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:15,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:15,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241503367] [2021-08-21 11:56:15,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241503367] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:15,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:15,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:56:15,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301043825] [2021-08-21 11:56:15,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:56:15,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:56:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:56:15,595 INFO L87 Difference]: Start difference. First operand 179194 states and 552593 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:26,205 INFO L93 Difference]: Finished difference Result 342256 states and 1058132 transitions. [2021-08-21 11:56:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:56:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:56:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:27,740 INFO L225 Difference]: With dead ends: 342256 [2021-08-21 11:56:27,741 INFO L226 Difference]: Without dead ends: 342256 [2021-08-21 11:56:27,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 5135.0ms TimeCoverageRelationStatistics Valid=1167, Invalid=5475, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:56:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342256 states. [2021-08-21 11:56:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342256 to 179074. [2021-08-21 11:56:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179074 states, 179070 states have (on average 3.0838722287373654) internal successors, (552229), 179073 states have internal predecessors, (552229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179074 states to 179074 states and 552229 transitions. [2021-08-21 11:56:34,308 INFO L78 Accepts]: Start accepts. Automaton has 179074 states and 552229 transitions. Word has length 106 [2021-08-21 11:56:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:34,309 INFO L470 AbstractCegarLoop]: Abstraction has 179074 states and 552229 transitions. [2021-08-21 11:56:34,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 179074 states and 552229 transitions. [2021-08-21 11:56:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:56:34,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:34,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:56:34,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-21 11:56:34,555 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:56:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1636996593, now seen corresponding path program 17 times [2021-08-21 11:56:34,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:34,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484773331] [2021-08-21 11:56:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:34,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:35,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:35,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484773331] [2021-08-21 11:56:35,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484773331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:35,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:35,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 11:56:35,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815416021] [2021-08-21 11:56:35,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 11:56:35,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 11:56:35,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 11:56:35,931 INFO L87 Difference]: Start difference. First operand 179074 states and 552229 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:56:46,657 INFO L93 Difference]: Finished difference Result 328276 states and 1014946 transitions. [2021-08-21 11:56:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-21 11:56:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:56:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:56:48,185 INFO L225 Difference]: With dead ends: 328276 [2021-08-21 11:56:48,185 INFO L226 Difference]: Without dead ends: 328276 [2021-08-21 11:56:48,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 5006.4ms TimeCoverageRelationStatistics Valid=1167, Invalid=5475, Unknown=0, NotChecked=0, Total=6642 [2021-08-21 11:56:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328276 states. [2021-08-21 11:56:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328276 to 179134. [2021-08-21 11:56:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179134 states, 179130 states have (on average 3.083855300619662) internal successors, (552411), 179133 states have internal predecessors, (552411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179134 states to 179134 states and 552411 transitions. [2021-08-21 11:56:55,181 INFO L78 Accepts]: Start accepts. Automaton has 179134 states and 552411 transitions. Word has length 106 [2021-08-21 11:56:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:56:55,182 INFO L470 AbstractCegarLoop]: Abstraction has 179134 states and 552411 transitions. [2021-08-21 11:56:55,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:56:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 179134 states and 552411 transitions. [2021-08-21 11:56:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:56:55,466 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:56:55,466 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:56:55,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-21 11:56:55,466 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:56:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:56:55,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2053754929, now seen corresponding path program 18 times [2021-08-21 11:56:55,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:56:55,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767074410] [2021-08-21 11:56:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:56:55,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:56:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:56:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:56:57,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:56:57,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767074410] [2021-08-21 11:56:57,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767074410] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:56:57,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:56:57,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-21 11:56:57,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927804057] [2021-08-21 11:56:57,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-21 11:56:57,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:56:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-21 11:56:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-21 11:56:57,185 INFO L87 Difference]: Start difference. First operand 179134 states and 552411 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:09,046 INFO L93 Difference]: Finished difference Result 366016 states and 1130204 transitions. [2021-08-21 11:57:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-21 11:57:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:57:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:10,747 INFO L225 Difference]: With dead ends: 366016 [2021-08-21 11:57:10,747 INFO L226 Difference]: Without dead ends: 366016 [2021-08-21 11:57:10,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 6012.6ms TimeCoverageRelationStatistics Valid=1257, Invalid=5883, Unknown=0, NotChecked=0, Total=7140 [2021-08-21 11:57:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366016 states. [2021-08-21 11:57:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366016 to 179434. [2021-08-21 11:57:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179434 states, 179430 states have (on average 3.083938025971131) internal successors, (553351), 179433 states have internal predecessors, (553351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179434 states to 179434 states and 553351 transitions. [2021-08-21 11:57:17,716 INFO L78 Accepts]: Start accepts. Automaton has 179434 states and 553351 transitions. Word has length 106 [2021-08-21 11:57:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:17,716 INFO L470 AbstractCegarLoop]: Abstraction has 179434 states and 553351 transitions. [2021-08-21 11:57:17,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 179434 states and 553351 transitions. [2021-08-21 11:57:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:57:17,956 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:17,957 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:57:17,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-21 11:57:17,957 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:57:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1309917627, now seen corresponding path program 19 times [2021-08-21 11:57:17,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:17,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173076085] [2021-08-21 11:57:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:17,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:19,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:19,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173076085] [2021-08-21 11:57:19,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173076085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:19,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:19,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-08-21 11:57:19,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324682088] [2021-08-21 11:57:19,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-21 11:57:19,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-21 11:57:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2021-08-21 11:57:19,300 INFO L87 Difference]: Start difference. First operand 179434 states and 553351 transitions. Second operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:57:31,184 INFO L93 Difference]: Finished difference Result 334366 states and 1033419 transitions. [2021-08-21 11:57:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-21 11:57:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-21 11:57:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:57:32,553 INFO L225 Difference]: With dead ends: 334366 [2021-08-21 11:57:32,553 INFO L226 Difference]: Without dead ends: 334366 [2021-08-21 11:57:32,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 5650.9ms TimeCoverageRelationStatistics Valid=1306, Invalid=6004, Unknown=0, NotChecked=0, Total=7310 [2021-08-21 11:57:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334366 states. [2021-08-21 11:57:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334366 to 179404. [2021-08-21 11:57:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179404 states, 179400 states have (on average 3.0839464882943144) internal successors, (553260), 179403 states have internal predecessors, (553260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179404 states to 179404 states and 553260 transitions. [2021-08-21 11:57:38,955 INFO L78 Accepts]: Start accepts. Automaton has 179404 states and 553260 transitions. Word has length 106 [2021-08-21 11:57:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:57:38,955 INFO L470 AbstractCegarLoop]: Abstraction has 179404 states and 553260 transitions. [2021-08-21 11:57:38,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:57:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 179404 states and 553260 transitions. [2021-08-21 11:57:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-21 11:57:39,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:57:39,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:57:39,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-21 11:57:39,224 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-08-21 11:57:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:57:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash -716247609, now seen corresponding path program 20 times [2021-08-21 11:57:39,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:57:39,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250780121] [2021-08-21 11:57:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:57:39,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:57:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:57:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:57:40,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:57:40,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250780121] [2021-08-21 11:57:40,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250780121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:57:40,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:57:40,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-08-21 11:57:40,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180896445] [2021-08-21 11:57:40,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-21 11:57:40,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:57:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-21 11:57:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2021-08-21 11:57:40,951 INFO L87 Difference]: Start difference. First operand 179404 states and 553260 transitions. Second operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-08-21 11:57:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:57:41,038 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-21 11:57:41,039 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). [2021-08-21 11:57:41,040 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,046 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,049 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:57:41,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-08-21 11:57:41,080 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:57:41,080 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:57:41,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:57:41 BasicIcfg [2021-08-21 11:57:41,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:57:41,084 INFO L168 Benchmark]: Toolchain (without parser) took 662865.98 ms. Allocated memory was 206.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 169.7 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,084 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 206.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:57:41,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.92 ms. Allocated memory is still 206.6 MB. Free memory was 169.5 MB in the beginning and 165.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 206.6 MB. Free memory was 165.9 MB in the beginning and 162.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,085 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 ms. Allocated memory is still 206.6 MB. Free memory was 162.7 MB in the beginning and 160.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,085 INFO L168 Benchmark]: RCFGBuilder took 459.70 ms. Allocated memory is still 206.6 MB. Free memory was 160.6 MB in the beginning and 116.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,085 INFO L168 Benchmark]: TraceAbstraction took 661704.71 ms. Allocated memory was 206.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 116.1 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. [2021-08-21 11:57:41,087 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 206.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 591.92 ms. Allocated memory is still 206.6 MB. Free memory was 169.5 MB in the beginning and 165.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 206.6 MB. Free memory was 165.9 MB in the beginning and 162.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.46 ms. Allocated memory is still 206.6 MB. Free memory was 162.7 MB in the beginning and 160.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 459.70 ms. Allocated memory is still 206.6 MB. Free memory was 160.6 MB in the beginning and 116.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 661704.71 ms. Allocated memory was 206.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 116.1 MB in the beginning and 5.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (179404states) and FLOYD_HOARE automaton (currently 3 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (11 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 311 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 661573.4ms, OverallIterations: 33, TraceHistogramMax: 1, EmptinessCheckTime: 9450.5ms, AutomataDifference: 429370.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2001.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 40780 SDtfs, 110738 SDslu, 584050 SDs, 0 SdLazy, 249376 SolverSat, 3088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100052.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2951 GetRequests, 152 SyntacticMatches, 32 SemanticMatches, 2767 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47710 ImplicationChecksByTransitivity, 230499.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=183718occurred in iteration=16, InterpolantAutomatonStates: 1852, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 178816.9ms AutomataMinimizationTime, 32 MinimizatonAttempts, 3770466 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 98.7ms SsaConstructionTime, 1250.8ms SatisfiabilityAnalysisTime, 40184.0ms InterpolantComputationTime, 3364 NumberOfCodeBlocks, 3364 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3331 ConstructedInterpolants, 0 QuantifiedInterpolants, 51356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2021-08-21 11:57:41,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 !SESSION 2021-08-21 11:46:35.836 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.12 java.vendor=Debian BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i Command-line arguments: -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i !ENTRY org.eclipse.osgi 4 0 2021-08-21 11:57:41.350 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3485a6e71/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438)