/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 10:55:38,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 10:55:38,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 10:55:38,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 10:55:38,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 10:55:38,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 10:55:38,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 10:55:38,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 10:55:38,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 10:55:38,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 10:55:38,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 10:55:38,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 10:55:38,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 10:55:38,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 10:55:38,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 10:55:38,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 10:55:38,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 10:55:38,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 10:55:38,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 10:55:38,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 10:55:38,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 10:55:38,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 10:55:38,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 10:55:38,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 10:55:38,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 10:55:38,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 10:55:38,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 10:55:38,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 10:55:38,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 10:55:38,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 10:55:38,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 10:55:38,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 10:55:38,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 10:55:38,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 10:55:38,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 10:55:38,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 10:55:38,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 10:55:38,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 10:55:38,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 10:55:38,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 10:55:38,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 10:55:39,003 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 [2022-02-15 10:55:39,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 10:55:39,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 10:55:39,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 10:55:39,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 10:55:39,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 10:55:39,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 10:55:39,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 10:55:39,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 10:55:39,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 10:55:39,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:55:39,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 10:55:39,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 10:55:39,035 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 [2022-02-15 10:55:39,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 10:55:39,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 10:55:39,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 10:55:39,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 10:55:39,222 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 10:55:39,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-02-15 10:55:39,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790b9244d/00173593ac0f4a699074525715ec6204/FLAGc44b80478 [2022-02-15 10:55:39,633 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 10:55:39,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-02-15 10:55:39,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790b9244d/00173593ac0f4a699074525715ec6204/FLAGc44b80478 [2022-02-15 10:55:39,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790b9244d/00173593ac0f4a699074525715ec6204 [2022-02-15 10:55:39,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 10:55:39,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 10:55:39,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 10:55:39,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 10:55:40,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 10:55:40,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:55:39" (1/1) ... [2022-02-15 10:55:40,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f29b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40, skipping insertion in model container [2022-02-15 10:55:40,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:55:39" (1/1) ... [2022-02-15 10:55:40,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 10:55:40,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 10:55:40,184 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-15 10:55:40,342 WARN L230 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-2.i[39095,39108] [2022-02-15 10:55:40,347 WARN L230 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-2.i[39180,39193] [2022-02-15 10:55:40,347 WARN L230 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-2.i[39232,39245] [2022-02-15 10:55:40,376 WARN L230 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-2.i[49285,49298] [2022-02-15 10:55:40,377 WARN L230 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-2.i[49334,49347] [2022-02-15 10:55:40,378 WARN L230 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-2.i[49462,49475] [2022-02-15 10:55:40,379 WARN L230 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-2.i[49520,49533] [2022-02-15 10:55:40,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:55:40,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 10:55:40,405 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-15 10:55:40,422 WARN L230 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-2.i[39095,39108] [2022-02-15 10:55:40,423 WARN L230 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-2.i[39180,39193] [2022-02-15 10:55:40,423 WARN L230 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-2.i[39232,39245] [2022-02-15 10:55:40,430 WARN L230 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-2.i[49285,49298] [2022-02-15 10:55:40,431 WARN L230 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-2.i[49334,49347] [2022-02-15 10:55:40,432 WARN L230 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-2.i[49462,49475] [2022-02-15 10:55:40,432 WARN L230 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-2.i[49520,49533] [2022-02-15 10:55:40,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:55:40,492 INFO L208 MainTranslator]: Completed translation [2022-02-15 10:55:40,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40 WrapperNode [2022-02-15 10:55:40,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 10:55:40,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 10:55:40,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 10:55:40,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 10:55:40,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,552 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-02-15 10:55:40,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 10:55:40,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 10:55:40,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 10:55:40,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 10:55:40,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 10:55:40,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 10:55:40,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 10:55:40,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 10:55:40,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (1/1) ... [2022-02-15 10:55:40,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:55:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:55:40,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 10:55:40,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-02-15 10:55:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-02-15 10:55:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 10:55:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 10:55:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 10:55:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 10:55:40,666 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 10:55:40,813 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 10:55:40,814 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 10:55:41,112 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 10:55:41,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 10:55:41,118 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-15 10:55:41,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:55:41 BoogieIcfgContainer [2022-02-15 10:55:41,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 10:55:41,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 10:55:41,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 10:55:41,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 10:55:41,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:55:39" (1/3) ... [2022-02-15 10:55:41,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c287dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:55:41, skipping insertion in model container [2022-02-15 10:55:41,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:40" (2/3) ... [2022-02-15 10:55:41,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c287dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:55:41, skipping insertion in model container [2022-02-15 10:55:41,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:55:41" (3/3) ... [2022-02-15 10:55:41,130 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-02-15 10:55:41,133 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 10:55:41,133 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 10:55:41,134 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-15 10:55:41,134 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 10:55:41,198 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,198 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,198 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,198 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,199 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,199 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,199 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,199 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,200 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,200 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,200 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,200 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,200 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,201 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,201 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,201 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,202 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,202 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,202 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,202 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,202 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,203 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,203 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,203 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,203 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,203 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,204 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,205 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,205 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,205 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,205 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,205 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,206 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,206 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,206 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,206 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,207 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,207 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,207 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,208 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,208 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,208 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,208 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,209 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,211 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,211 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,212 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,212 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,212 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,213 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,213 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,213 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,213 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,214 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,214 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,215 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,216 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,216 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,217 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,219 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,223 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,223 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,223 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,223 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,223 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,224 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,225 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,226 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,226 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,226 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,226 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,227 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,228 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,229 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,229 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,230 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,231 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,232 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,233 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,234 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,235 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,235 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,235 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,235 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,235 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,236 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,237 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,237 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,237 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,237 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,238 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,239 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,240 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,240 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,240 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,240 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,241 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,242 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,245 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,246 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,246 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,246 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,246 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,247 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,248 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,249 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,250 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,251 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,252 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,257 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,258 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,259 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,260 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,261 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,262 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,263 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,264 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,265 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,266 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,267 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,268 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,269 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,270 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,271 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,272 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,273 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,274 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,275 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,275 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,275 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,275 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,275 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,276 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,277 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,277 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,277 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,277 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,278 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,279 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,280 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,281 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,281 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,281 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,281 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,281 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,284 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,285 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,287 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,288 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,289 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,290 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,293 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,294 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,295 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:41,297 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-15 10:55:41,338 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 10:55:41,344 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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 [2022-02-15 10:55:41,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-15 10:55:41,357 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-02-15 10:55:43,718 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-15 10:55:44,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:44,162 INFO L514 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] [2022-02-15 10:55:44,163 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)] === [2022-02-15 10:55:44,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-02-15 10:55:44,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:44,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958963239] [2022-02-15 10:55:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:44,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:44,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:44,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958963239] [2022-02-15 10:55:44,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958963239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:44,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:44,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 10:55:44,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791101871] [2022-02-15 10:55:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:44,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 10:55:44,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 10:55:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:55:44,972 INFO L87 Difference]: Start difference. First operand has 88749 states, 88744 states have (on average 3.2628121337780582) internal successors, (289555), 88748 states have internal predecessors, (289555), 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 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:55:47,622 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-02-15 10:55:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 10:55:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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 83 [2022-02-15 10:55:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:55:48,285 INFO L225 Difference]: With dead ends: 101011 [2022-02-15 10:55:48,286 INFO L226 Difference]: Without dead ends: 100951 [2022-02-15 10:55:48,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-02-15 10:55:48,289 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:55:48,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 10:55:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-02-15 10:55:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-02-15 10:55:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95266 states, 95262 states have (on average 3.0807562301862235) internal successors, (293479), 95265 states have internal predecessors, (293479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-02-15 10:55:52,033 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-02-15 10:55:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:55:52,033 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-02-15 10:55:52,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-02-15 10:55:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 10:55:52,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:52,116 INFO L514 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] [2022-02-15 10:55:52,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 10:55:52,117 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)] === [2022-02-15 10:55:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-02-15 10:55:52,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:52,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944606134] [2022-02-15 10:55:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:52,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:52,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:52,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944606134] [2022-02-15 10:55:52,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944606134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:52,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:52,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 10:55:52,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36641433] [2022-02-15 10:55:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:52,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 10:55:52,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 10:55:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-15 10:55:52,577 INFO L87 Difference]: Start difference. First operand 95266 states and 293479 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:55:55,961 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-02-15 10:55:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-15 10:55:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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 88 [2022-02-15 10:55:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:55:56,731 INFO L225 Difference]: With dead ends: 153195 [2022-02-15 10:55:56,732 INFO L226 Difference]: Without dead ends: 152229 [2022-02-15 10:55:56,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-02-15 10:55:56,733 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:55:56,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 10:55:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-02-15 10:56:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-02-15 10:56:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120205 states, 120201 states have (on average 3.0863803129757654) internal successors, (370986), 120204 states have internal predecessors, (370986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-02-15 10:56:01,373 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-02-15 10:56:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:01,380 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-02-15 10:56:01,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-02-15 10:56:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 10:56:01,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:01,446 INFO L514 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] [2022-02-15 10:56:01,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 10:56:01,447 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)] === [2022-02-15 10:56:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-02-15 10:56:01,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:01,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533754591] [2022-02-15 10:56:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:01,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:01,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:01,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533754591] [2022-02-15 10:56:01,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533754591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:01,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:01,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 10:56:01,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391061753] [2022-02-15 10:56:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:01,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 10:56:01,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 10:56:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-15 10:56:01,774 INFO L87 Difference]: Start difference. First operand 120205 states and 370986 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:05,068 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-02-15 10:56:05,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-15 10:56:05,068 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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 88 [2022-02-15 10:56:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:05,880 INFO L225 Difference]: With dead ends: 159338 [2022-02-15 10:56:05,880 INFO L226 Difference]: Without dead ends: 159086 [2022-02-15 10:56:05,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 10:56:05,889 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2687 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:05,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2687 Valid, 5439 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 10:56:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-02-15 10:56:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-02-15 10:56:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118249 states, 118245 states have (on average 3.086515286058607) internal successors, (364965), 118248 states have internal predecessors, (364965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-02-15 10:56:09,566 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-02-15 10:56:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:09,567 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-02-15 10:56:09,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-02-15 10:56:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 10:56:09,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:09,632 INFO L514 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] [2022-02-15 10:56:09,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 10:56:09,632 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)] === [2022-02-15 10:56:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-02-15 10:56:09,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:09,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602467968] [2022-02-15 10:56:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:09,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:10,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:10,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602467968] [2022-02-15 10:56:10,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602467968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:10,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:10,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 10:56:10,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575890848] [2022-02-15 10:56:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:10,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 10:56:10,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 10:56:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-02-15 10:56:10,056 INFO L87 Difference]: Start difference. First operand 118249 states and 364965 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:12,666 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-02-15 10:56:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 10:56:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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 88 [2022-02-15 10:56:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:13,066 INFO L225 Difference]: With dead ends: 131753 [2022-02-15 10:56:13,066 INFO L226 Difference]: Without dead ends: 131585 [2022-02-15 10:56:13,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=1087, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 10:56:13,067 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2365 mSDsluCounter, 4154 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 4741 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:13,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2365 Valid, 4741 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 10:56:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-02-15 10:56:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-02-15 10:56:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111213 states, 111209 states have (on average 3.0827271174095623) internal successors, (342827), 111212 states have internal predecessors, (342827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-02-15 10:56:16,320 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-02-15 10:56:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:16,322 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-02-15 10:56:16,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-02-15 10:56:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:56:16,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:16,419 INFO L514 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] [2022-02-15 10:56:16,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 10:56:16,420 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)] === [2022-02-15 10:56:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-02-15 10:56:16,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:16,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630684728] [2022-02-15 10:56:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:16,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:17,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:17,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630684728] [2022-02-15 10:56:17,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630684728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:17,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:17,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:17,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650930892] [2022-02-15 10:56:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:17,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:17,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:17,632 INFO L87 Difference]: Start difference. First operand 111213 states and 342827 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:24,905 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-02-15 10:56:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-15 10:56:24,905 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:56:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:25,462 INFO L225 Difference]: With dead ends: 163236 [2022-02-15 10:56:25,463 INFO L226 Difference]: Without dead ends: 163236 [2022-02-15 10:56:25,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-15 10:56:25,464 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 2940 mSDsluCounter, 9878 mSDsCounter, 0 mSdLazyCounter, 3846 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2940 SdHoareTripleChecker+Valid, 10916 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:25,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2940 Valid, 10916 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3846 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 10:56:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-02-15 10:56:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-02-15 10:56:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112825 states, 112821 states have (on average 3.0824935074143998) internal successors, (347770), 112824 states have internal predecessors, (347770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-02-15 10:56:28,967 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-02-15 10:56:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:28,968 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-02-15 10:56:28,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-02-15 10:56:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:56:29,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:29,070 INFO L514 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] [2022-02-15 10:56:29,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 10:56:29,070 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)] === [2022-02-15 10:56:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-02-15 10:56:29,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:29,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567401977] [2022-02-15 10:56:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:29,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:30,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:30,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567401977] [2022-02-15 10:56:30,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567401977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:30,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:30,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:30,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49810393] [2022-02-15 10:56:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:30,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:30,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:30,226 INFO L87 Difference]: Start difference. First operand 112825 states and 347770 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:39,514 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-02-15 10:56:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 10:56:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:56:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:40,093 INFO L225 Difference]: With dead ends: 170538 [2022-02-15 10:56:40,093 INFO L226 Difference]: Without dead ends: 170538 [2022-02-15 10:56:40,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 10:56:40,097 INFO L933 BasicCegarLoop]: 1323 mSDtfsCounter, 3249 mSDsluCounter, 11866 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 13189 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:40,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3249 Valid, 13189 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 10:56:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-02-15 10:56:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-02-15 10:56:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113321 states, 113317 states have (on average 3.0827589858538436) internal successors, (349329), 113320 states have internal predecessors, (349329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-02-15 10:56:43,957 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-02-15 10:56:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:43,957 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-02-15 10:56:43,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-02-15 10:56:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:56:44,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:44,064 INFO L514 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] [2022-02-15 10:56:44,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 10:56:44,065 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)] === [2022-02-15 10:56:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-02-15 10:56:44,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:44,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328728978] [2022-02-15 10:56:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:44,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:45,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:45,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328728978] [2022-02-15 10:56:45,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328728978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:45,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:45,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:56:45,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787552632] [2022-02-15 10:56:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:45,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:56:45,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:56:45,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:56:45,080 INFO L87 Difference]: Start difference. First operand 113321 states and 349329 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:53,974 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-02-15 10:56:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-15 10:56:53,975 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 10:56:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:54,488 INFO L225 Difference]: With dead ends: 168926 [2022-02-15 10:56:54,488 INFO L226 Difference]: Without dead ends: 168926 [2022-02-15 10:56:54,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-02-15 10:56:54,491 INFO L933 BasicCegarLoop]: 1370 mSDtfsCounter, 2676 mSDsluCounter, 11206 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 12576 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:54,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2676 Valid, 12576 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 10:56:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-02-15 10:56:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-02-15 10:56:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121350 states, 121346 states have (on average 3.0848565259670693) internal successors, (374335), 121349 states have internal predecessors, (374335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-02-15 10:56:58,117 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-02-15 10:56:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:58,118 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-02-15 10:56:58,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-02-15 10:56:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:56:58,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:58,237 INFO L514 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] [2022-02-15 10:56:58,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 10:56:58,238 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)] === [2022-02-15 10:56:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-02-15 10:56:58,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:58,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746409399] [2022-02-15 10:56:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:58,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:59,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:59,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746409399] [2022-02-15 10:56:59,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746409399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:59,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:59,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:59,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056118028] [2022-02-15 10:56:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:59,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:59,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:59,252 INFO L87 Difference]: Start difference. First operand 121350 states and 374335 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:05,918 INFO L93 Difference]: Finished difference Result 181721 states and 560556 transitions. [2022-02-15 10:57:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 10:57:05,918 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:57:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:06,488 INFO L225 Difference]: With dead ends: 181721 [2022-02-15 10:57:06,488 INFO L226 Difference]: Without dead ends: 181721 [2022-02-15 10:57:06,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 10:57:06,490 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 3305 mSDsluCounter, 9668 mSDsCounter, 0 mSdLazyCounter, 3857 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3305 SdHoareTripleChecker+Valid, 10472 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:06,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3305 Valid, 10472 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3857 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 10:57:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181721 states. [2022-02-15 10:57:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181721 to 128356. [2022-02-15 10:57:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128356 states, 128352 states have (on average 3.0888961605584644) internal successors, (396466), 128355 states have internal predecessors, (396466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128356 states to 128356 states and 396466 transitions. [2022-02-15 10:57:10,707 INFO L78 Accepts]: Start accepts. Automaton has 128356 states and 396466 transitions. Word has length 105 [2022-02-15 10:57:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:10,716 INFO L470 AbstractCegarLoop]: Abstraction has 128356 states and 396466 transitions. [2022-02-15 10:57:10,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 128356 states and 396466 transitions. [2022-02-15 10:57:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:57:10,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:10,844 INFO L514 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] [2022-02-15 10:57:10,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 10:57:10,844 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)] === [2022-02-15 10:57:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1485183559, now seen corresponding path program 5 times [2022-02-15 10:57:10,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:10,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787380252] [2022-02-15 10:57:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:10,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:11,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:11,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787380252] [2022-02-15 10:57:11,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787380252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:11,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:11,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:11,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771212845] [2022-02-15 10:57:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:11,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:11,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:11,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:11,573 INFO L87 Difference]: Start difference. First operand 128356 states and 396466 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:18,243 INFO L93 Difference]: Finished difference Result 181938 states and 560997 transitions. [2022-02-15 10:57:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 10:57:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:57:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:18,848 INFO L225 Difference]: With dead ends: 181938 [2022-02-15 10:57:18,848 INFO L226 Difference]: Without dead ends: 181938 [2022-02-15 10:57:18,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 10:57:18,851 INFO L933 BasicCegarLoop]: 946 mSDtfsCounter, 2843 mSDsluCounter, 10369 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2843 SdHoareTripleChecker+Valid, 11315 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:18,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2843 Valid, 11315 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 10:57:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181938 states. [2022-02-15 10:57:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181938 to 129472. [2022-02-15 10:57:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129472 states, 129468 states have (on average 3.088407946365125) internal successors, (399850), 129471 states have internal predecessors, (399850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129472 states to 129472 states and 399850 transitions. [2022-02-15 10:57:23,454 INFO L78 Accepts]: Start accepts. Automaton has 129472 states and 399850 transitions. Word has length 105 [2022-02-15 10:57:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:23,455 INFO L470 AbstractCegarLoop]: Abstraction has 129472 states and 399850 transitions. [2022-02-15 10:57:23,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 129472 states and 399850 transitions. [2022-02-15 10:57:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:57:23,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:23,581 INFO L514 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] [2022-02-15 10:57:23,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 10:57:23,581 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)] === [2022-02-15 10:57:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 6 times [2022-02-15 10:57:23,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:23,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715247544] [2022-02-15 10:57:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:23,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:24,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:24,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715247544] [2022-02-15 10:57:24,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715247544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:24,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:24,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:24,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755577996] [2022-02-15 10:57:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:24,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:24,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:24,217 INFO L87 Difference]: Start difference. First operand 129472 states and 399850 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:34,436 INFO L93 Difference]: Finished difference Result 180054 states and 554885 transitions. [2022-02-15 10:57:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 10:57:34,436 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:57:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:35,152 INFO L225 Difference]: With dead ends: 180054 [2022-02-15 10:57:35,153 INFO L226 Difference]: Without dead ends: 180054 [2022-02-15 10:57:35,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 10:57:35,154 INFO L933 BasicCegarLoop]: 1505 mSDtfsCounter, 2735 mSDsluCounter, 14541 mSDsCounter, 0 mSdLazyCounter, 5738 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 16046 SdHoareTripleChecker+Invalid, 5829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:35,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2735 Valid, 16046 Invalid, 5829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5738 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 10:57:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180054 states. [2022-02-15 10:57:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180054 to 122838. [2022-02-15 10:57:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122838 states, 122834 states have (on average 3.0855626292394613) internal successors, (379012), 122837 states have internal predecessors, (379012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122838 states to 122838 states and 379012 transitions. [2022-02-15 10:57:39,235 INFO L78 Accepts]: Start accepts. Automaton has 122838 states and 379012 transitions. Word has length 105 [2022-02-15 10:57:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:39,236 INFO L470 AbstractCegarLoop]: Abstraction has 122838 states and 379012 transitions. [2022-02-15 10:57:39,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 122838 states and 379012 transitions. [2022-02-15 10:57:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:57:39,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:39,373 INFO L514 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] [2022-02-15 10:57:39,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 10:57:39,373 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)] === [2022-02-15 10:57:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 7 times [2022-02-15 10:57:39,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:39,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443632555] [2022-02-15 10:57:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:39,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:40,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:40,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443632555] [2022-02-15 10:57:40,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443632555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:40,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:40,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:57:40,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208501650] [2022-02-15 10:57:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:40,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:57:40,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:40,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:57:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:57:40,398 INFO L87 Difference]: Start difference. First operand 122838 states and 379012 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:50,706 INFO L93 Difference]: Finished difference Result 170838 states and 526877 transitions. [2022-02-15 10:57:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-02-15 10:57:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 10:57:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:51,545 INFO L225 Difference]: With dead ends: 170838 [2022-02-15 10:57:51,545 INFO L226 Difference]: Without dead ends: 170838 [2022-02-15 10:57:51,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-02-15 10:57:51,548 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3354 mSDsluCounter, 10968 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3354 SdHoareTripleChecker+Valid, 12502 SdHoareTripleChecker+Invalid, 4448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:51,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3354 Valid, 12502 Invalid, 4448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 10:57:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170838 states. [2022-02-15 10:57:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170838 to 136959. [2022-02-15 10:57:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136959 states, 136955 states have (on average 3.0877806578803257) internal successors, (422887), 136958 states have internal predecessors, (422887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136959 states to 136959 states and 422887 transitions. [2022-02-15 10:57:55,247 INFO L78 Accepts]: Start accepts. Automaton has 136959 states and 422887 transitions. Word has length 105 [2022-02-15 10:57:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:55,248 INFO L470 AbstractCegarLoop]: Abstraction has 136959 states and 422887 transitions. [2022-02-15 10:57:55,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 136959 states and 422887 transitions. [2022-02-15 10:57:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:57:55,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:55,397 INFO L514 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] [2022-02-15 10:57:55,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 10:57:55,398 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)] === [2022-02-15 10:57:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 8 times [2022-02-15 10:57:55,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:55,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343327114] [2022-02-15 10:57:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:55,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:56,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:56,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343327114] [2022-02-15 10:57:56,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343327114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:56,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:56,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:56,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829151761] [2022-02-15 10:57:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:56,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:56,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:56,325 INFO L87 Difference]: Start difference. First operand 136959 states and 422887 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:03,409 INFO L93 Difference]: Finished difference Result 230818 states and 714168 transitions. [2022-02-15 10:58:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 10:58:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:58:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:04,088 INFO L225 Difference]: With dead ends: 230818 [2022-02-15 10:58:04,089 INFO L226 Difference]: Without dead ends: 230818 [2022-02-15 10:58:04,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 10:58:04,090 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 2851 mSDsluCounter, 11458 mSDsCounter, 0 mSdLazyCounter, 4950 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 12266 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:04,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2851 Valid, 12266 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4950 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 10:58:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230818 states. [2022-02-15 10:58:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230818 to 152180. [2022-02-15 10:58:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152180 states, 152176 states have (on average 3.0934115760698138) internal successors, (470743), 152179 states have internal predecessors, (470743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152180 states to 152180 states and 470743 transitions. [2022-02-15 10:58:09,217 INFO L78 Accepts]: Start accepts. Automaton has 152180 states and 470743 transitions. Word has length 105 [2022-02-15 10:58:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:09,217 INFO L470 AbstractCegarLoop]: Abstraction has 152180 states and 470743 transitions. [2022-02-15 10:58:09,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 152180 states and 470743 transitions. [2022-02-15 10:58:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:58:09,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:09,377 INFO L514 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] [2022-02-15 10:58:09,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 10:58:09,377 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)] === [2022-02-15 10:58:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 9 times [2022-02-15 10:58:09,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:09,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632746608] [2022-02-15 10:58:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:09,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:10,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:10,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632746608] [2022-02-15 10:58:10,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632746608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:10,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:10,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:58:10,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85241000] [2022-02-15 10:58:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:10,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:58:10,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:58:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:58:10,071 INFO L87 Difference]: Start difference. First operand 152180 states and 470743 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:16,871 INFO L93 Difference]: Finished difference Result 231345 states and 715053 transitions. [2022-02-15 10:58:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 10:58:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:58:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:18,124 INFO L225 Difference]: With dead ends: 231345 [2022-02-15 10:58:18,124 INFO L226 Difference]: Without dead ends: 231345 [2022-02-15 10:58:18,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 10:58:18,125 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 2822 mSDsluCounter, 10872 mSDsCounter, 0 mSdLazyCounter, 4645 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 11813 SdHoareTripleChecker+Invalid, 4718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:18,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 11813 Invalid, 4718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4645 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 10:58:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231345 states. [2022-02-15 10:58:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231345 to 154412. [2022-02-15 10:58:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154412 states, 154408 states have (on average 3.0925275892440807) internal successors, (477511), 154411 states have internal predecessors, (477511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154412 states to 154412 states and 477511 transitions. [2022-02-15 10:58:23,560 INFO L78 Accepts]: Start accepts. Automaton has 154412 states and 477511 transitions. Word has length 105 [2022-02-15 10:58:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:23,561 INFO L470 AbstractCegarLoop]: Abstraction has 154412 states and 477511 transitions. [2022-02-15 10:58:23,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 154412 states and 477511 transitions. [2022-02-15 10:58:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:58:23,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:23,772 INFO L514 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] [2022-02-15 10:58:23,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 10:58:23,772 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)] === [2022-02-15 10:58:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 10 times [2022-02-15 10:58:23,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:23,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221902552] [2022-02-15 10:58:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:23,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:25,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:25,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221902552] [2022-02-15 10:58:25,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221902552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:25,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:25,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:58:25,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137364716] [2022-02-15 10:58:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:25,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:58:25,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:58:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:58:25,027 INFO L87 Difference]: Start difference. First operand 154412 states and 477511 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:33,265 INFO L93 Difference]: Finished difference Result 220123 states and 680002 transitions. [2022-02-15 10:58:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 10:58:33,266 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:58:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:34,472 INFO L225 Difference]: With dead ends: 220123 [2022-02-15 10:58:34,473 INFO L226 Difference]: Without dead ends: 220123 [2022-02-15 10:58:34,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1477, Invalid=3635, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 10:58:34,473 INFO L933 BasicCegarLoop]: 1119 mSDtfsCounter, 2851 mSDsluCounter, 11044 mSDsCounter, 0 mSdLazyCounter, 4739 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 12163 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:34,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2851 Valid, 12163 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4739 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-15 10:58:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220123 states. [2022-02-15 10:58:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220123 to 149049. [2022-02-15 10:58:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149049 states, 149045 states have (on average 3.0911603878023417) internal successors, (460722), 149048 states have internal predecessors, (460722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149049 states to 149049 states and 460722 transitions. [2022-02-15 10:58:39,158 INFO L78 Accepts]: Start accepts. Automaton has 149049 states and 460722 transitions. Word has length 105 [2022-02-15 10:58:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:39,159 INFO L470 AbstractCegarLoop]: Abstraction has 149049 states and 460722 transitions. [2022-02-15 10:58:39,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149049 states and 460722 transitions. [2022-02-15 10:58:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:58:39,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:39,334 INFO L514 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] [2022-02-15 10:58:39,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 10:58:39,335 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)] === [2022-02-15 10:58:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 11 times [2022-02-15 10:58:39,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:39,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469733795] [2022-02-15 10:58:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:39,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:40,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:40,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469733795] [2022-02-15 10:58:40,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469733795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:40,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:40,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:58:40,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656664642] [2022-02-15 10:58:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:40,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:58:40,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:58:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:58:40,354 INFO L87 Difference]: Start difference. First operand 149049 states and 460722 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:51,139 INFO L93 Difference]: Finished difference Result 194929 states and 601772 transitions. [2022-02-15 10:58:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-15 10:58:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 10:58:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:51,987 INFO L225 Difference]: With dead ends: 194929 [2022-02-15 10:58:51,987 INFO L226 Difference]: Without dead ends: 194929 [2022-02-15 10:58:51,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-02-15 10:58:51,990 INFO L933 BasicCegarLoop]: 1640 mSDtfsCounter, 2958 mSDsluCounter, 13264 mSDsCounter, 0 mSdLazyCounter, 5325 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 14904 SdHoareTripleChecker+Invalid, 5416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:51,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2958 Valid, 14904 Invalid, 5416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5325 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 10:58:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194929 states. [2022-02-15 10:58:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194929 to 136289. [2022-02-15 10:58:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136289 states, 136285 states have (on average 3.0891660857761307) internal successors, (421007), 136288 states have internal predecessors, (421007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136289 states to 136289 states and 421007 transitions. [2022-02-15 10:58:56,259 INFO L78 Accepts]: Start accepts. Automaton has 136289 states and 421007 transitions. Word has length 105 [2022-02-15 10:58:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:56,259 INFO L470 AbstractCegarLoop]: Abstraction has 136289 states and 421007 transitions. [2022-02-15 10:58:56,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 136289 states and 421007 transitions. [2022-02-15 10:58:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:58:56,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:56,426 INFO L514 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] [2022-02-15 10:58:56,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 10:58:56,426 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)] === [2022-02-15 10:58:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 12 times [2022-02-15 10:58:56,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:56,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657440161] [2022-02-15 10:58:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:56,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:57,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:57,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657440161] [2022-02-15 10:58:57,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657440161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:57,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:57,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 10:58:57,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020577144] [2022-02-15 10:58:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:57,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 10:58:57,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 10:58:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-02-15 10:58:57,078 INFO L87 Difference]: Start difference. First operand 136289 states and 421007 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:01,975 INFO L93 Difference]: Finished difference Result 184032 states and 567783 transitions. [2022-02-15 10:59:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-15 10:59:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 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 105 [2022-02-15 10:59:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:02,662 INFO L225 Difference]: With dead ends: 184032 [2022-02-15 10:59:02,662 INFO L226 Difference]: Without dead ends: 184032 [2022-02-15 10:59:02,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 10:59:02,663 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 2877 mSDsluCounter, 7977 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 8757 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:02,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2877 Valid, 8757 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 10:59:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184032 states. [2022-02-15 10:59:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184032 to 145961. [2022-02-15 10:59:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145961 states, 145957 states have (on average 3.0926163185047653) internal successors, (451389), 145960 states have internal predecessors, (451389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 451389 transitions. [2022-02-15 10:59:07,447 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 451389 transitions. Word has length 105 [2022-02-15 10:59:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:07,447 INFO L470 AbstractCegarLoop]: Abstraction has 145961 states and 451389 transitions. [2022-02-15 10:59:07,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 451389 transitions. [2022-02-15 10:59:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:59:07,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:07,620 INFO L514 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] [2022-02-15 10:59:07,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 10:59:07,621 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)] === [2022-02-15 10:59:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 13 times [2022-02-15 10:59:07,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:07,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211286142] [2022-02-15 10:59:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:07,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:08,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:08,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211286142] [2022-02-15 10:59:08,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211286142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:08,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:08,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:59:08,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158765350] [2022-02-15 10:59:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:08,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:59:08,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:08,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:59:08,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:59:08,438 INFO L87 Difference]: Start difference. First operand 145961 states and 451389 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:15,192 INFO L93 Difference]: Finished difference Result 191131 states and 590890 transitions. [2022-02-15 10:59:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-15 10:59:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:59:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:15,840 INFO L225 Difference]: With dead ends: 191131 [2022-02-15 10:59:15,841 INFO L226 Difference]: Without dead ends: 191131 [2022-02-15 10:59:15,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1211, Invalid=3079, Unknown=0, NotChecked=0, Total=4290 [2022-02-15 10:59:15,841 INFO L933 BasicCegarLoop]: 994 mSDtfsCounter, 2379 mSDsluCounter, 8971 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 9965 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:15,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2379 Valid, 9965 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3841 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 10:59:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191131 states. [2022-02-15 10:59:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191131 to 145651. [2022-02-15 10:59:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145651 states, 145647 states have (on average 3.0923191002904282) internal successors, (450387), 145650 states have internal predecessors, (450387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145651 states to 145651 states and 450387 transitions. [2022-02-15 10:59:20,038 INFO L78 Accepts]: Start accepts. Automaton has 145651 states and 450387 transitions. Word has length 105 [2022-02-15 10:59:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:20,039 INFO L470 AbstractCegarLoop]: Abstraction has 145651 states and 450387 transitions. [2022-02-15 10:59:20,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 145651 states and 450387 transitions. [2022-02-15 10:59:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:59:20,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:20,596 INFO L514 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] [2022-02-15 10:59:20,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 10:59:20,597 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)] === [2022-02-15 10:59:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 14 times [2022-02-15 10:59:20,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:20,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138760549] [2022-02-15 10:59:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:20,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:21,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:21,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138760549] [2022-02-15 10:59:21,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138760549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:21,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:21,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:59:21,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206944836] [2022-02-15 10:59:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:21,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:59:21,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:21,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:59:21,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:59:21,319 INFO L87 Difference]: Start difference. First operand 145651 states and 450387 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:33,731 INFO L93 Difference]: Finished difference Result 178201 states and 549843 transitions. [2022-02-15 10:59:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-15 10:59:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 10:59:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:34,512 INFO L225 Difference]: With dead ends: 178201 [2022-02-15 10:59:34,512 INFO L226 Difference]: Without dead ends: 178201 [2022-02-15 10:59:34,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-02-15 10:59:34,521 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 3086 mSDsluCounter, 16003 mSDsCounter, 0 mSdLazyCounter, 6668 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 17674 SdHoareTripleChecker+Invalid, 6769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 6668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:34,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3086 Valid, 17674 Invalid, 6769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 6668 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-15 10:59:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178201 states. [2022-02-15 10:59:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178201 to 140474. [2022-02-15 10:59:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140474 states, 140470 states have (on average 3.0907809496689684) internal successors, (434162), 140473 states have internal predecessors, (434162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140474 states to 140474 states and 434162 transitions. [2022-02-15 10:59:38,312 INFO L78 Accepts]: Start accepts. Automaton has 140474 states and 434162 transitions. Word has length 105 [2022-02-15 10:59:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:38,312 INFO L470 AbstractCegarLoop]: Abstraction has 140474 states and 434162 transitions. [2022-02-15 10:59:38,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 140474 states and 434162 transitions. [2022-02-15 10:59:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:59:38,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:38,823 INFO L514 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] [2022-02-15 10:59:38,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 10:59:38,823 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)] === [2022-02-15 10:59:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 15 times [2022-02-15 10:59:38,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:38,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986376393] [2022-02-15 10:59:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:38,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:39,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:39,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986376393] [2022-02-15 10:59:39,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986376393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:39,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:39,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:59:39,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737530538] [2022-02-15 10:59:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:39,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:59:39,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:59:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:59:39,485 INFO L87 Difference]: Start difference. First operand 140474 states and 434162 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:51,644 INFO L93 Difference]: Finished difference Result 164426 states and 506766 transitions. [2022-02-15 10:59:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-15 10:59:51,645 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 10:59:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:52,331 INFO L225 Difference]: With dead ends: 164426 [2022-02-15 10:59:52,331 INFO L226 Difference]: Without dead ends: 164426 [2022-02-15 10:59:52,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3081, Invalid=7425, Unknown=0, NotChecked=0, Total=10506 [2022-02-15 10:59:52,332 INFO L933 BasicCegarLoop]: 1740 mSDtfsCounter, 2927 mSDsluCounter, 14182 mSDsCounter, 0 mSdLazyCounter, 5941 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2927 SdHoareTripleChecker+Valid, 15922 SdHoareTripleChecker+Invalid, 6029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 5941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:52,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2927 Valid, 15922 Invalid, 6029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 5941 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 10:59:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164426 states. [2022-02-15 10:59:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164426 to 128790. [2022-02-15 10:59:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128790 states, 128786 states have (on average 3.087369745158635) internal successors, (397610), 128789 states have internal predecessors, (397610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128790 states to 128790 states and 397610 transitions. [2022-02-15 10:59:56,338 INFO L78 Accepts]: Start accepts. Automaton has 128790 states and 397610 transitions. Word has length 105 [2022-02-15 10:59:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:56,339 INFO L470 AbstractCegarLoop]: Abstraction has 128790 states and 397610 transitions. [2022-02-15 10:59:56,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 128790 states and 397610 transitions. [2022-02-15 10:59:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 10:59:56,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:56,481 INFO L514 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] [2022-02-15 10:59:56,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 10:59:56,482 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)] === [2022-02-15 10:59:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 16 times [2022-02-15 10:59:56,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:56,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904695572] [2022-02-15 10:59:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:56,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:57,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:57,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904695572] [2022-02-15 10:59:57,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904695572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:57,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:57,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 10:59:57,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492252722] [2022-02-15 10:59:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:57,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 10:59:57,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 10:59:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-02-15 10:59:57,222 INFO L87 Difference]: Start difference. First operand 128790 states and 397610 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:02,665 INFO L93 Difference]: Finished difference Result 173781 states and 535095 transitions. [2022-02-15 11:00:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-15 11:00:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 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 105 [2022-02-15 11:00:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:03,413 INFO L225 Difference]: With dead ends: 173781 [2022-02-15 11:00:03,413 INFO L226 Difference]: Without dead ends: 173781 [2022-02-15 11:00:03,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1097, Invalid=2685, Unknown=0, NotChecked=0, Total=3782 [2022-02-15 11:00:03,414 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 2611 mSDsluCounter, 7615 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 8582 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:03,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2611 Valid, 8582 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2992 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 11:00:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173781 states. [2022-02-15 11:00:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173781 to 131239. [2022-02-15 11:00:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131239 states, 131235 states have (on average 3.0875985826951653) internal successors, (405201), 131238 states have internal predecessors, (405201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131239 states to 131239 states and 405201 transitions. [2022-02-15 11:00:07,278 INFO L78 Accepts]: Start accepts. Automaton has 131239 states and 405201 transitions. Word has length 105 [2022-02-15 11:00:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:07,278 INFO L470 AbstractCegarLoop]: Abstraction has 131239 states and 405201 transitions. [2022-02-15 11:00:07,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 131239 states and 405201 transitions. [2022-02-15 11:00:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:00:07,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:07,433 INFO L514 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] [2022-02-15 11:00:07,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 11:00:07,434 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)] === [2022-02-15 11:00:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 17 times [2022-02-15 11:00:07,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:07,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297254077] [2022-02-15 11:00:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:07,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:08,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:08,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297254077] [2022-02-15 11:00:08,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297254077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:08,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:08,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:00:08,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554460678] [2022-02-15 11:00:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:08,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:00:08,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:08,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:00:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:00:08,350 INFO L87 Difference]: Start difference. First operand 131239 states and 405201 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:17,983 INFO L93 Difference]: Finished difference Result 186601 states and 574575 transitions. [2022-02-15 11:00:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 11:00:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:00:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:18,847 INFO L225 Difference]: With dead ends: 186601 [2022-02-15 11:00:18,847 INFO L226 Difference]: Without dead ends: 186601 [2022-02-15 11:00:18,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 11:00:18,851 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 2782 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 6420 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2782 SdHoareTripleChecker+Valid, 17396 SdHoareTripleChecker+Invalid, 6489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 6420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:18,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2782 Valid, 17396 Invalid, 6489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 6420 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-15 11:00:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2022-02-15 11:00:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 132355. [2022-02-15 11:00:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132355 states, 132351 states have (on average 3.087963067902774) internal successors, (408695), 132354 states have internal predecessors, (408695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132355 states to 132355 states and 408695 transitions. [2022-02-15 11:00:22,853 INFO L78 Accepts]: Start accepts. Automaton has 132355 states and 408695 transitions. Word has length 105 [2022-02-15 11:00:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:22,854 INFO L470 AbstractCegarLoop]: Abstraction has 132355 states and 408695 transitions. [2022-02-15 11:00:22,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 132355 states and 408695 transitions. [2022-02-15 11:00:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:00:23,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:23,420 INFO L514 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] [2022-02-15 11:00:23,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 11:00:23,420 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)] === [2022-02-15 11:00:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 18 times [2022-02-15 11:00:23,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:23,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923028582] [2022-02-15 11:00:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:23,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:24,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:24,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923028582] [2022-02-15 11:00:24,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923028582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:24,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:24,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:00:24,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314869866] [2022-02-15 11:00:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:24,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:00:24,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:00:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:00:24,132 INFO L87 Difference]: Start difference. First operand 132355 states and 408695 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:34,775 INFO L93 Difference]: Finished difference Result 186436 states and 574041 transitions. [2022-02-15 11:00:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-15 11:00:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 11:00:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:35,535 INFO L225 Difference]: With dead ends: 186436 [2022-02-15 11:00:35,535 INFO L226 Difference]: Without dead ends: 186436 [2022-02-15 11:00:35,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-02-15 11:00:35,536 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 2409 mSDsluCounter, 12380 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 13754 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 5180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:35,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2409 Valid, 13754 Invalid, 5251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5180 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 11:00:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186436 states. [2022-02-15 11:00:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186436 to 141355. [2022-02-15 11:00:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141355 states, 141351 states have (on average 3.0893803368918507) internal successors, (436687), 141354 states have internal predecessors, (436687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141355 states to 141355 states and 436687 transitions. [2022-02-15 11:00:39,587 INFO L78 Accepts]: Start accepts. Automaton has 141355 states and 436687 transitions. Word has length 105 [2022-02-15 11:00:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:39,588 INFO L470 AbstractCegarLoop]: Abstraction has 141355 states and 436687 transitions. [2022-02-15 11:00:39,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 141355 states and 436687 transitions. [2022-02-15 11:00:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:00:39,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:39,731 INFO L514 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] [2022-02-15 11:00:39,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 11:00:39,731 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)] === [2022-02-15 11:00:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 19 times [2022-02-15 11:00:39,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:39,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009549752] [2022-02-15 11:00:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:39,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:40,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:40,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009549752] [2022-02-15 11:00:40,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009549752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:40,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:40,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:00:40,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047091986] [2022-02-15 11:00:40,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:40,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:00:40,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:00:40,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:00:40,735 INFO L87 Difference]: Start difference. First operand 141355 states and 436687 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:47,956 INFO L93 Difference]: Finished difference Result 197081 states and 607845 transitions. [2022-02-15 11:00:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 11:00:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:00:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:48,961 INFO L225 Difference]: With dead ends: 197081 [2022-02-15 11:00:48,962 INFO L226 Difference]: Without dead ends: 197081 [2022-02-15 11:00:48,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 11:00:48,966 INFO L933 BasicCegarLoop]: 816 mSDtfsCounter, 3144 mSDsluCounter, 9309 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3144 SdHoareTripleChecker+Valid, 10125 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:48,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3144 Valid, 10125 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 11:00:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197081 states. [2022-02-15 11:00:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197081 to 148361. [2022-02-15 11:00:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148361 states, 148357 states have (on average 3.092661620280809) internal successors, (458818), 148360 states have internal predecessors, (458818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148361 states to 148361 states and 458818 transitions. [2022-02-15 11:00:53,663 INFO L78 Accepts]: Start accepts. Automaton has 148361 states and 458818 transitions. Word has length 105 [2022-02-15 11:00:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:53,664 INFO L470 AbstractCegarLoop]: Abstraction has 148361 states and 458818 transitions. [2022-02-15 11:00:53,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 148361 states and 458818 transitions. [2022-02-15 11:00:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:00:53,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:53,833 INFO L514 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] [2022-02-15 11:00:53,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 11:00:53,833 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)] === [2022-02-15 11:00:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 20 times [2022-02-15 11:00:53,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:53,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451341709] [2022-02-15 11:00:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:53,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:54,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:54,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451341709] [2022-02-15 11:00:54,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451341709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:54,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:54,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:00:54,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293877374] [2022-02-15 11:00:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:54,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:00:54,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:00:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:00:54,511 INFO L87 Difference]: Start difference. First operand 148361 states and 458818 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:01,823 INFO L93 Difference]: Finished difference Result 197298 states and 608286 transitions. [2022-02-15 11:01:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 11:01:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:01:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:02,675 INFO L225 Difference]: With dead ends: 197298 [2022-02-15 11:01:02,676 INFO L226 Difference]: Without dead ends: 197298 [2022-02-15 11:01:02,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 11:01:02,677 INFO L933 BasicCegarLoop]: 958 mSDtfsCounter, 2802 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 4073 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2802 SdHoareTripleChecker+Valid, 10958 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:02,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2802 Valid, 10958 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4073 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 11:01:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197298 states. [2022-02-15 11:01:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197298 to 149477. [2022-02-15 11:01:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149477 states, 149473 states have (on average 3.092210633358533) internal successors, (462202), 149476 states have internal predecessors, (462202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149477 states to 149477 states and 462202 transitions. [2022-02-15 11:01:07,525 INFO L78 Accepts]: Start accepts. Automaton has 149477 states and 462202 transitions. Word has length 105 [2022-02-15 11:01:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:07,525 INFO L470 AbstractCegarLoop]: Abstraction has 149477 states and 462202 transitions. [2022-02-15 11:01:07,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 149477 states and 462202 transitions. [2022-02-15 11:01:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:01:07,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:07,702 INFO L514 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] [2022-02-15 11:01:07,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 11:01:07,702 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)] === [2022-02-15 11:01:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 21 times [2022-02-15 11:01:07,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:07,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182430883] [2022-02-15 11:01:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:07,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:08,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:08,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182430883] [2022-02-15 11:01:08,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182430883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:08,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:08,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:01:08,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010860306] [2022-02-15 11:01:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:08,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:01:08,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:01:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:01:08,524 INFO L87 Difference]: Start difference. First operand 149477 states and 462202 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:19,461 INFO L93 Difference]: Finished difference Result 197853 states and 609629 transitions. [2022-02-15 11:01:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 11:01:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:01:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:20,422 INFO L225 Difference]: With dead ends: 197853 [2022-02-15 11:01:20,423 INFO L226 Difference]: Without dead ends: 197853 [2022-02-15 11:01:20,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 11:01:20,428 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 2803 mSDsluCounter, 12568 mSDsCounter, 0 mSdLazyCounter, 5012 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 14077 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:20,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2803 Valid, 14077 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5012 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 11:01:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197853 states. [2022-02-15 11:01:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197853 to 143556. [2022-02-15 11:01:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143556 states, 143552 states have (on average 3.0904201961658493) internal successors, (443636), 143555 states have internal predecessors, (443636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143556 states to 143556 states and 443636 transitions. [2022-02-15 11:01:25,441 INFO L78 Accepts]: Start accepts. Automaton has 143556 states and 443636 transitions. Word has length 105 [2022-02-15 11:01:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:25,441 INFO L470 AbstractCegarLoop]: Abstraction has 143556 states and 443636 transitions. [2022-02-15 11:01:25,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 143556 states and 443636 transitions. [2022-02-15 11:01:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:01:25,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:25,608 INFO L514 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] [2022-02-15 11:01:25,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 11:01:25,608 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)] === [2022-02-15 11:01:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 22 times [2022-02-15 11:01:25,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:25,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062544310] [2022-02-15 11:01:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:25,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:27,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:27,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062544310] [2022-02-15 11:01:27,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062544310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:27,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:27,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:01:27,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129314275] [2022-02-15 11:01:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:27,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:01:27,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:01:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:01:27,046 INFO L87 Difference]: Start difference. First operand 143556 states and 443636 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:37,739 INFO L93 Difference]: Finished difference Result 189514 states and 583621 transitions. [2022-02-15 11:01:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-15 11:01:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 11:01:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:38,322 INFO L225 Difference]: With dead ends: 189514 [2022-02-15 11:01:38,322 INFO L226 Difference]: Without dead ends: 189514 [2022-02-15 11:01:38,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 11:01:38,324 INFO L933 BasicCegarLoop]: 1538 mSDtfsCounter, 2664 mSDsluCounter, 12653 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 14191 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:38,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2664 Valid, 14191 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5105 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 11:01:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189514 states. [2022-02-15 11:01:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189514 to 142533. [2022-02-15 11:01:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142533 states, 142529 states have (on average 3.0900658813294135) internal successors, (440424), 142532 states have internal predecessors, (440424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142533 states to 142533 states and 440424 transitions. [2022-02-15 11:01:43,249 INFO L78 Accepts]: Start accepts. Automaton has 142533 states and 440424 transitions. Word has length 105 [2022-02-15 11:01:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:43,249 INFO L470 AbstractCegarLoop]: Abstraction has 142533 states and 440424 transitions. [2022-02-15 11:01:43,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 142533 states and 440424 transitions. [2022-02-15 11:01:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:01:43,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:43,405 INFO L514 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] [2022-02-15 11:01:43,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 11:01:43,405 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)] === [2022-02-15 11:01:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 23 times [2022-02-15 11:01:43,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:43,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003556557] [2022-02-15 11:01:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:43,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:44,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:44,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003556557] [2022-02-15 11:01:44,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003556557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:44,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:44,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:01:44,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955521664] [2022-02-15 11:01:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:44,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:01:44,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:01:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:01:44,056 INFO L87 Difference]: Start difference. First operand 142533 states and 440424 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:50,987 INFO L93 Difference]: Finished difference Result 232790 states and 719209 transitions. [2022-02-15 11:01:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 11:01:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:01:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:52,136 INFO L225 Difference]: With dead ends: 232790 [2022-02-15 11:01:52,136 INFO L226 Difference]: Without dead ends: 232790 [2022-02-15 11:01:52,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 11:01:52,140 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 2984 mSDsluCounter, 9701 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2984 SdHoareTripleChecker+Valid, 10521 SdHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:52,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2984 Valid, 10521 Invalid, 4341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 11:01:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232790 states. [2022-02-15 11:01:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232790 to 153073. [2022-02-15 11:01:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153073 states, 153069 states have (on average 3.093761636908845) internal successors, (473559), 153072 states have internal predecessors, (473559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153073 states to 153073 states and 473559 transitions. [2022-02-15 11:01:56,952 INFO L78 Accepts]: Start accepts. Automaton has 153073 states and 473559 transitions. Word has length 105 [2022-02-15 11:01:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:56,953 INFO L470 AbstractCegarLoop]: Abstraction has 153073 states and 473559 transitions. [2022-02-15 11:01:56,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 153073 states and 473559 transitions. [2022-02-15 11:01:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:01:57,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:57,525 INFO L514 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] [2022-02-15 11:01:57,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 11:01:57,527 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)] === [2022-02-15 11:01:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 24 times [2022-02-15 11:01:57,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:57,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405778863] [2022-02-15 11:01:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:57,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:58,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:58,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405778863] [2022-02-15 11:01:58,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405778863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:58,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:58,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:01:58,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304581516] [2022-02-15 11:01:58,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:58,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:01:58,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:58,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:01:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:01:58,159 INFO L87 Difference]: Start difference. First operand 153073 states and 473559 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:05,453 INFO L93 Difference]: Finished difference Result 232325 states and 717241 transitions. [2022-02-15 11:02:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 11:02:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:02:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:06,388 INFO L225 Difference]: With dead ends: 232325 [2022-02-15 11:02:06,388 INFO L226 Difference]: Without dead ends: 232325 [2022-02-15 11:02:06,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 11:02:06,389 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 3124 mSDsluCounter, 10938 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 11891 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:06,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3124 Valid, 11891 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 11:02:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232325 states. [2022-02-15 11:02:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232325 to 154189. [2022-02-15 11:02:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154189 states, 154185 states have (on average 3.0933164704737814) internal successors, (476943), 154188 states have internal predecessors, (476943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154189 states to 154189 states and 476943 transitions. [2022-02-15 11:02:11,749 INFO L78 Accepts]: Start accepts. Automaton has 154189 states and 476943 transitions. Word has length 105 [2022-02-15 11:02:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:11,749 INFO L470 AbstractCegarLoop]: Abstraction has 154189 states and 476943 transitions. [2022-02-15 11:02:11,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 154189 states and 476943 transitions. [2022-02-15 11:02:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:02:11,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:11,968 INFO L514 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] [2022-02-15 11:02:11,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 11:02:11,968 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)] === [2022-02-15 11:02:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 25 times [2022-02-15 11:02:11,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:11,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214938189] [2022-02-15 11:02:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:11,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:12,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:12,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214938189] [2022-02-15 11:02:12,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214938189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:12,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:12,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:12,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203774360] [2022-02-15 11:02:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:12,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:12,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:12,660 INFO L87 Difference]: Start difference. First operand 154189 states and 476943 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:20,948 INFO L93 Difference]: Finished difference Result 226135 states and 697862 transitions. [2022-02-15 11:02:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 11:02:20,949 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:02:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:21,631 INFO L225 Difference]: With dead ends: 226135 [2022-02-15 11:02:21,632 INFO L226 Difference]: Without dead ends: 226135 [2022-02-15 11:02:21,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 11:02:21,632 INFO L933 BasicCegarLoop]: 1131 mSDtfsCounter, 2615 mSDsluCounter, 10522 mSDsCounter, 0 mSdLazyCounter, 4628 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 11653 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:21,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2615 Valid, 11653 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4628 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-15 11:02:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226135 states. [2022-02-15 11:02:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226135 to 160854. [2022-02-15 11:02:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160854 states, 160850 states have (on average 3.094062791420578) internal successors, (497680), 160853 states have internal predecessors, (497680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160854 states to 160854 states and 497680 transitions. [2022-02-15 11:02:27,390 INFO L78 Accepts]: Start accepts. Automaton has 160854 states and 497680 transitions. Word has length 105 [2022-02-15 11:02:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:27,390 INFO L470 AbstractCegarLoop]: Abstraction has 160854 states and 497680 transitions. [2022-02-15 11:02:27,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 160854 states and 497680 transitions. [2022-02-15 11:02:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:02:27,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:27,609 INFO L514 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] [2022-02-15 11:02:27,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 11:02:27,609 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)] === [2022-02-15 11:02:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 26 times [2022-02-15 11:02:27,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:27,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78774911] [2022-02-15 11:02:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:27,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:28,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:28,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78774911] [2022-02-15 11:02:28,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78774911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:28,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:28,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:28,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230290262] [2022-02-15 11:02:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:28,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:28,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:28,309 INFO L87 Difference]: Start difference. First operand 160854 states and 497680 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:39,636 INFO L93 Difference]: Finished difference Result 225624 states and 696169 transitions. [2022-02-15 11:02:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-15 11:02:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:02:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:40,365 INFO L225 Difference]: With dead ends: 225624 [2022-02-15 11:02:40,365 INFO L226 Difference]: Without dead ends: 225624 [2022-02-15 11:02:40,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2575, Invalid=6167, Unknown=0, NotChecked=0, Total=8742 [2022-02-15 11:02:40,366 INFO L933 BasicCegarLoop]: 1628 mSDtfsCounter, 2822 mSDsluCounter, 14594 mSDsCounter, 0 mSdLazyCounter, 6103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 16222 SdHoareTripleChecker+Invalid, 6188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 6103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:40,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2822 Valid, 16222 Invalid, 6188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 6103 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-15 11:02:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225624 states. [2022-02-15 11:02:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225624 to 159459. [2022-02-15 11:02:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159459 states, 159455 states have (on average 3.0946662067667994) internal successors, (493460), 159458 states have internal predecessors, (493460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159459 states to 159459 states and 493460 transitions. [2022-02-15 11:02:45,273 INFO L78 Accepts]: Start accepts. Automaton has 159459 states and 493460 transitions. Word has length 105 [2022-02-15 11:02:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:45,273 INFO L470 AbstractCegarLoop]: Abstraction has 159459 states and 493460 transitions. [2022-02-15 11:02:45,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 159459 states and 493460 transitions. [2022-02-15 11:02:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:02:45,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:45,483 INFO L514 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] [2022-02-15 11:02:45,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 11:02:45,483 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)] === [2022-02-15 11:02:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 27 times [2022-02-15 11:02:45,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:45,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37091097] [2022-02-15 11:02:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:45,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:45,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:45,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37091097] [2022-02-15 11:02:45,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37091097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:45,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:45,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:45,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820137738] [2022-02-15 11:02:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:45,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:45,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:45,957 INFO L87 Difference]: Start difference. First operand 159459 states and 493460 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:53,319 INFO L93 Difference]: Finished difference Result 257941 states and 799431 transitions. [2022-02-15 11:02:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-15 11:02:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:02:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:54,152 INFO L225 Difference]: With dead ends: 257941 [2022-02-15 11:02:54,152 INFO L226 Difference]: Without dead ends: 257941 [2022-02-15 11:02:54,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 11:02:54,153 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3329 mSDsluCounter, 10818 mSDsCounter, 0 mSdLazyCounter, 4934 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 11641 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:54,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3329 Valid, 11641 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4934 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-15 11:02:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257941 states. [2022-02-15 11:02:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257941 to 172417. [2022-02-15 11:02:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172417 states, 172413 states have (on average 3.1041800792283643) internal successors, (535201), 172416 states have internal predecessors, (535201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172417 states to 172417 states and 535201 transitions. [2022-02-15 11:02:59,308 INFO L78 Accepts]: Start accepts. Automaton has 172417 states and 535201 transitions. Word has length 105 [2022-02-15 11:02:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:59,308 INFO L470 AbstractCegarLoop]: Abstraction has 172417 states and 535201 transitions. [2022-02-15 11:02:59,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 172417 states and 535201 transitions. [2022-02-15 11:03:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:03:00,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:00,011 INFO L514 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] [2022-02-15 11:03:00,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 11:03:00,012 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)] === [2022-02-15 11:03:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 28 times [2022-02-15 11:03:00,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:00,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949884161] [2022-02-15 11:03:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:00,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:01,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:01,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949884161] [2022-02-15 11:03:01,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949884161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:01,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:01,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:03:01,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926247072] [2022-02-15 11:03:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:01,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:03:01,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:03:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:03:01,004 INFO L87 Difference]: Start difference. First operand 172417 states and 535201 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:08,024 INFO L93 Difference]: Finished difference Result 244363 states and 756027 transitions. [2022-02-15 11:03:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 11:03:08,025 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:03:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:08,896 INFO L225 Difference]: With dead ends: 244363 [2022-02-15 11:03:08,896 INFO L226 Difference]: Without dead ends: 244363 [2022-02-15 11:03:08,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 11:03:08,897 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 3042 mSDsluCounter, 10624 mSDsCounter, 0 mSdLazyCounter, 4703 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 11580 SdHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:08,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3042 Valid, 11580 Invalid, 4781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4703 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 11:03:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244363 states. [2022-02-15 11:03:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244363 to 163024. [2022-02-15 11:03:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163024 states, 163020 states have (on average 3.0961538461538463) internal successors, (504735), 163023 states have internal predecessors, (504735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163024 states to 163024 states and 504735 transitions. [2022-02-15 11:03:14,251 INFO L78 Accepts]: Start accepts. Automaton has 163024 states and 504735 transitions. Word has length 105 [2022-02-15 11:03:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:14,252 INFO L470 AbstractCegarLoop]: Abstraction has 163024 states and 504735 transitions. [2022-02-15 11:03:14,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 163024 states and 504735 transitions. [2022-02-15 11:03:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:03:14,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:14,863 INFO L514 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] [2022-02-15 11:03:14,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 11:03:14,863 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)] === [2022-02-15 11:03:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 29 times [2022-02-15 11:03:14,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:14,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652529667] [2022-02-15 11:03:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:14,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:15,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:15,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652529667] [2022-02-15 11:03:15,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652529667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:15,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:15,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:03:15,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62696724] [2022-02-15 11:03:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:15,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:03:15,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:03:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:03:15,606 INFO L87 Difference]: Start difference. First operand 163024 states and 504735 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:22,667 INFO L93 Difference]: Finished difference Result 228987 states and 707760 transitions. [2022-02-15 11:03:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-15 11:03:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 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 105 [2022-02-15 11:03:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:23,980 INFO L225 Difference]: With dead ends: 228987 [2022-02-15 11:03:23,980 INFO L226 Difference]: Without dead ends: 228987 [2022-02-15 11:03:23,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-02-15 11:03:23,981 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 2894 mSDsluCounter, 8962 mSDsCounter, 0 mSdLazyCounter, 3966 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 9968 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:23,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 9968 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3966 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 11:03:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228987 states. [2022-02-15 11:03:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228987 to 164729. [2022-02-15 11:03:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164729 states, 164725 states have (on average 3.0964334496888752) internal successors, (510060), 164728 states have internal predecessors, (510060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164729 states to 164729 states and 510060 transitions. [2022-02-15 11:03:29,724 INFO L78 Accepts]: Start accepts. Automaton has 164729 states and 510060 transitions. Word has length 105 [2022-02-15 11:03:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:29,724 INFO L470 AbstractCegarLoop]: Abstraction has 164729 states and 510060 transitions. [2022-02-15 11:03:29,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 164729 states and 510060 transitions. [2022-02-15 11:03:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:03:30,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:30,574 INFO L514 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] [2022-02-15 11:03:30,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 11:03:30,574 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 30 times [2022-02-15 11:03:30,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:30,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508397897] [2022-02-15 11:03:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:30,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:31,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:31,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508397897] [2022-02-15 11:03:31,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508397897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:31,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:31,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:03:31,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765690605] [2022-02-15 11:03:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:31,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:03:31,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:03:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:03:31,402 INFO L87 Difference]: Start difference. First operand 164729 states and 510060 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:42,182 INFO L93 Difference]: Finished difference Result 217109 states and 669918 transitions. [2022-02-15 11:03:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-15 11:03:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 11:03:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:42,900 INFO L225 Difference]: With dead ends: 217109 [2022-02-15 11:03:42,901 INFO L226 Difference]: Without dead ends: 217109 [2022-02-15 11:03:42,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-02-15 11:03:42,902 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 2982 mSDsluCounter, 13372 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2982 SdHoareTripleChecker+Valid, 15039 SdHoareTripleChecker+Invalid, 5807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:42,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2982 Valid, 15039 Invalid, 5807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5716 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 11:03:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217109 states. [2022-02-15 11:03:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217109 to 136726. [2022-02-15 11:03:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136726 states, 136722 states have (on average 3.090204941413964) internal successors, (422499), 136725 states have internal predecessors, (422499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136726 states to 136726 states and 422499 transitions. [2022-02-15 11:03:47,480 INFO L78 Accepts]: Start accepts. Automaton has 136726 states and 422499 transitions. Word has length 105 [2022-02-15 11:03:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:47,481 INFO L470 AbstractCegarLoop]: Abstraction has 136726 states and 422499 transitions. [2022-02-15 11:03:47,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 136726 states and 422499 transitions. [2022-02-15 11:03:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:03:47,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:47,647 INFO L514 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] [2022-02-15 11:03:47,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 11:03:47,647 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 31 times [2022-02-15 11:03:47,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:47,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473601733] [2022-02-15 11:03:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:47,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:48,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:48,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473601733] [2022-02-15 11:03:48,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473601733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:48,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:48,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:03:48,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507833849] [2022-02-15 11:03:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:48,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:03:48,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:03:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:03:48,649 INFO L87 Difference]: Start difference. First operand 136726 states and 422499 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:00,486 INFO L93 Difference]: Finished difference Result 225893 states and 695481 transitions. [2022-02-15 11:04:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-15 11:04:00,486 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 11:04:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:04:01,313 INFO L225 Difference]: With dead ends: 225893 [2022-02-15 11:04:01,314 INFO L226 Difference]: Without dead ends: 225893 [2022-02-15 11:04:01,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3961, Invalid=10319, Unknown=0, NotChecked=0, Total=14280 [2022-02-15 11:04:01,315 INFO L933 BasicCegarLoop]: 1901 mSDtfsCounter, 3624 mSDsluCounter, 12705 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3624 SdHoareTripleChecker+Valid, 14606 SdHoareTripleChecker+Invalid, 5353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:04:01,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3624 Valid, 14606 Invalid, 5353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 5260 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-15 11:04:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225893 states. [2022-02-15 11:04:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225893 to 128821. [2022-02-15 11:04:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128821 states, 128817 states have (on average 3.0873564824518502) internal successors, (397704), 128820 states have internal predecessors, (397704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128821 states to 128821 states and 397704 transitions. [2022-02-15 11:04:06,197 INFO L78 Accepts]: Start accepts. Automaton has 128821 states and 397704 transitions. Word has length 105 [2022-02-15 11:04:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:04:06,198 INFO L470 AbstractCegarLoop]: Abstraction has 128821 states and 397704 transitions. [2022-02-15 11:04:06,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 128821 states and 397704 transitions. [2022-02-15 11:04:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-15 11:04:06,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:04:06,332 INFO L514 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] [2022-02-15 11:04:06,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 11:04:06,332 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:04:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:04:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1666350753, now seen corresponding path program 32 times [2022-02-15 11:04:06,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:04:06,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062893027] [2022-02-15 11:04:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:04:06,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:04:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:04:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:04:07,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:04:07,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062893027] [2022-02-15 11:04:07,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062893027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:04:07,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:04:07,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:04:07,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44939] [2022-02-15 11:04:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:04:07,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:04:07,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:04:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:04:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:04:07,248 INFO L87 Difference]: Start difference. First operand 128821 states and 397704 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:20,779 INFO L93 Difference]: Finished difference Result 231411 states and 713980 transitions. [2022-02-15 11:04:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-02-15 11:04:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2022-02-15 11:04:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted.