/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.abstract-por-f0ea240 [2022-02-10 21:52:09,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:52:09,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:52:09,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:52:09,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:52:09,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:52:09,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:52:09,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:52:09,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:52:09,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:52:09,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:52:09,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:52:09,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:52:09,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:52:09,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:52:09,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:52:09,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:52:09,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:52:09,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:52:09,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:52:09,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:52:09,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:52:09,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:52:09,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:52:09,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:52:09,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:52:09,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:52:09,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:52:09,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:52:09,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:52:09,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:52:09,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:52:09,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:52:09,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:52:09,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:52:09,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:52:09,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:52:09,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:52:09,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:52:09,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:52:09,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:52:09,501 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-10 21:52:09,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:52:09,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:52:09,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:52:09,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:52:09,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:52:09,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:52:09,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:52:09,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:52:09,520 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:52:09,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:52:09,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:52:09,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:52:09,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:52:09,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:52:09,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:52:09,523 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:52:09,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:52:09,523 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-10 21:52:09,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:52:09,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:52:09,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:52:09,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:52:09,699 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:52:09,699 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-10 21:52:09,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cc96400/f66483761d6c4e769c3cc2d06e25ee3b/FLAGa214f5306 [2022-02-10 21:52:10,204 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:52:10,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-02-10 21:52:10,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cc96400/f66483761d6c4e769c3cc2d06e25ee3b/FLAGa214f5306 [2022-02-10 21:52:10,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2cc96400/f66483761d6c4e769c3cc2d06e25ee3b [2022-02-10 21:52:10,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:52:10,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:52:10,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:52:10,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:52:10,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:52:10,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:52:10" (1/1) ... [2022-02-10 21:52:10,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a8e820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:10, skipping insertion in model container [2022-02-10 21:52:10,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:52:10" (1/1) ... [2022-02-10 21:52:10,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:52:10,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:52:10,726 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-10 21:52:10,921 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-10 21:52:10,926 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-10 21:52:10,927 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-10 21:52:10,986 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-10 21:52:10,987 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-10 21:52:10,989 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-10 21:52:10,989 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-10 21:52:10,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:52:11,002 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:52:11,015 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-10 21:52:11,033 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-10 21:52:11,034 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-10 21:52:11,034 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-10 21:52:11,050 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-10 21:52:11,051 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-10 21:52:11,054 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-10 21:52:11,055 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-10 21:52:11,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:52:11,109 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:52:11,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11 WrapperNode [2022-02-10 21:52:11,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:52:11,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:52:11,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:52:11,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:52:11,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,178 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-02-10 21:52:11,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:52:11,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:52:11,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:52:11,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:52:11,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:52:11,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:52:11,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:52:11,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:52:11,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (1/1) ... [2022-02-10 21:52:11,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:52:11,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:52:11,263 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-10 21:52:11,279 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-10 21:52:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-02-10 21:52:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-02-10 21:52:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:52:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:52:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:52:11,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:52:11,308 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:52:11,440 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:52:11,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:52:11,650 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:52:11,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:52:11,657 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-10 21:52:11,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:52:11 BoogieIcfgContainer [2022-02-10 21:52:11,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:52:11,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:52:11,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:52:11,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:52:11,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:52:10" (1/3) ... [2022-02-10 21:52:11,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb7c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:52:11, skipping insertion in model container [2022-02-10 21:52:11,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:52:11" (2/3) ... [2022-02-10 21:52:11,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb7c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:52:11, skipping insertion in model container [2022-02-10 21:52:11,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:52:11" (3/3) ... [2022-02-10 21:52:11,665 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-02-10 21:52:11,668 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:52:11,668 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:52:11,668 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-10 21:52:11,669 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,737 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,738 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,739 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,740 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,741 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,742 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,743 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,744 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,745 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,746 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,746 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,747 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,748 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,749 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,750 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,751 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,752 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,753 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,754 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,755 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,756 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,757 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,758 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,759 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,759 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,759 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,761 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,761 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,761 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,761 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,761 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,763 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,763 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,764 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,765 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,766 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,766 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,766 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,766 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,767 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,767 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,768 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,769 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,769 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,769 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,770 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,772 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,778 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,779 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,779 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,780 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,780 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,781 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,782 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,783 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,783 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,790 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,790 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,790 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,791 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,792 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,793 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,794 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,795 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,796 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,797 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,798 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,799 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,800 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,801 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,802 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,803 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,804 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,805 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,806 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,807 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,807 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,807 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,810 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,810 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,811 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,812 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,812 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,813 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,813 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,813 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,813 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,814 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,814 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,814 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,814 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,815 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,816 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,817 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,817 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,817 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,817 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,818 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,823 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,824 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,825 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,828 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,828 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,829 WARN L322 ript$VariableManager]: TermVariable |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,831 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,831 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,832 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,833 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,833 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,833 WARN L322 ript$VariableManager]: TermVariable |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:52:11,836 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-10 21:52:11,877 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:52:11,881 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, 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-10 21:52:11,881 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-10 21:52:11,892 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-02-10 21:52:14,204 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-10 21:52:14,360 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-10 21:52:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-10 21:52:14,653 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:14,653 INFO L515 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-10 21:52:14,654 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-10 21:52:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-02-10 21:52:14,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:14,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237107108] [2022-02-10 21:52:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:15,433 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-10 21:52:15,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:15,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237107108] [2022-02-10 21:52:15,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237107108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:15,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:15,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-10 21:52:15,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817343565] [2022-02-10 21:52:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:15,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-10 21:52:15,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-10 21:52:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-02-10 21:52:15,604 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-10 21:52:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:18,482 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-02-10 21:52:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-10 21:52:18,484 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-10 21:52:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:19,156 INFO L225 Difference]: With dead ends: 101011 [2022-02-10 21:52:19,156 INFO L226 Difference]: Without dead ends: 100951 [2022-02-10 21:52:19,157 INFO L933 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-10 21:52:19,160 INFO L934 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:19,161 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 21:52:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-02-10 21:52:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-02-10 21:52:22,027 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-10 21:52:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-02-10 21:52:22,678 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-02-10 21:52:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:22,683 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-02-10 21:52:22,684 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-10 21:52:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-02-10 21:52:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-10 21:52:22,804 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:22,804 INFO L515 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-10 21:52:22,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:52:22,805 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-10 21:52:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-02-10 21:52:22,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:22,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079700545] [2022-02-10 21:52:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:23,279 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-10 21:52:23,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:23,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079700545] [2022-02-10 21:52:23,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079700545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:23,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:23,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-10 21:52:23,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83489392] [2022-02-10 21:52:23,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:23,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-10 21:52:23,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-10 21:52:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-10 21:52:23,282 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-10 21:52:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:26,752 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-02-10 21:52:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-10 21:52:26,753 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-10 21:52:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:27,565 INFO L225 Difference]: With dead ends: 153195 [2022-02-10 21:52:27,566 INFO L226 Difference]: Without dead ends: 152229 [2022-02-10 21:52:27,566 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-02-10 21:52:27,567 INFO L934 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:27,567 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-10 21:52:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-02-10 21:52:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-02-10 21:52:31,178 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-10 21:52:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-02-10 21:52:31,863 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-02-10 21:52:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:31,864 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-02-10 21:52:31,864 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-10 21:52:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-02-10 21:52:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-10 21:52:31,929 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:31,929 INFO L515 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-10 21:52:31,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:52:31,929 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-10 21:52:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-02-10 21:52:31,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:31,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790542076] [2022-02-10 21:52:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:32,299 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-10 21:52:32,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:32,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790542076] [2022-02-10 21:52:32,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790542076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:32,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:32,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-10 21:52:32,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799055464] [2022-02-10 21:52:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:32,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-10 21:52:32,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-10 21:52:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-10 21:52:32,301 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-10 21:52:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:35,702 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-02-10 21:52:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 21:52:35,703 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-10 21:52:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:36,296 INFO L225 Difference]: With dead ends: 159338 [2022-02-10 21:52:36,296 INFO L226 Difference]: Without dead ends: 159086 [2022-02-10 21:52:36,297 INFO L933 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-10 21:52:36,297 INFO L934 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-10 21:52:36,298 INFO L935 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-10 21:52:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-02-10 21:52:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-02-10 21:52:39,898 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-10 21:52:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-02-10 21:52:40,747 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-02-10 21:52:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:40,747 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-02-10 21:52:40,748 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-10 21:52:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-02-10 21:52:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-10 21:52:40,845 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:40,845 INFO L515 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-10 21:52:40,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:52:40,846 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-10 21:52:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-02-10 21:52:40,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:40,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537161971] [2022-02-10 21:52:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:41,223 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-10 21:52:41,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:41,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537161971] [2022-02-10 21:52:41,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537161971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:41,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:41,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-10 21:52:41,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968876135] [2022-02-10 21:52:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:41,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-10 21:52:41,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-10 21:52:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-10 21:52:41,224 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-10 21:52:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:43,932 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-02-10 21:52:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 21:52:43,932 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-10 21:52:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:44,337 INFO L225 Difference]: With dead ends: 131753 [2022-02-10 21:52:44,337 INFO L226 Difference]: Without dead ends: 131585 [2022-02-10 21:52:44,338 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:52:44,338 INFO L934 BasicCegarLoop]: 587 mSDtfsCounter, 2374 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:44,339 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2374 Valid, 5481 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-10 21:52:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-02-10 21:52:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-02-10 21:52:47,170 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-10 21:52:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-02-10 21:52:47,500 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-02-10 21:52:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:47,501 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-02-10 21:52:47,514 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-10 21:52:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-02-10 21:52:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:52:48,001 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:48,001 INFO L515 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-10 21:52:48,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:52:48,001 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-10 21:52:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-02-10 21:52:48,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:48,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951058822] [2022-02-10 21:52:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:48,771 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-10 21:52:48,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:48,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951058822] [2022-02-10 21:52:48,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951058822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:48,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:48,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:52:48,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931451819] [2022-02-10 21:52:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:48,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:52:48,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:48,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:52:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:52:48,773 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-10 21:52:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:56,232 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-02-10 21:52:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 21:52:56,232 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-10 21:52:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:56,809 INFO L225 Difference]: With dead ends: 163236 [2022-02-10 21:52:56,809 INFO L226 Difference]: Without dead ends: 163236 [2022-02-10 21:52:56,810 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-10 21:52:56,810 INFO L934 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.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:56,811 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2940 Valid, 10916 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3846 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-10 21:52:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-02-10 21:52:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-02-10 21:52:59,807 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-10 21:53:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-02-10 21:53:00,542 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-02-10 21:53:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:00,544 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-02-10 21:53:00,544 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-10 21:53:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-02-10 21:53:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:53:00,651 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:00,651 INFO L515 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-10 21:53:00,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:53:00,651 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-10 21:53:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-02-10 21:53:00,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:00,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062488478] [2022-02-10 21:53:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:01,354 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-10 21:53:01,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:01,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062488478] [2022-02-10 21:53:01,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062488478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:01,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:01,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:53:01,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829642322] [2022-02-10 21:53:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:01,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:53:01,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:53:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:53:01,356 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-10 21:53:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:11,274 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-02-10 21:53:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 21:53:11,275 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-10 21:53:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:11,737 INFO L225 Difference]: With dead ends: 170538 [2022-02-10 21:53:11,737 INFO L226 Difference]: Without dead ends: 170538 [2022-02-10 21:53:11,739 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 21:53:11,740 INFO L934 BasicCegarLoop]: 1323 mSDtfsCounter, 3249 mSDsluCounter, 11866 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:11,740 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3249 Valid, 13189 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 21:53:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-02-10 21:53:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-02-10 21:53:14,970 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-10 21:53:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-02-10 21:53:15,768 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-02-10 21:53:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:15,769 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-02-10 21:53:15,769 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-10 21:53:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-02-10 21:53:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:53:15,878 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:15,878 INFO L515 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-10 21:53:15,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:53:15,878 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-10 21:53:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-02-10 21:53:15,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:15,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737210375] [2022-02-10 21:53:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:16,511 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-10 21:53:16,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:16,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737210375] [2022-02-10 21:53:16,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737210375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:16,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:16,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-10 21:53:16,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612662646] [2022-02-10 21:53:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:16,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-10 21:53:16,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-10 21:53:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-02-10 21:53:16,512 INFO L87 Difference]: Start difference. First operand 113321 states and 349329 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-10 21:53:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:23,350 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-02-10 21:53:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-10 21:53:23,351 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-10 21:53:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:23,832 INFO L225 Difference]: With dead ends: 168926 [2022-02-10 21:53:23,832 INFO L226 Difference]: Without dead ends: 168926 [2022-02-10 21:53:23,833 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1763, Invalid=4089, Unknown=0, NotChecked=0, Total=5852 [2022-02-10 21:53:23,833 INFO L934 BasicCegarLoop]: 1242 mSDtfsCounter, 2631 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 10978 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:23,833 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2631 Valid, 10978 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3738 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-10 21:53:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-02-10 21:53:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-02-10 21:53:26,935 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-10 21:53:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-02-10 21:53:27,294 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-02-10 21:53:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:27,294 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-02-10 21:53:27,294 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-10 21:53:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-02-10 21:53:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:53:27,771 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:27,771 INFO L515 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-10 21:53:27,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:53:27,772 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-10 21:53:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-02-10 21:53:27,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:27,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446611486] [2022-02-10 21:53:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:28,313 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-10 21:53:28,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:28,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446611486] [2022-02-10 21:53:28,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446611486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:28,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:28,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-10 21:53:28,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993182499] [2022-02-10 21:53:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:28,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-10 21:53:28,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-10 21:53:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-02-10 21:53:28,315 INFO L87 Difference]: Start difference. First operand 121350 states and 374335 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-10 21:53:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:32,519 INFO L93 Difference]: Finished difference Result 179210 states and 552570 transitions. [2022-02-10 21:53:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 21:53:32,519 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-10 21:53:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:32,998 INFO L225 Difference]: With dead ends: 179210 [2022-02-10 21:53:32,998 INFO L226 Difference]: Without dead ends: 179210 [2022-02-10 21:53:32,999 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-02-10 21:53:32,999 INFO L934 BasicCegarLoop]: 773 mSDtfsCounter, 2332 mSDsluCounter, 8012 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 8785 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:32,999 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2332 Valid, 8785 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-10 21:53:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179210 states. [2022-02-10 21:53:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179210 to 129999. [2022-02-10 21:53:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129999 states, 129995 states have (on average 3.0886572560483097) internal successors, (401510), 129998 states have internal predecessors, (401510), 0 states have call successors, (0), 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-10 21:53:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129999 states to 129999 states and 401510 transitions. [2022-02-10 21:53:37,123 INFO L78 Accepts]: Start accepts. Automaton has 129999 states and 401510 transitions. Word has length 105 [2022-02-10 21:53:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:37,123 INFO L470 AbstractCegarLoop]: Abstraction has 129999 states and 401510 transitions. [2022-02-10 21:53:37,124 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-10 21:53:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 129999 states and 401510 transitions. [2022-02-10 21:53:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:53:37,255 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:37,255 INFO L515 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-10 21:53:37,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:53:37,256 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-10 21:53:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 5 times [2022-02-10 21:53:37,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:37,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061976763] [2022-02-10 21:53:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:38,087 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-10 21:53:38,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:38,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061976763] [2022-02-10 21:53:38,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061976763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:38,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:38,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:53:38,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133679482] [2022-02-10 21:53:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:38,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:53:38,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:53:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:53:38,088 INFO L87 Difference]: Start difference. First operand 129999 states and 401510 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-10 21:53:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:49,222 INFO L93 Difference]: Finished difference Result 181315 states and 558830 transitions. [2022-02-10 21:53:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 21:53:49,223 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-10 21:53:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:49,734 INFO L225 Difference]: With dead ends: 181315 [2022-02-10 21:53:49,734 INFO L226 Difference]: Without dead ends: 181315 [2022-02-10 21:53:49,735 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 21:53:49,736 INFO L934 BasicCegarLoop]: 1497 mSDtfsCounter, 2833 mSDsluCounter, 12722 mSDsCounter, 0 mSdLazyCounter, 4859 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 14219 SdHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:49,737 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2833 Valid, 14219 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4859 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-10 21:53:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181315 states. [2022-02-10 21:53:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181315 to 133605. [2022-02-10 21:53:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133605 states, 133601 states have (on average 3.088270297378014) internal successors, (412596), 133604 states have internal predecessors, (412596), 0 states have call successors, (0), 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-10 21:53:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133605 states to 133605 states and 412596 transitions. [2022-02-10 21:53:54,127 INFO L78 Accepts]: Start accepts. Automaton has 133605 states and 412596 transitions. Word has length 105 [2022-02-10 21:53:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:54,127 INFO L470 AbstractCegarLoop]: Abstraction has 133605 states and 412596 transitions. [2022-02-10 21:53:54,127 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-10 21:53:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133605 states and 412596 transitions. [2022-02-10 21:53:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:53:54,298 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:54,298 INFO L515 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-10 21:53:54,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:53:54,299 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-10 21:53:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 6 times [2022-02-10 21:53:54,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:54,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205582449] [2022-02-10 21:53:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:55,365 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-10 21:53:55,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:55,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205582449] [2022-02-10 21:53:55,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205582449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:55,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:55,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:53:55,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594312108] [2022-02-10 21:53:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:55,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:53:55,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:53:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:53:55,367 INFO L87 Difference]: Start difference. First operand 133605 states and 412596 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-10 21:54:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:05,326 INFO L93 Difference]: Finished difference Result 181605 states and 560461 transitions. [2022-02-10 21:54:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-02-10 21:54:05,327 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-10 21:54:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:06,215 INFO L225 Difference]: With dead ends: 181605 [2022-02-10 21:54:06,216 INFO L226 Difference]: Without dead ends: 181605 [2022-02-10 21:54:06,218 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-02-10 21:54:06,218 INFO L934 BasicCegarLoop]: 1534 mSDtfsCounter, 3039 mSDsluCounter, 12797 mSDsCounter, 0 mSdLazyCounter, 5351 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 14331 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:06,219 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3039 Valid, 14331 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5351 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 21:54:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181605 states. [2022-02-10 21:54:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181605 to 147726. [2022-02-10 21:54:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147726 states, 147722 states have (on average 3.090067830113321) internal successors, (456471), 147725 states have internal predecessors, (456471), 0 states have call successors, (0), 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-10 21:54:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147726 states to 147726 states and 456471 transitions. [2022-02-10 21:54:10,809 INFO L78 Accepts]: Start accepts. Automaton has 147726 states and 456471 transitions. Word has length 105 [2022-02-10 21:54:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:10,809 INFO L470 AbstractCegarLoop]: Abstraction has 147726 states and 456471 transitions. [2022-02-10 21:54:10,810 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-10 21:54:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 147726 states and 456471 transitions. [2022-02-10 21:54:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:54:10,980 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:10,980 INFO L515 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-10 21:54:10,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:54:10,980 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-10 21:54:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 7 times [2022-02-10 21:54:10,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:10,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104167346] [2022-02-10 21:54:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:11,803 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-10 21:54:11,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:11,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104167346] [2022-02-10 21:54:11,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104167346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:11,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:11,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:54:11,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680015834] [2022-02-10 21:54:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:11,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:54:11,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:54:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:54:11,806 INFO L87 Difference]: Start difference. First operand 147726 states and 456471 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-10 21:54:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:17,695 INFO L93 Difference]: Finished difference Result 245075 states and 758642 transitions. [2022-02-10 21:54:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-10 21:54:17,696 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-10 21:54:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:18,929 INFO L225 Difference]: With dead ends: 245075 [2022-02-10 21:54:18,929 INFO L226 Difference]: Without dead ends: 245075 [2022-02-10 21:54:18,930 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1098, Invalid=2934, Unknown=0, NotChecked=0, Total=4032 [2022-02-10 21:54:18,931 INFO L934 BasicCegarLoop]: 799 mSDtfsCounter, 2866 mSDsluCounter, 9631 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 10430 SdHoareTripleChecker+Invalid, 4171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:18,931 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 10430 Invalid, 4171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-10 21:54:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245075 states. [2022-02-10 21:54:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245075 to 163133. [2022-02-10 21:54:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163133 states, 163129 states have (on average 3.095041347645115) internal successors, (504891), 163132 states have internal predecessors, (504891), 0 states have call successors, (0), 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-10 21:54:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163133 states to 163133 states and 504891 transitions. [2022-02-10 21:54:24,164 INFO L78 Accepts]: Start accepts. Automaton has 163133 states and 504891 transitions. Word has length 105 [2022-02-10 21:54:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:24,165 INFO L470 AbstractCegarLoop]: Abstraction has 163133 states and 504891 transitions. [2022-02-10 21:54:24,165 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-10 21:54:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 163133 states and 504891 transitions. [2022-02-10 21:54:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:54:24,366 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:24,366 INFO L515 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-10 21:54:24,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:54:24,366 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-10 21:54:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 8 times [2022-02-10 21:54:24,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:24,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550193517] [2022-02-10 21:54:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:24,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:25,010 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-10 21:54:25,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:25,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550193517] [2022-02-10 21:54:25,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550193517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:25,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:25,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:54:25,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544922670] [2022-02-10 21:54:25,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:25,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:54:25,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:25,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:54:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:54:25,012 INFO L87 Difference]: Start difference. First operand 163133 states and 504891 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-10 21:54:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:32,748 INFO L93 Difference]: Finished difference Result 244447 states and 755883 transitions. [2022-02-10 21:54:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-10 21:54:32,771 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-10 21:54:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:33,561 INFO L225 Difference]: With dead ends: 244447 [2022-02-10 21:54:33,562 INFO L226 Difference]: Without dead ends: 244447 [2022-02-10 21:54:33,563 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-10 21:54:33,563 INFO L934 BasicCegarLoop]: 941 mSDtfsCounter, 3199 mSDsluCounter, 10610 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 11551 SdHoareTripleChecker+Invalid, 4530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:33,563 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 11551 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-10 21:54:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244447 states. [2022-02-10 21:54:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244447 to 165179. [2022-02-10 21:54:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165179 states, 165175 states have (on average 3.0942636597548057) internal successors, (511095), 165178 states have internal predecessors, (511095), 0 states have call successors, (0), 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-10 21:54:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165179 states to 165179 states and 511095 transitions. [2022-02-10 21:54:38,832 INFO L78 Accepts]: Start accepts. Automaton has 165179 states and 511095 transitions. Word has length 105 [2022-02-10 21:54:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:38,832 INFO L470 AbstractCegarLoop]: Abstraction has 165179 states and 511095 transitions. [2022-02-10 21:54:38,832 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-10 21:54:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 165179 states and 511095 transitions. [2022-02-10 21:54:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:54:39,076 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:39,076 INFO L515 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-10 21:54:39,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:54:39,076 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-10 21:54:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 9 times [2022-02-10 21:54:39,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:39,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753877639] [2022-02-10 21:54:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:40,261 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-10 21:54:40,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:40,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753877639] [2022-02-10 21:54:40,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753877639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:40,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:40,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:54:40,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982044405] [2022-02-10 21:54:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:40,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:54:40,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:54:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:54:40,263 INFO L87 Difference]: Start difference. First operand 165179 states and 511095 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-10 21:54:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:48,968 INFO L93 Difference]: Finished difference Result 237707 states and 734606 transitions. [2022-02-10 21:54:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 21:54:48,969 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-10 21:54:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:50,290 INFO L225 Difference]: With dead ends: 237707 [2022-02-10 21:54:50,291 INFO L226 Difference]: Without dead ends: 237707 [2022-02-10 21:54:50,292 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1481, Invalid=3631, Unknown=0, NotChecked=0, Total=5112 [2022-02-10 21:54:50,293 INFO L934 BasicCegarLoop]: 1111 mSDtfsCounter, 2406 mSDsluCounter, 11858 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 12969 SdHoareTripleChecker+Invalid, 5138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:50,293 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2406 Valid, 12969 Invalid, 5138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 5056 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-10 21:54:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237707 states. [2022-02-10 21:54:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237707 to 166884. [2022-02-10 21:54:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166884 states, 166880 states have (on average 3.0943732023010546) internal successors, (516389), 166883 states have internal predecessors, (516389), 0 states have call successors, (0), 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-10 21:54:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166884 states to 166884 states and 516389 transitions. [2022-02-10 21:54:55,966 INFO L78 Accepts]: Start accepts. Automaton has 166884 states and 516389 transitions. Word has length 105 [2022-02-10 21:54:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:55,966 INFO L470 AbstractCegarLoop]: Abstraction has 166884 states and 516389 transitions. [2022-02-10 21:54:55,966 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-10 21:54:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 166884 states and 516389 transitions. [2022-02-10 21:54:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:54:56,207 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:56,208 INFO L515 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-10 21:54:56,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:54:56,208 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-10 21:54:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 10 times [2022-02-10 21:54:56,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:56,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862399948] [2022-02-10 21:54:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:56,866 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-10 21:54:56,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:56,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862399948] [2022-02-10 21:54:56,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862399948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:56,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:56,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:54:56,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848755573] [2022-02-10 21:54:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:56,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:54:56,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:54:56,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:54:56,867 INFO L87 Difference]: Start difference. First operand 166884 states and 516389 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-10 21:55:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:09,365 INFO L93 Difference]: Finished difference Result 212764 states and 657439 transitions. [2022-02-10 21:55:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-10 21:55:09,378 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-10 21:55:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:10,110 INFO L225 Difference]: With dead ends: 212764 [2022-02-10 21:55:10,110 INFO L226 Difference]: Without dead ends: 212764 [2022-02-10 21:55:10,111 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-02-10 21:55:10,111 INFO L934 BasicCegarLoop]: 1640 mSDtfsCounter, 3149 mSDsluCounter, 13318 mSDsCounter, 0 mSdLazyCounter, 5515 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3149 SdHoareTripleChecker+Valid, 14958 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 5515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:10,111 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3149 Valid, 14958 Invalid, 5616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 5515 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-10 21:55:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212764 states. [2022-02-10 21:55:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212764 to 149247. [2022-02-10 21:55:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149247 states, 149243 states have (on average 3.0930093873749525) internal successors, (461610), 149246 states have internal predecessors, (461610), 0 states have call successors, (0), 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-10 21:55:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149247 states to 149247 states and 461610 transitions. [2022-02-10 21:55:14,622 INFO L78 Accepts]: Start accepts. Automaton has 149247 states and 461610 transitions. Word has length 105 [2022-02-10 21:55:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:14,623 INFO L470 AbstractCegarLoop]: Abstraction has 149247 states and 461610 transitions. [2022-02-10 21:55:14,623 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-10 21:55:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 149247 states and 461610 transitions. [2022-02-10 21:55:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:55:15,205 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:15,205 INFO L515 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-10 21:55:15,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-10 21:55:15,206 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-10 21:55:15,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 11 times [2022-02-10 21:55:15,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:15,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502675660] [2022-02-10 21:55:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:15,808 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-10 21:55:15,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:15,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502675660] [2022-02-10 21:55:15,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502675660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:15,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:15,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-10 21:55:15,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115556125] [2022-02-10 21:55:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:15,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-10 21:55:15,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-10 21:55:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-02-10 21:55:15,810 INFO L87 Difference]: Start difference. First operand 149247 states and 461610 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-10 21:55:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:20,210 INFO L93 Difference]: Finished difference Result 200958 states and 621007 transitions. [2022-02-10 21:55:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 21:55:20,210 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-10 21:55:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:20,841 INFO L225 Difference]: With dead ends: 200958 [2022-02-10 21:55:20,841 INFO L226 Difference]: Without dead ends: 200958 [2022-02-10 21:55:20,841 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-02-10 21:55:20,842 INFO L934 BasicCegarLoop]: 780 mSDtfsCounter, 2779 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 8172 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:20,842 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2779 Valid, 8172 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-10 21:55:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200958 states. [2022-02-10 21:55:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200958 to 149433. [2022-02-10 21:55:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149433 states, 149429 states have (on average 3.093556137028288) internal successors, (462267), 149432 states have internal predecessors, (462267), 0 states have call successors, (0), 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-10 21:55:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149433 states to 149433 states and 462267 transitions. [2022-02-10 21:55:25,280 INFO L78 Accepts]: Start accepts. Automaton has 149433 states and 462267 transitions. Word has length 105 [2022-02-10 21:55:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:25,280 INFO L470 AbstractCegarLoop]: Abstraction has 149433 states and 462267 transitions. [2022-02-10 21:55:25,280 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-10 21:55:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 149433 states and 462267 transitions. [2022-02-10 21:55:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:55:25,821 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:25,821 INFO L515 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-10 21:55:25,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-10 21:55:25,822 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-10 21:55:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 12 times [2022-02-10 21:55:25,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:25,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079083552] [2022-02-10 21:55:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:26,553 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-10 21:55:26,553 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:26,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079083552] [2022-02-10 21:55:26,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079083552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:26,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:26,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:55:26,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534610213] [2022-02-10 21:55:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:26,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:55:26,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:55:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:55:26,554 INFO L87 Difference]: Start difference. First operand 149433 states and 462267 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-10 21:55:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:33,453 INFO L93 Difference]: Finished difference Result 190870 states and 589795 transitions. [2022-02-10 21:55:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-10 21:55:33,453 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-10 21:55:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:34,421 INFO L225 Difference]: With dead ends: 190870 [2022-02-10 21:55:34,421 INFO L226 Difference]: Without dead ends: 190870 [2022-02-10 21:55:34,422 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-02-10 21:55:34,422 INFO L934 BasicCegarLoop]: 986 mSDtfsCounter, 2685 mSDsluCounter, 8646 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 9632 SdHoareTripleChecker+Invalid, 3766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:34,422 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2685 Valid, 9632 Invalid, 3766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-10 21:55:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190870 states. [2022-02-10 21:55:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190870 to 151262. [2022-02-10 21:55:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151262 states, 151258 states have (on average 3.093839664678893) internal successors, (467968), 151261 states have internal predecessors, (467968), 0 states have call successors, (0), 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-10 21:55:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151262 states to 151262 states and 467968 transitions. [2022-02-10 21:55:39,069 INFO L78 Accepts]: Start accepts. Automaton has 151262 states and 467968 transitions. Word has length 105 [2022-02-10 21:55:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:39,069 INFO L470 AbstractCegarLoop]: Abstraction has 151262 states and 467968 transitions. [2022-02-10 21:55:39,069 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-10 21:55:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 151262 states and 467968 transitions. [2022-02-10 21:55:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:55:39,248 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:39,249 INFO L515 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-10 21:55:39,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-10 21:55:39,249 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-10 21:55:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 13 times [2022-02-10 21:55:39,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:39,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912260978] [2022-02-10 21:55:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:40,340 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-10 21:55:40,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:40,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912260978] [2022-02-10 21:55:40,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912260978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:40,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:40,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:55:40,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073448792] [2022-02-10 21:55:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:40,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:55:40,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:55:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:55:40,341 INFO L87 Difference]: Start difference. First operand 151262 states and 467968 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-10 21:55:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:51,861 INFO L93 Difference]: Finished difference Result 177136 states and 546989 transitions. [2022-02-10 21:55:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-10 21:55:51,862 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-10 21:55:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:52,383 INFO L225 Difference]: With dead ends: 177136 [2022-02-10 21:55:52,384 INFO L226 Difference]: Without dead ends: 177136 [2022-02-10 21:55:52,384 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-02-10 21:55:52,385 INFO L934 BasicCegarLoop]: 1679 mSDtfsCounter, 3134 mSDsluCounter, 15721 mSDsCounter, 0 mSdLazyCounter, 6273 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3134 SdHoareTripleChecker+Valid, 17400 SdHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 6273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:52,385 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3134 Valid, 17400 Invalid, 6370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 6273 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-10 21:55:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177136 states. [2022-02-10 21:55:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177136 to 128901. [2022-02-10 21:55:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128901 states, 128897 states have (on average 3.0884582263357565) internal successors, (398093), 128900 states have internal predecessors, (398093), 0 states have call successors, (0), 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-10 21:55:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128901 states to 128901 states and 398093 transitions. [2022-02-10 21:55:56,587 INFO L78 Accepts]: Start accepts. Automaton has 128901 states and 398093 transitions. Word has length 105 [2022-02-10 21:55:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:56,588 INFO L470 AbstractCegarLoop]: Abstraction has 128901 states and 398093 transitions. [2022-02-10 21:55:56,588 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-10 21:55:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 128901 states and 398093 transitions. [2022-02-10 21:55:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:55:56,718 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:56,718 INFO L515 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-10 21:55:56,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-10 21:55:56,718 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-10 21:55:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 14 times [2022-02-10 21:55:56,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:56,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526387867] [2022-02-10 21:55:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:57,325 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-10 21:55:57,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:57,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526387867] [2022-02-10 21:55:57,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526387867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:57,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:57,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:55:57,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602467150] [2022-02-10 21:55:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:57,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:55:57,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:55:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:55:57,327 INFO L87 Difference]: Start difference. First operand 128901 states and 398093 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-10 21:56:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:09,491 INFO L93 Difference]: Finished difference Result 159157 states and 489956 transitions. [2022-02-10 21:56:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-10 21:56:09,492 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-10 21:56:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:10,010 INFO L225 Difference]: With dead ends: 159157 [2022-02-10 21:56:10,010 INFO L226 Difference]: Without dead ends: 159157 [2022-02-10 21:56:10,011 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3084, Invalid=7422, Unknown=0, NotChecked=0, Total=10506 [2022-02-10 21:56:10,011 INFO L934 BasicCegarLoop]: 1732 mSDtfsCounter, 3155 mSDsluCounter, 13248 mSDsCounter, 0 mSdLazyCounter, 5501 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3155 SdHoareTripleChecker+Valid, 14980 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 5501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:10,012 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3155 Valid, 14980 Invalid, 5600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 5501 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-10 21:56:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159157 states. [2022-02-10 21:56:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159157 to 133034. [2022-02-10 21:56:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133034 states, 133030 states have (on average 3.087025482973765) internal successors, (410667), 133033 states have internal predecessors, (410667), 0 states have call successors, (0), 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-10 21:56:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133034 states to 133034 states and 410667 transitions. [2022-02-10 21:56:14,458 INFO L78 Accepts]: Start accepts. Automaton has 133034 states and 410667 transitions. Word has length 105 [2022-02-10 21:56:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:56:14,459 INFO L470 AbstractCegarLoop]: Abstraction has 133034 states and 410667 transitions. [2022-02-10 21:56:14,459 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-10 21:56:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 133034 states and 410667 transitions. [2022-02-10 21:56:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:56:14,602 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:56:14,602 INFO L515 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-10 21:56:14,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-10 21:56:14,603 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-10 21:56:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:56:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 15 times [2022-02-10 21:56:14,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:56:14,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130098885] [2022-02-10 21:56:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:56:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:56:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:56:15,199 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-10 21:56:15,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:56:15,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130098885] [2022-02-10 21:56:15,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130098885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:56:15,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:56:15,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:56:15,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889580892] [2022-02-10 21:56:15,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:56:15,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:56:15,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:56:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:56:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:56:15,201 INFO L87 Difference]: Start difference. First operand 133034 states and 410667 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-10 21:56:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:22,482 INFO L93 Difference]: Finished difference Result 180071 states and 554449 transitions. [2022-02-10 21:56:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 21:56:22,483 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-10 21:56:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:23,000 INFO L225 Difference]: With dead ends: 180071 [2022-02-10 21:56:23,001 INFO L226 Difference]: Without dead ends: 180071 [2022-02-10 21:56:23,001 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-10 21:56:23,001 INFO L934 BasicCegarLoop]: 1050 mSDtfsCounter, 3606 mSDsluCounter, 9302 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3606 SdHoareTripleChecker+Valid, 10352 SdHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:23,002 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3606 Valid, 10352 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-10 21:56:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180071 states. [2022-02-10 21:56:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180071 to 134522. [2022-02-10 21:56:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134522 states, 134518 states have (on average 3.0868285285240638) internal successors, (415234), 134521 states have internal predecessors, (415234), 0 states have call successors, (0), 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-10 21:56:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134522 states to 134522 states and 415234 transitions. [2022-02-10 21:56:27,501 INFO L78 Accepts]: Start accepts. Automaton has 134522 states and 415234 transitions. Word has length 105 [2022-02-10 21:56:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:56:27,501 INFO L470 AbstractCegarLoop]: Abstraction has 134522 states and 415234 transitions. [2022-02-10 21:56:27,502 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-10 21:56:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 134522 states and 415234 transitions. [2022-02-10 21:56:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:56:27,643 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:56:27,643 INFO L515 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-10 21:56:27,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-10 21:56:27,643 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-10 21:56:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:56:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 16 times [2022-02-10 21:56:27,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:56:27,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311911489] [2022-02-10 21:56:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:56:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:56:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:56:28,493 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-10 21:56:28,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:56:28,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311911489] [2022-02-10 21:56:28,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311911489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:56:28,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:56:28,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:56:28,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029827700] [2022-02-10 21:56:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:56:28,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:56:28,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:56:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:56:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:56:28,495 INFO L87 Difference]: Start difference. First operand 134522 states and 415234 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-10 21:56:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:39,257 INFO L93 Difference]: Finished difference Result 187373 states and 576994 transitions. [2022-02-10 21:56:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 21:56:39,258 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-10 21:56:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:40,145 INFO L225 Difference]: With dead ends: 187373 [2022-02-10 21:56:40,145 INFO L226 Difference]: Without dead ends: 187373 [2022-02-10 21:56:40,150 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 21:56:40,151 INFO L934 BasicCegarLoop]: 1335 mSDtfsCounter, 3074 mSDsluCounter, 14417 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3074 SdHoareTripleChecker+Valid, 15752 SdHoareTripleChecker+Invalid, 5834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:40,151 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3074 Valid, 15752 Invalid, 5834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-10 21:56:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187373 states. [2022-02-10 21:56:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187373 to 135018. [2022-02-10 21:56:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135018 states, 135014 states have (on average 3.0870354185491875) internal successors, (416793), 135017 states have internal predecessors, (416793), 0 states have call successors, (0), 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-10 21:56:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135018 states to 135018 states and 416793 transitions. [2022-02-10 21:56:44,222 INFO L78 Accepts]: Start accepts. Automaton has 135018 states and 416793 transitions. Word has length 105 [2022-02-10 21:56:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:56:44,222 INFO L470 AbstractCegarLoop]: Abstraction has 135018 states and 416793 transitions. [2022-02-10 21:56:44,222 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-10 21:56:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 135018 states and 416793 transitions. [2022-02-10 21:56:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:56:44,789 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:56:44,789 INFO L515 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-10 21:56:44,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-10 21:56:44,790 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-10 21:56:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:56:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 17 times [2022-02-10 21:56:44,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:56:44,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565608862] [2022-02-10 21:56:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:56:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:56:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:56:45,487 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-10 21:56:45,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:56:45,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565608862] [2022-02-10 21:56:45,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565608862] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:56:45,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:56:45,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:56:45,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307169161] [2022-02-10 21:56:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:56:45,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:56:45,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:56:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:56:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:56:45,489 INFO L87 Difference]: Start difference. First operand 135018 states and 416793 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-10 21:56:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:55,532 INFO L93 Difference]: Finished difference Result 186495 states and 574243 transitions. [2022-02-10 21:56:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-10 21:56:55,532 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-10 21:56:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:56,090 INFO L225 Difference]: With dead ends: 186495 [2022-02-10 21:56:56,090 INFO L226 Difference]: Without dead ends: 186495 [2022-02-10 21:56:56,091 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-02-10 21:56:56,091 INFO L934 BasicCegarLoop]: 1374 mSDtfsCounter, 2518 mSDsluCounter, 10449 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 11823 SdHoareTripleChecker+Invalid, 4146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:56,091 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2518 Valid, 11823 Invalid, 4146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-10 21:56:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186495 states. [2022-02-10 21:56:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186495 to 143326. [2022-02-10 21:56:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143326 states, 143322 states have (on average 3.0884651344524916) internal successors, (442645), 143325 states have internal predecessors, (442645), 0 states have call successors, (0), 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-10 21:57:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143326 states to 143326 states and 442645 transitions. [2022-02-10 21:57:00,657 INFO L78 Accepts]: Start accepts. Automaton has 143326 states and 442645 transitions. Word has length 105 [2022-02-10 21:57:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:00,657 INFO L470 AbstractCegarLoop]: Abstraction has 143326 states and 442645 transitions. [2022-02-10 21:57:00,657 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-10 21:57:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 143326 states and 442645 transitions. [2022-02-10 21:57:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:57:00,842 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:00,842 INFO L515 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-10 21:57:00,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-10 21:57:00,842 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-10 21:57:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 18 times [2022-02-10 21:57:00,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:00,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138980955] [2022-02-10 21:57:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:01,912 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-10 21:57:01,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:01,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138980955] [2022-02-10 21:57:01,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138980955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:01,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:01,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:57:01,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999670703] [2022-02-10 21:57:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:01,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:57:01,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:57:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:57:01,914 INFO L87 Difference]: Start difference. First operand 143326 states and 442645 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-10 21:57:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:08,746 INFO L93 Difference]: Finished difference Result 199052 states and 613803 transitions. [2022-02-10 21:57:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 21:57:08,746 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-10 21:57:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:09,647 INFO L225 Difference]: With dead ends: 199052 [2022-02-10 21:57:09,647 INFO L226 Difference]: Without dead ends: 199052 [2022-02-10 21:57:09,648 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-10 21:57:09,648 INFO L934 BasicCegarLoop]: 816 mSDtfsCounter, 3476 mSDsluCounter, 9431 mSDsCounter, 0 mSdLazyCounter, 3793 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 10247 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:09,648 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3476 Valid, 10247 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-10 21:57:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199052 states. [2022-02-10 21:57:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199052 to 150332. [2022-02-10 21:57:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150332 states, 150328 states have (on average 3.0917460486403066) internal successors, (464776), 150331 states have internal predecessors, (464776), 0 states have call successors, (0), 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-10 21:57:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150332 states to 150332 states and 464776 transitions. [2022-02-10 21:57:14,670 INFO L78 Accepts]: Start accepts. Automaton has 150332 states and 464776 transitions. Word has length 105 [2022-02-10 21:57:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:14,670 INFO L470 AbstractCegarLoop]: Abstraction has 150332 states and 464776 transitions. [2022-02-10 21:57:14,671 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-10 21:57:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 150332 states and 464776 transitions. [2022-02-10 21:57:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:57:14,863 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:14,863 INFO L515 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-10 21:57:14,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-10 21:57:14,864 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-10 21:57:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 19 times [2022-02-10 21:57:14,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:14,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544981547] [2022-02-10 21:57:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:15,730 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-10 21:57:15,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:15,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544981547] [2022-02-10 21:57:15,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544981547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:15,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:15,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:57:15,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856137342] [2022-02-10 21:57:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:15,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:57:15,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:57:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:57:15,731 INFO L87 Difference]: Start difference. First operand 150332 states and 464776 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-10 21:57:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:23,112 INFO L93 Difference]: Finished difference Result 199269 states and 614244 transitions. [2022-02-10 21:57:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-10 21:57:23,113 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-10 21:57:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:23,761 INFO L225 Difference]: With dead ends: 199269 [2022-02-10 21:57:23,761 INFO L226 Difference]: Without dead ends: 199269 [2022-02-10 21:57:23,762 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-10 21:57:23,762 INFO L934 BasicCegarLoop]: 958 mSDtfsCounter, 3083 mSDsluCounter, 9230 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3083 SdHoareTripleChecker+Valid, 10188 SdHoareTripleChecker+Invalid, 3835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:23,762 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3083 Valid, 10188 Invalid, 3835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3757 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-10 21:57:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199269 states. [2022-02-10 21:57:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199269 to 151448. [2022-02-10 21:57:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151448 states, 151444 states have (on average 3.091307678085629) internal successors, (468160), 151447 states have internal predecessors, (468160), 0 states have call successors, (0), 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-10 21:57:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151448 states to 151448 states and 468160 transitions. [2022-02-10 21:57:28,498 INFO L78 Accepts]: Start accepts. Automaton has 151448 states and 468160 transitions. Word has length 105 [2022-02-10 21:57:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:28,498 INFO L470 AbstractCegarLoop]: Abstraction has 151448 states and 468160 transitions. [2022-02-10 21:57:28,498 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-10 21:57:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 151448 states and 468160 transitions. [2022-02-10 21:57:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:57:28,674 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:28,674 INFO L515 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-10 21:57:28,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-10 21:57:28,675 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-10 21:57:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 20 times [2022-02-10 21:57:28,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:28,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119695378] [2022-02-10 21:57:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:29,518 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-10 21:57:29,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:29,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119695378] [2022-02-10 21:57:29,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119695378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:29,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:29,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:57:29,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475875648] [2022-02-10 21:57:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:29,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:57:29,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:29,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:57:29,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:57:29,520 INFO L87 Difference]: Start difference. First operand 151448 states and 468160 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-10 21:57:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:40,949 INFO L93 Difference]: Finished difference Result 198718 states and 612275 transitions. [2022-02-10 21:57:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 21:57:40,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-10 21:57:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:41,702 INFO L225 Difference]: With dead ends: 198718 [2022-02-10 21:57:41,702 INFO L226 Difference]: Without dead ends: 198718 [2022-02-10 21:57:41,703 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 21:57:41,703 INFO L934 BasicCegarLoop]: 1509 mSDtfsCounter, 3107 mSDsluCounter, 13220 mSDsCounter, 0 mSdLazyCounter, 5310 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3107 SdHoareTripleChecker+Valid, 14729 SdHoareTripleChecker+Invalid, 5408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 5310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:41,704 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3107 Valid, 14729 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 5310 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-10 21:57:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198718 states. [2022-02-10 21:57:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198718 to 144039. [2022-02-10 21:57:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144039 states, 144035 states have (on average 3.0900961571840178) internal successors, (445082), 144038 states have internal predecessors, (445082), 0 states have call successors, (0), 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-10 21:57:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144039 states to 144039 states and 445082 transitions. [2022-02-10 21:57:45,836 INFO L78 Accepts]: Start accepts. Automaton has 144039 states and 445082 transitions. Word has length 105 [2022-02-10 21:57:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:45,836 INFO L470 AbstractCegarLoop]: Abstraction has 144039 states and 445082 transitions. [2022-02-10 21:57:45,836 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-10 21:57:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 144039 states and 445082 transitions. [2022-02-10 21:57:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:57:46,395 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:46,395 INFO L515 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-10 21:57:46,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-10 21:57:46,395 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-10 21:57:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 21 times [2022-02-10 21:57:46,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:46,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201939198] [2022-02-10 21:57:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:47,079 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-10 21:57:47,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:47,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201939198] [2022-02-10 21:57:47,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201939198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:47,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:47,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:57:47,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850293982] [2022-02-10 21:57:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:47,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:57:47,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:57:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:57:47,080 INFO L87 Difference]: Start difference. First operand 144039 states and 445082 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-10 21:57:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:57,405 INFO L93 Difference]: Finished difference Result 190782 states and 587489 transitions. [2022-02-10 21:57:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-10 21:57:57,405 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-10 21:57:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:58,321 INFO L225 Difference]: With dead ends: 190782 [2022-02-10 21:57:58,321 INFO L226 Difference]: Without dead ends: 190782 [2022-02-10 21:57:58,322 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 21:57:58,322 INFO L934 BasicCegarLoop]: 1538 mSDtfsCounter, 2853 mSDsluCounter, 11410 mSDsCounter, 0 mSdLazyCounter, 4424 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2853 SdHoareTripleChecker+Valid, 12948 SdHoareTripleChecker+Invalid, 4511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:58,323 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2853 Valid, 12948 Invalid, 4511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4424 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-10 21:57:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190782 states. [2022-02-10 21:58:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190782 to 142551. [2022-02-10 21:58:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142551 states, 142547 states have (on average 3.0899282341964405) internal successors, (440460), 142550 states have internal predecessors, (440460), 0 states have call successors, (0), 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-10 21:58:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142551 states to 142551 states and 440460 transitions. [2022-02-10 21:58:03,299 INFO L78 Accepts]: Start accepts. Automaton has 142551 states and 440460 transitions. Word has length 105 [2022-02-10 21:58:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:03,299 INFO L470 AbstractCegarLoop]: Abstraction has 142551 states and 440460 transitions. [2022-02-10 21:58:03,299 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-10 21:58:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 142551 states and 440460 transitions. [2022-02-10 21:58:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:58:03,447 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:03,447 INFO L515 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-10 21:58:03,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-10 21:58:03,447 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-10 21:58:03,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 22 times [2022-02-10 21:58:03,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:03,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15800107] [2022-02-10 21:58:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:04,133 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-10 21:58:04,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:04,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15800107] [2022-02-10 21:58:04,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15800107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:04,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:04,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:58:04,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421504721] [2022-02-10 21:58:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:04,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:58:04,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:04,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:58:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:58:04,134 INFO L87 Difference]: Start difference. First operand 142551 states and 440460 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-10 21:58:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:58:11,520 INFO L93 Difference]: Finished difference Result 233273 states and 720655 transitions. [2022-02-10 21:58:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 21:58:11,521 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-10 21:58:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:58:12,682 INFO L225 Difference]: With dead ends: 233273 [2022-02-10 21:58:12,683 INFO L226 Difference]: Without dead ends: 233273 [2022-02-10 21:58:12,683 INFO L933 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-10 21:58:12,684 INFO L934 BasicCegarLoop]: 820 mSDtfsCounter, 3181 mSDsluCounter, 10654 mSDsCounter, 0 mSdLazyCounter, 4667 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 11474 SdHoareTripleChecker+Invalid, 4750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:58:12,684 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3181 Valid, 11474 Invalid, 4750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4667 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-10 21:58:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233273 states. [2022-02-10 21:58:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233273 to 153091. [2022-02-10 21:58:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153091 states, 153087 states have (on average 3.093633032197378) internal successors, (473595), 153090 states have internal predecessors, (473595), 0 states have call successors, (0), 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-10 21:58:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153091 states to 153091 states and 473595 transitions. [2022-02-10 21:58:17,409 INFO L78 Accepts]: Start accepts. Automaton has 153091 states and 473595 transitions. Word has length 105 [2022-02-10 21:58:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:17,409 INFO L470 AbstractCegarLoop]: Abstraction has 153091 states and 473595 transitions. [2022-02-10 21:58:17,410 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-10 21:58:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 153091 states and 473595 transitions. [2022-02-10 21:58:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:58:18,004 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:18,004 INFO L515 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-10 21:58:18,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-10 21:58:18,004 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-10 21:58:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 23 times [2022-02-10 21:58:18,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:18,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282863267] [2022-02-10 21:58:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:18,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:18,624 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-10 21:58:18,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:18,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282863267] [2022-02-10 21:58:18,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282863267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:18,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:18,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:58:18,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392680754] [2022-02-10 21:58:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:18,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:58:18,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:58:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:58:18,625 INFO L87 Difference]: Start difference. First operand 153091 states and 473595 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-10 21:58:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:58:26,016 INFO L93 Difference]: Finished difference Result 232808 states and 718687 transitions. [2022-02-10 21:58:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-10 21:58:26,017 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-10 21:58:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:58:26,870 INFO L225 Difference]: With dead ends: 232808 [2022-02-10 21:58:26,871 INFO L226 Difference]: Without dead ends: 232808 [2022-02-10 21:58:26,871 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-10 21:58:26,872 INFO L934 BasicCegarLoop]: 953 mSDtfsCounter, 2839 mSDsluCounter, 9942 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 4322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-10 21:58:26,873 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2839 Valid, 10895 Invalid, 4322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-10 21:58:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232808 states. [2022-02-10 21:58:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232808 to 154207. [2022-02-10 21:58:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154207 states, 154203 states have (on average 3.0931888484659833) internal successors, (476979), 154206 states have internal predecessors, (476979), 0 states have call successors, (0), 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-10 21:58:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154207 states to 154207 states and 476979 transitions. [2022-02-10 21:58:32,018 INFO L78 Accepts]: Start accepts. Automaton has 154207 states and 476979 transitions. Word has length 105 [2022-02-10 21:58:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:32,018 INFO L470 AbstractCegarLoop]: Abstraction has 154207 states and 476979 transitions. [2022-02-10 21:58:32,018 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-10 21:58:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 154207 states and 476979 transitions. [2022-02-10 21:58:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:58:32,220 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:32,220 INFO L515 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-10 21:58:32,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-10 21:58:32,220 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-10 21:58:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 24 times [2022-02-10 21:58:32,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:32,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276874723] [2022-02-10 21:58:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:33,306 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-10 21:58:33,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:33,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276874723] [2022-02-10 21:58:33,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276874723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:33,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:33,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:58:33,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871751839] [2022-02-10 21:58:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:33,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:58:33,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:33,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:58:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:58:33,307 INFO L87 Difference]: Start difference. First operand 154207 states and 476979 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-10 21:58:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:58:41,676 INFO L93 Difference]: Finished difference Result 227349 states and 701584 transitions. [2022-02-10 21:58:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 21:58:41,676 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-10 21:58:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:58:43,056 INFO L225 Difference]: With dead ends: 227349 [2022-02-10 21:58:43,056 INFO L226 Difference]: Without dead ends: 227349 [2022-02-10 21:58:43,057 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-02-10 21:58:43,057 INFO L934 BasicCegarLoop]: 1123 mSDtfsCounter, 2470 mSDsluCounter, 10956 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 12079 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 4795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:58:43,057 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2470 Valid, 12079 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 4795 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-10 21:58:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227349 states. [2022-02-10 21:58:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227349 to 155230. [2022-02-10 21:58:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155230 states, 155226 states have (on average 3.0931867084122504) internal successors, (480143), 155229 states have internal predecessors, (480143), 0 states have call successors, (0), 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-10 21:58:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155230 states to 155230 states and 480143 transitions. [2022-02-10 21:58:48,413 INFO L78 Accepts]: Start accepts. Automaton has 155230 states and 480143 transitions. Word has length 105 [2022-02-10 21:58:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:48,413 INFO L470 AbstractCegarLoop]: Abstraction has 155230 states and 480143 transitions. [2022-02-10 21:58:48,413 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-10 21:58:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 155230 states and 480143 transitions. [2022-02-10 21:58:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:58:48,633 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:48,633 INFO L515 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-10 21:58:48,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-10 21:58:48,634 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-10 21:58:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 25 times [2022-02-10 21:58:48,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:48,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249086607] [2022-02-10 21:58:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:49,657 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-10 21:58:49,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:49,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249086607] [2022-02-10 21:58:49,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249086607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:49,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:49,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:58:49,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087906845] [2022-02-10 21:58:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:49,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:58:49,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:58:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:58:49,659 INFO L87 Difference]: Start difference. First operand 155230 states and 480143 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-10 21:59:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:00,945 INFO L93 Difference]: Finished difference Result 221250 states and 682464 transitions. [2022-02-10 21:59:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-10 21:59:00,946 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-10 21:59:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:01,592 INFO L225 Difference]: With dead ends: 221250 [2022-02-10 21:59:01,592 INFO L226 Difference]: Without dead ends: 221250 [2022-02-10 21:59:01,592 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2549, Invalid=6007, Unknown=0, NotChecked=0, Total=8556 [2022-02-10 21:59:01,593 INFO L934 BasicCegarLoop]: 1628 mSDtfsCounter, 2867 mSDsluCounter, 11882 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 13510 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:01,595 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2867 Valid, 13510 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-10 21:59:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221250 states. [2022-02-10 21:59:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221250 to 153246. [2022-02-10 21:59:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153246 states, 153242 states have (on average 3.0936362093942913) internal successors, (474075), 153245 states have internal predecessors, (474075), 0 states have call successors, (0), 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-10 21:59:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153246 states to 153246 states and 474075 transitions. [2022-02-10 21:59:06,525 INFO L78 Accepts]: Start accepts. Automaton has 153246 states and 474075 transitions. Word has length 105 [2022-02-10 21:59:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:06,525 INFO L470 AbstractCegarLoop]: Abstraction has 153246 states and 474075 transitions. [2022-02-10 21:59:06,525 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-10 21:59:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 153246 states and 474075 transitions. [2022-02-10 21:59:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:59:06,741 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:06,741 INFO L515 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-10 21:59:06,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-10 21:59:06,742 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-10 21:59:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 26 times [2022-02-10 21:59:06,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:06,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286632977] [2022-02-10 21:59:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:07,366 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-10 21:59:07,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:07,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286632977] [2022-02-10 21:59:07,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286632977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:07,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:07,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:59:07,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419190567] [2022-02-10 21:59:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:07,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:59:07,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:59:07,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:59:07,367 INFO L87 Difference]: Start difference. First operand 153246 states and 474075 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-10 21:59:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:14,763 INFO L93 Difference]: Finished difference Result 237654 states and 735727 transitions. [2022-02-10 21:59:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 21:59:14,763 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-10 21:59:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:16,022 INFO L225 Difference]: With dead ends: 237654 [2022-02-10 21:59:16,022 INFO L226 Difference]: Without dead ends: 237654 [2022-02-10 21:59:16,023 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-10 21:59:16,023 INFO L934 BasicCegarLoop]: 823 mSDtfsCounter, 3519 mSDsluCounter, 9737 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 10560 SdHoareTripleChecker+Invalid, 4437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:16,023 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3519 Valid, 10560 Invalid, 4437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4349 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-10 21:59:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237654 states. [2022-02-10 21:59:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237654 to 166204. [2022-02-10 21:59:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166204 states, 166200 states have (on average 3.1035860409145606) internal successors, (515816), 166203 states have internal predecessors, (515816), 0 states have call successors, (0), 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-10 21:59:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166204 states to 166204 states and 515816 transitions. [2022-02-10 21:59:21,170 INFO L78 Accepts]: Start accepts. Automaton has 166204 states and 515816 transitions. Word has length 105 [2022-02-10 21:59:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:21,183 INFO L470 AbstractCegarLoop]: Abstraction has 166204 states and 515816 transitions. [2022-02-10 21:59:21,183 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-10 21:59:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 166204 states and 515816 transitions. [2022-02-10 21:59:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:59:21,456 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:21,457 INFO L515 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-10 21:59:21,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-10 21:59:21,457 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-10 21:59:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 27 times [2022-02-10 21:59:21,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:21,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983062138] [2022-02-10 21:59:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:22,057 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-10 21:59:22,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:22,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983062138] [2022-02-10 21:59:22,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983062138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:22,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:22,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:59:22,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529948371] [2022-02-10 21:59:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:22,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:59:22,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:59:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:59:22,058 INFO L87 Difference]: Start difference. First operand 166204 states and 515816 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-10 21:59:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:30,820 INFO L93 Difference]: Finished difference Result 227641 states and 703722 transitions. [2022-02-10 21:59:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-10 21:59:30,843 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-10 21:59:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:31,845 INFO L225 Difference]: With dead ends: 227641 [2022-02-10 21:59:31,845 INFO L226 Difference]: Without dead ends: 227641 [2022-02-10 21:59:31,846 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-02-10 21:59:31,846 INFO L934 BasicCegarLoop]: 956 mSDtfsCounter, 2950 mSDsluCounter, 10008 mSDsCounter, 0 mSdLazyCounter, 4489 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 10964 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:31,846 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 10964 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4489 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 21:59:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227641 states. [2022-02-10 21:59:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227641 to 156811. [2022-02-10 21:59:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156811 states, 156807 states have (on average 3.09520620890649) internal successors, (485350), 156810 states have internal predecessors, (485350), 0 states have call successors, (0), 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-10 21:59:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156811 states to 156811 states and 485350 transitions. [2022-02-10 21:59:36,914 INFO L78 Accepts]: Start accepts. Automaton has 156811 states and 485350 transitions. Word has length 105 [2022-02-10 21:59:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:36,914 INFO L470 AbstractCegarLoop]: Abstraction has 156811 states and 485350 transitions. [2022-02-10 21:59:36,914 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-10 21:59:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 156811 states and 485350 transitions. [2022-02-10 21:59:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:59:37,139 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:37,139 INFO L515 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-10 21:59:37,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-10 21:59:37,139 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-10 21:59:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 28 times [2022-02-10 21:59:37,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:37,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987408415] [2022-02-10 21:59:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:37,924 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-10 21:59:37,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:37,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987408415] [2022-02-10 21:59:37,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987408415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:37,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:37,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 21:59:37,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367455759] [2022-02-10 21:59:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:37,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 21:59:37,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:37,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 21:59:37,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-02-10 21:59:37,925 INFO L87 Difference]: Start difference. First operand 156811 states and 485350 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-10 21:59:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:45,441 INFO L93 Difference]: Finished difference Result 214794 states and 663183 transitions. [2022-02-10 21:59:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-10 21:59:45,441 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-10 21:59:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:46,392 INFO L225 Difference]: With dead ends: 214794 [2022-02-10 21:59:46,393 INFO L226 Difference]: Without dead ends: 214794 [2022-02-10 21:59:46,393 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-02-10 21:59:46,393 INFO L934 BasicCegarLoop]: 998 mSDtfsCounter, 2789 mSDsluCounter, 8425 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 9423 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:46,393 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2789 Valid, 9423 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-10 21:59:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214794 states. [2022-02-10 21:59:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214794 to 158547. [2022-02-10 21:59:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158547 states, 158543 states have (on average 3.0954945976801245) internal successors, (490769), 158546 states have internal predecessors, (490769), 0 states have call successors, (0), 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-10 21:59:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158547 states to 158547 states and 490769 transitions. [2022-02-10 21:59:51,045 INFO L78 Accepts]: Start accepts. Automaton has 158547 states and 490769 transitions. Word has length 105 [2022-02-10 21:59:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:51,046 INFO L470 AbstractCegarLoop]: Abstraction has 158547 states and 490769 transitions. [2022-02-10 21:59:51,046 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-10 21:59:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 158547 states and 490769 transitions. [2022-02-10 21:59:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 21:59:51,662 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:51,662 INFO L515 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-10 21:59:51,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-10 21:59:51,663 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-10 21:59:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 29 times [2022-02-10 21:59:51,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:51,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174212370] [2022-02-10 21:59:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:52,359 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-10 21:59:52,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:52,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174212370] [2022-02-10 21:59:52,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174212370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:52,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:52,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:59:52,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723344311] [2022-02-10 21:59:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:52,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:59:52,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:59:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:59:52,361 INFO L87 Difference]: Start difference. First operand 158547 states and 490769 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-10 22:00:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:04,414 INFO L93 Difference]: Finished difference Result 212229 states and 654614 transitions. [2022-02-10 22:00:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-10 22:00:04,414 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-10 22:00:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:05,281 INFO L225 Difference]: With dead ends: 212229 [2022-02-10 22:00:05,281 INFO L226 Difference]: Without dead ends: 212229 [2022-02-10 22:00:05,281 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-02-10 22:00:05,282 INFO L934 BasicCegarLoop]: 1659 mSDtfsCounter, 2524 mSDsluCounter, 13609 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 15268 SdHoareTripleChecker+Invalid, 5752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 5676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:05,282 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2524 Valid, 15268 Invalid, 5752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-10 22:00:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212229 states. [2022-02-10 22:00:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212229 to 153339. [2022-02-10 22:00:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153339 states, 153335 states have (on average 3.0942054977663287) internal successors, (474450), 153338 states have internal predecessors, (474450), 0 states have call successors, (0), 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-10 22:00:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153339 states to 153339 states and 474450 transitions. [2022-02-10 22:00:10,316 INFO L78 Accepts]: Start accepts. Automaton has 153339 states and 474450 transitions. Word has length 105 [2022-02-10 22:00:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:10,317 INFO L470 AbstractCegarLoop]: Abstraction has 153339 states and 474450 transitions. [2022-02-10 22:00:10,317 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-10 22:00:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 153339 states and 474450 transitions. [2022-02-10 22:00:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:00:10,545 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:10,545 INFO L515 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-10 22:00:10,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-10 22:00:10,545 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-10 22:00:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 30 times [2022-02-10 22:00:10,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:10,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143535640] [2022-02-10 22:00:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:00:11,164 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-10 22:00:11,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:00:11,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143535640] [2022-02-10 22:00:11,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143535640] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:00:11,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:00:11,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:00:11,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82124677] [2022-02-10 22:00:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:00:11,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:00:11,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:00:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:00:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:00:11,166 INFO L87 Difference]: Start difference. First operand 153339 states and 474450 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-10 22:00:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:25,991 INFO L93 Difference]: Finished difference Result 237913 states and 732847 transitions. [2022-02-10 22:00:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-10 22:00:25,991 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-10 22:00:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:26,886 INFO L225 Difference]: With dead ends: 237913 [2022-02-10 22:00:26,886 INFO L226 Difference]: Without dead ends: 237913 [2022-02-10 22:00:26,887 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3990, Invalid=10530, Unknown=0, NotChecked=0, Total=14520 [2022-02-10 22:00:26,888 INFO L934 BasicCegarLoop]: 1901 mSDtfsCounter, 3612 mSDsluCounter, 14754 mSDsCounter, 0 mSdLazyCounter, 6406 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3612 SdHoareTripleChecker+Valid, 16655 SdHoareTripleChecker+Invalid, 6500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 6406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:26,888 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3612 Valid, 16655 Invalid, 6500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 6406 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-02-10 22:00:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237913 states. [2022-02-10 22:00:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237913 to 140877. [2022-02-10 22:00:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140877 states, 140873 states have (on average 3.088661418440723) internal successors, (435109), 140876 states have internal predecessors, (435109), 0 states have call successors, (0), 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-10 22:00:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140877 states to 140877 states and 435109 transitions. [2022-02-10 22:00:32,094 INFO L78 Accepts]: Start accepts. Automaton has 140877 states and 435109 transitions. Word has length 105 [2022-02-10 22:00:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:32,094 INFO L470 AbstractCegarLoop]: Abstraction has 140877 states and 435109 transitions. [2022-02-10 22:00:32,094 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-10 22:00:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 140877 states and 435109 transitions. [2022-02-10 22:00:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:00:32,251 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:32,251 INFO L515 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-10 22:00:32,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-10 22:00:32,251 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-10 22:00:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1666350753, now seen corresponding path program 31 times [2022-02-10 22:00:32,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:32,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418982021] [2022-02-10 22:00:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:00:32,949 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-10 22:00:32,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:00:32,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418982021] [2022-02-10 22:00:32,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418982021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:00:32,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:00:32,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:00:32,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21908976] [2022-02-10 22:00:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:00:32,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:00:32,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:00:32,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:00:32,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:00:32,950 INFO L87 Difference]: Start difference. First operand 140877 states and 435109 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-10 22:00:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:52,789 INFO L93 Difference]: Finished difference Result 246583 states and 761014 transitions. [2022-02-10 22:00:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-02-10 22:00:52,789 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-10 22:00:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:53,898 INFO L225 Difference]: With dead ends: 246583 [2022-02-10 22:00:53,898 INFO L226 Difference]: Without dead ends: 246583 [2022-02-10 22:00:53,899 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=4164, Invalid=10842, Unknown=0, NotChecked=0, Total=15006 [2022-02-10 22:00:53,900 INFO L934 BasicCegarLoop]: 2352 mSDtfsCounter, 3514 mSDsluCounter, 21274 mSDsCounter, 0 mSdLazyCounter, 9241 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3514 SdHoareTripleChecker+Valid, 23626 SdHoareTripleChecker+Invalid, 9341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 9241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:53,900 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3514 Valid, 23626 Invalid, 9341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 9241 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-02-10 22:00:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246583 states. [2022-02-10 22:00:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246583 to 153587. [2022-02-10 22:00:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153587 states, 153583 states have (on average 3.0938189773607756) internal successors, (475158), 153586 states have internal predecessors, (475158), 0 states have call successors, (0), 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-10 22:00:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153587 states to 153587 states and 475158 transitions. [2022-02-10 22:00:59,533 INFO L78 Accepts]: Start accepts. Automaton has 153587 states and 475158 transitions. Word has length 105 [2022-02-10 22:00:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:59,534 INFO L470 AbstractCegarLoop]: Abstraction has 153587 states and 475158 transitions. [2022-02-10 22:00:59,534 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-10 22:00:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 153587 states and 475158 transitions. [2022-02-10 22:00:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:00:59,787 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:59,787 INFO L515 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-10 22:00:59,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-10 22:00:59,787 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-10 22:00:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -610967297, now seen corresponding path program 32 times [2022-02-10 22:00:59,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:59,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872889904] [2022-02-10 22:00:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:01:00,745 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-10 22:01:00,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:01:00,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872889904] [2022-02-10 22:01:00,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872889904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:01:00,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:01:00,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 22:01:00,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945853866] [2022-02-10 22:01:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:01:00,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 22:01:00,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:01:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 22:01:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:01:00,746 INFO L87 Difference]: Start difference. First operand 153587 states and 475158 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-10 22:01:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:01:16,710 INFO L93 Difference]: Finished difference Result 253290 states and 783061 transitions. [2022-02-10 22:01:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-10 22:01:16,711 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-10 22:01:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:01:17,800 INFO L225 Difference]: With dead ends: 253290 [2022-02-10 22:01:17,800 INFO L226 Difference]: Without dead ends: 253290 [2022-02-10 22:01:17,801 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3717 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4723, Invalid=13367, Unknown=0, NotChecked=0, Total=18090 [2022-02-10 22:01:17,801 INFO L934 BasicCegarLoop]: 2526 mSDtfsCounter, 3154 mSDsluCounter, 18480 mSDsCounter, 0 mSdLazyCounter, 8172 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 21006 SdHoareTripleChecker+Invalid, 8261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 8172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:01:17,801 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3154 Valid, 21006 Invalid, 8261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 8172 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-10 22:01:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253290 states. [2022-02-10 22:01:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253290 to 153649. [2022-02-10 22:01:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153649 states, 153645 states have (on average 3.093794135832601) internal successors, (475346), 153648 states have internal predecessors, (475346), 0 states have call successors, (0), 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-10 22:01:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153649 states to 153649 states and 475346 transitions. [2022-02-10 22:01:23,238 INFO L78 Accepts]: Start accepts. Automaton has 153649 states and 475346 transitions. Word has length 105 [2022-02-10 22:01:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:01:23,238 INFO L470 AbstractCegarLoop]: Abstraction has 153649 states and 475346 transitions. [2022-02-10 22:01:23,238 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-10 22:01:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 153649 states and 475346 transitions. [2022-02-10 22:01:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:01:23,466 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:01:23,466 INFO L515 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-10 22:01:23,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-10 22:01:23,466 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:01:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:01:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 33 times [2022-02-10 22:01:23,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:01:23,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095316165] [2022-02-10 22:01:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:01:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:01:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:01:24,131 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-10 22:01:24,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:01:24,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095316165] [2022-02-10 22:01:24,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095316165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:01:24,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:01:24,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 22:01:24,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811618171] [2022-02-10 22:01:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:01:24,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 22:01:24,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:01:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 22:01:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:01:24,132 INFO L87 Difference]: Start difference. First operand 153649 states and 475346 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-10 22:01:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:01:42,769 INFO L93 Difference]: Finished difference Result 246346 states and 762005 transitions. [2022-02-10 22:01:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-10 22:01:42,769 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-10 22:01:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:01:43,924 INFO L225 Difference]: With dead ends: 246346 [2022-02-10 22:01:43,924 INFO L226 Difference]: Without dead ends: 246346 [2022-02-10 22:01:43,925 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4985, Invalid=14475, Unknown=0, NotChecked=0, Total=19460 [2022-02-10 22:01:43,925 INFO L934 BasicCegarLoop]: 2647 mSDtfsCounter, 3786 mSDsluCounter, 19984 mSDsCounter, 0 mSdLazyCounter, 8907 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3786 SdHoareTripleChecker+Valid, 22631 SdHoareTripleChecker+Invalid, 9015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 8907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-10 22:01:43,925 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3786 Valid, 22631 Invalid, 9015 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 8907 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-10 22:01:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246346 states. [2022-02-10 22:01:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246346 to 153928. [2022-02-10 22:01:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153928 states, 153924 states have (on average 3.0938839946986825) internal successors, (476223), 153927 states have internal predecessors, (476223), 0 states have call successors, (0), 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-10 22:01:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153928 states to 153928 states and 476223 transitions. [2022-02-10 22:01:49,510 INFO L78 Accepts]: Start accepts. Automaton has 153928 states and 476223 transitions. Word has length 105 [2022-02-10 22:01:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:01:49,511 INFO L470 AbstractCegarLoop]: Abstraction has 153928 states and 476223 transitions. [2022-02-10 22:01:49,511 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-10 22:01:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 153928 states and 476223 transitions. [2022-02-10 22:01:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:01:49,735 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:01:49,735 INFO L515 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-10 22:01:49,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-10 22:01:49,735 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:01:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:01:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash -371924933, now seen corresponding path program 34 times [2022-02-10 22:01:49,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:01:49,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176761353] [2022-02-10 22:01:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:01:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:01:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:01:50,290 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-10 22:01:50,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:01:50,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176761353] [2022-02-10 22:01:50,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176761353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:01:50,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:01:50,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 22:01:50,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631388602] [2022-02-10 22:01:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:01:50,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 22:01:50,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:01:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 22:01:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:01:50,292 INFO L87 Difference]: Start difference. First operand 153928 states and 476223 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-10 22:02:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:07,809 INFO L93 Difference]: Finished difference Result 236157 states and 729167 transitions. [2022-02-10 22:02:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-10 22:02:07,810 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-10 22:02:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:09,031 INFO L225 Difference]: With dead ends: 236157 [2022-02-10 22:02:09,032 INFO L226 Difference]: Without dead ends: 236157 [2022-02-10 22:02:09,033 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4584 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=4945, Invalid=15077, Unknown=0, NotChecked=0, Total=20022 [2022-02-10 22:02:09,033 INFO L934 BasicCegarLoop]: 2644 mSDtfsCounter, 3211 mSDsluCounter, 21541 mSDsCounter, 0 mSdLazyCounter, 9320 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 24185 SdHoareTripleChecker+Invalid, 9415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 9320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:09,033 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3211 Valid, 24185 Invalid, 9415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 9320 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-02-10 22:02:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236157 states. [2022-02-10 22:02:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236157 to 141509. [2022-02-10 22:02:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141509 states, 141505 states have (on average 3.0887106462669163) internal successors, (437068), 141508 states have internal predecessors, (437068), 0 states have call successors, (0), 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-10 22:02:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141509 states to 141509 states and 437068 transitions. [2022-02-10 22:02:14,491 INFO L78 Accepts]: Start accepts. Automaton has 141509 states and 437068 transitions. Word has length 105 [2022-02-10 22:02:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:02:14,491 INFO L470 AbstractCegarLoop]: Abstraction has 141509 states and 437068 transitions. [2022-02-10 22:02:14,491 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-10 22:02:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 141509 states and 437068 transitions. [2022-02-10 22:02:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:02:14,688 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:02:14,689 INFO L515 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-10 22:02:14,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-10 22:02:14,689 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:02:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:02:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1588554697, now seen corresponding path program 35 times [2022-02-10 22:02:14,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:02:14,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133732490] [2022-02-10 22:02:14,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:02:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:02:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:02:15,812 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-10 22:02:15,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:02:15,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133732490] [2022-02-10 22:02:15,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133732490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:02:15,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:02:15,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:02:15,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047675481] [2022-02-10 22:02:15,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:02:15,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:02:15,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:02:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:02:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:02:15,813 INFO L87 Difference]: Start difference. First operand 141509 states and 437068 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-10 22:02:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:23,898 INFO L93 Difference]: Finished difference Result 170978 states and 526669 transitions. [2022-02-10 22:02:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 22:02:23,899 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-10 22:02:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:24,730 INFO L225 Difference]: With dead ends: 170978 [2022-02-10 22:02:24,731 INFO L226 Difference]: Without dead ends: 170978 [2022-02-10 22:02:24,731 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-10 22:02:24,732 INFO L934 BasicCegarLoop]: 1047 mSDtfsCounter, 3152 mSDsluCounter, 11632 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 12679 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:24,732 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3152 Valid, 12679 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-10 22:02:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170978 states. [2022-02-10 22:02:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170978 to 142129. [2022-02-10 22:02:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142129 states, 142125 states have (on average 3.0888513632365875) internal successors, (439003), 142128 states have internal predecessors, (439003), 0 states have call successors, (0), 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-10 22:02:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142129 states to 142129 states and 439003 transitions. [2022-02-10 22:02:28,832 INFO L78 Accepts]: Start accepts. Automaton has 142129 states and 439003 transitions. Word has length 105 [2022-02-10 22:02:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:02:28,832 INFO L470 AbstractCegarLoop]: Abstraction has 142129 states and 439003 transitions. [2022-02-10 22:02:28,832 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-10 22:02:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 142129 states and 439003 transitions. [2022-02-10 22:02:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:02:29,446 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:02:29,446 INFO L515 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-10 22:02:29,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-10 22:02:29,446 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:02:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:02:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995067, now seen corresponding path program 36 times [2022-02-10 22:02:29,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:02:29,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465705846] [2022-02-10 22:02:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:02:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:02:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:02:30,241 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-10 22:02:30,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:02:30,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465705846] [2022-02-10 22:02:30,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465705846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:02:30,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:02:30,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:02:30,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026320738] [2022-02-10 22:02:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:02:30,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:02:30,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:02:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:02:30,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:02:30,243 INFO L87 Difference]: Start difference. First operand 142129 states and 439003 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-10 22:02:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:39,830 INFO L93 Difference]: Finished difference Result 178280 states and 549214 transitions. [2022-02-10 22:02:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 22:02:39,831 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-10 22:02:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:40,674 INFO L225 Difference]: With dead ends: 178280 [2022-02-10 22:02:40,675 INFO L226 Difference]: Without dead ends: 178280 [2022-02-10 22:02:40,675 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 22:02:40,675 INFO L934 BasicCegarLoop]: 1332 mSDtfsCounter, 2897 mSDsluCounter, 13545 mSDsCounter, 0 mSdLazyCounter, 5391 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 14877 SdHoareTripleChecker+Invalid, 5462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 5391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:40,676 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 14877 Invalid, 5462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5391 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-10 22:02:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178280 states. [2022-02-10 22:02:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178280 to 142625. [2022-02-10 22:02:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142625 states, 142621 states have (on average 3.0890401834231986) internal successors, (440562), 142624 states have internal predecessors, (440562), 0 states have call successors, (0), 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-10 22:02:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142625 states to 142625 states and 440562 transitions. [2022-02-10 22:02:45,609 INFO L78 Accepts]: Start accepts. Automaton has 142625 states and 440562 transitions. Word has length 105 [2022-02-10 22:02:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:02:45,615 INFO L470 AbstractCegarLoop]: Abstraction has 142625 states and 440562 transitions. [2022-02-10 22:02:45,615 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-10 22:02:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 142625 states and 440562 transitions. [2022-02-10 22:02:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:02:45,791 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:02:45,791 INFO L515 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-10 22:02:45,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-10 22:02:45,791 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:02:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:02:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1678675625, now seen corresponding path program 37 times [2022-02-10 22:02:45,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:02:45,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298300923] [2022-02-10 22:02:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:02:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:02:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:02:46,498 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-10 22:02:46,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:02:46,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298300923] [2022-02-10 22:02:46,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298300923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:02:46,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:02:46,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 22:02:46,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620020354] [2022-02-10 22:02:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:02:46,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 22:02:46,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:02:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 22:02:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:02:46,499 INFO L87 Difference]: Start difference. First operand 142625 states and 440562 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-10 22:02:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:57,689 INFO L93 Difference]: Finished difference Result 176668 states and 544178 transitions. [2022-02-10 22:02:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-10 22:02:57,689 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-10 22:02:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:58,275 INFO L225 Difference]: With dead ends: 176668 [2022-02-10 22:02:58,275 INFO L226 Difference]: Without dead ends: 176668 [2022-02-10 22:02:58,275 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-02-10 22:02:58,276 INFO L934 BasicCegarLoop]: 1379 mSDtfsCounter, 2547 mSDsluCounter, 12390 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2547 SdHoareTripleChecker+Valid, 13769 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:58,276 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2547 Valid, 13769 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-10 22:02:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176668 states. [2022-02-10 22:03:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176668 to 149042. [2022-02-10 22:03:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149042 states, 149038 states have (on average 3.0910237657510167) internal successors, (460680), 149041 states have internal predecessors, (460680), 0 states have call successors, (0), 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-10 22:03:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149042 states to 149042 states and 460680 transitions. [2022-02-10 22:03:02,681 INFO L78 Accepts]: Start accepts. Automaton has 149042 states and 460680 transitions. Word has length 105 [2022-02-10 22:03:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:03:02,682 INFO L470 AbstractCegarLoop]: Abstraction has 149042 states and 460680 transitions. [2022-02-10 22:03:02,682 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-10 22:03:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 149042 states and 460680 transitions. [2022-02-10 22:03:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:03:03,266 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:03:03,266 INFO L515 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-10 22:03:03,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-10 22:03:03,266 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:03:03,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:03:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2134918345, now seen corresponding path program 38 times [2022-02-10 22:03:03,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:03:03,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305555061] [2022-02-10 22:03:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:03:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:03:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:03:03,835 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-10 22:03:03,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:03:03,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305555061] [2022-02-10 22:03:03,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305555061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:03:03,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:03:03,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-10 22:03:03,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860333252] [2022-02-10 22:03:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:03:03,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-10 22:03:03,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:03:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-10 22:03:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-02-10 22:03:03,837 INFO L87 Difference]: Start difference. First operand 149042 states and 460680 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-10 22:03:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:03:08,086 INFO L93 Difference]: Finished difference Result 185557 states and 572303 transitions. [2022-02-10 22:03:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 22:03:08,086 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-10 22:03:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:03:08,703 INFO L225 Difference]: With dead ends: 185557 [2022-02-10 22:03:08,704 INFO L226 Difference]: Without dead ends: 185557 [2022-02-10 22:03:08,704 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-02-10 22:03:08,704 INFO L934 BasicCegarLoop]: 782 mSDtfsCounter, 2255 mSDsluCounter, 8783 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 9565 SdHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:03:08,704 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2255 Valid, 9565 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-10 22:03:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185557 states. [2022-02-10 22:03:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185557 to 157691. [2022-02-10 22:03:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157691 states, 157687 states have (on average 3.093818767558518) internal successors, (487855), 157690 states have internal predecessors, (487855), 0 states have call successors, (0), 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-10 22:03:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157691 states to 157691 states and 487855 transitions. [2022-02-10 22:03:13,805 INFO L78 Accepts]: Start accepts. Automaton has 157691 states and 487855 transitions. Word has length 105 [2022-02-10 22:03:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:03:13,806 INFO L470 AbstractCegarLoop]: Abstraction has 157691 states and 487855 transitions. [2022-02-10 22:03:13,806 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-10 22:03:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 157691 states and 487855 transitions. [2022-02-10 22:03:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:03:14,495 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:03:14,495 INFO L515 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-10 22:03:14,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-10 22:03:14,495 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:03:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:03:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1856598903, now seen corresponding path program 39 times [2022-02-10 22:03:14,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:03:14,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356589954] [2022-02-10 22:03:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:03:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:03:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:03:15,183 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-10 22:03:15,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:03:15,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356589954] [2022-02-10 22:03:15,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356589954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:03:15,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:03:15,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:03:15,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550899347] [2022-02-10 22:03:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:03:15,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:03:15,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:03:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:03:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:03:15,186 INFO L87 Difference]: Start difference. First operand 157691 states and 487855 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-10 22:03:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:03:24,154 INFO L93 Difference]: Finished difference Result 189057 states and 582793 transitions. [2022-02-10 22:03:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-10 22:03:24,154 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-10 22:03:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:03:25,039 INFO L225 Difference]: With dead ends: 189057 [2022-02-10 22:03:25,039 INFO L226 Difference]: Without dead ends: 189057 [2022-02-10 22:03:25,039 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 22:03:25,040 INFO L934 BasicCegarLoop]: 1506 mSDtfsCounter, 2833 mSDsluCounter, 13717 mSDsCounter, 0 mSdLazyCounter, 5522 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2833 SdHoareTripleChecker+Valid, 15223 SdHoareTripleChecker+Invalid, 5612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 5522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:03:25,040 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2833 Valid, 15223 Invalid, 5612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 5522 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 22:03:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189057 states. [2022-02-10 22:03:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189057 to 159117. [2022-02-10 22:03:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159117 states, 159113 states have (on average 3.0939583817789873) internal successors, (492289), 159116 states have internal predecessors, (492289), 0 states have call successors, (0), 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-10 22:03:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159117 states to 159117 states and 492289 transitions. [2022-02-10 22:03:30,962 INFO L78 Accepts]: Start accepts. Automaton has 159117 states and 492289 transitions. Word has length 105 [2022-02-10 22:03:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:03:30,963 INFO L470 AbstractCegarLoop]: Abstraction has 159117 states and 492289 transitions. [2022-02-10 22:03:30,964 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-10 22:03:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 159117 states and 492289 transitions. [2022-02-10 22:03:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:03:31,658 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:03:31,658 INFO L515 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-10 22:03:31,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-10 22:03:31,658 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:03:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:03:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1797596617, now seen corresponding path program 40 times [2022-02-10 22:03:31,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:03:31,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434206930] [2022-02-10 22:03:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:03:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:03:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:03:32,329 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-10 22:03:32,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:03:32,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434206930] [2022-02-10 22:03:32,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434206930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:03:32,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:03:32,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 22:03:32,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565360332] [2022-02-10 22:03:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:03:32,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 22:03:32,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:03:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 22:03:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:03:32,330 INFO L87 Difference]: Start difference. First operand 159117 states and 492289 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-10 22:03:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:03:44,200 INFO L93 Difference]: Finished difference Result 190555 states and 587377 transitions. [2022-02-10 22:03:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-10 22:03:44,201 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-10 22:03:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:03:45,058 INFO L225 Difference]: With dead ends: 190555 [2022-02-10 22:03:45,058 INFO L226 Difference]: Without dead ends: 190555 [2022-02-10 22:03:45,058 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-02-10 22:03:45,059 INFO L934 BasicCegarLoop]: 1535 mSDtfsCounter, 2413 mSDsluCounter, 11836 mSDsCounter, 0 mSdLazyCounter, 4483 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 13371 SdHoareTripleChecker+Invalid, 4555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:03:45,059 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2413 Valid, 13371 Invalid, 4555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4483 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-10 22:03:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190555 states. [2022-02-10 22:03:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190555 to 157691. [2022-02-10 22:03:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157691 states, 157687 states have (on average 3.093818767558518) internal successors, (487855), 157690 states have internal predecessors, (487855), 0 states have call successors, (0), 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-10 22:03:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157691 states to 157691 states and 487855 transitions. [2022-02-10 22:03:50,563 INFO L78 Accepts]: Start accepts. Automaton has 157691 states and 487855 transitions. Word has length 105 [2022-02-10 22:03:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:03:50,563 INFO L470 AbstractCegarLoop]: Abstraction has 157691 states and 487855 transitions. [2022-02-10 22:03:50,563 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-10 22:03:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 157691 states and 487855 transitions. [2022-02-10 22:03:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:03:50,812 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:03:50,812 INFO L515 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-10 22:03:50,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-10 22:03:50,813 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:03:50,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:03:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1146165943, now seen corresponding path program 41 times [2022-02-10 22:03:50,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:03:50,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907731331] [2022-02-10 22:03:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:03:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:03:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:03:51,879 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-10 22:03:51,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:03:51,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907731331] [2022-02-10 22:03:51,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907731331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:03:51,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:03:51,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-10 22:03:51,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523443763] [2022-02-10 22:03:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:03:51,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-10 22:03:51,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:03:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-10 22:03:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-02-10 22:03:51,881 INFO L87 Difference]: Start difference. First operand 157691 states and 487855 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-10 22:03:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:03:59,379 INFO L93 Difference]: Finished difference Result 233759 states and 722891 transitions. [2022-02-10 22:03:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 22:03:59,380 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-10 22:03:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:04:00,278 INFO L225 Difference]: With dead ends: 233759 [2022-02-10 22:04:00,278 INFO L226 Difference]: Without dead ends: 233759 [2022-02-10 22:04:00,278 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-02-10 22:04:00,279 INFO L934 BasicCegarLoop]: 817 mSDtfsCounter, 3350 mSDsluCounter, 9071 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 9888 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:04:00,291 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3350 Valid, 9888 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-10 22:04:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233759 states. [2022-02-10 22:04:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233759 to 168231. [2022-02-10 22:04:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168231 states, 168227 states have (on average 3.0969463879163275) internal successors, (520990), 168230 states have internal predecessors, (520990), 0 states have call successors, (0), 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-10 22:04:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168231 states to 168231 states and 520990 transitions. [2022-02-10 22:04:06,815 INFO L78 Accepts]: Start accepts. Automaton has 168231 states and 520990 transitions. Word has length 105 [2022-02-10 22:04:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:04:06,815 INFO L470 AbstractCegarLoop]: Abstraction has 168231 states and 520990 transitions. [2022-02-10 22:04:06,815 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-10 22:04:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 168231 states and 520990 transitions. [2022-02-10 22:04:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 22:04:07,098 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:04:07,098 INFO L515 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-10 22:04:07,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-10 22:04:07,099 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-10 22:04:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:04:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1306280927, now seen corresponding path program 42 times [2022-02-10 22:04:07,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:04:07,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431496471] [2022-02-10 22:04:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:04:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:04:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-02-10 22:04:07,902 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-10 22:04:07,903 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-02-10 22:04:07,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-10 22:04:07,904 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-02-10 22:04:07,905 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-02-10 22:04:07,908 INFO L733 BasicCegarLoop]: Path program histogram: [42, 3, 1] [2022-02-10 22:04:07,910 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 22:04:07,910 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 22:04:07,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 10:04:07 BasicIcfg [2022-02-10 22:04:07,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 22:04:07,913 INFO L158 Benchmark]: Toolchain (without parser) took 717371.74ms. Allocated memory was 220.2MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 197.4MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2022-02-10 22:04:07,914 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 22:04:07,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.45ms. Allocated memory is still 220.2MB. Free memory was 197.1MB in the beginning and 172.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-02-10 22:04:07,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.29ms. Allocated memory is still 220.2MB. Free memory was 172.4MB in the beginning and 169.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 22:04:07,916 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 220.2MB. Free memory was 169.3MB in the beginning and 167.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 22:04:07,916 INFO L158 Benchmark]: RCFGBuilder took 445.95ms. Allocated memory is still 220.2MB. Free memory was 167.2MB in the beginning and 149.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-02-10 22:04:07,916 INFO L158 Benchmark]: TraceAbstraction took 716253.04ms. Allocated memory was 220.2MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 148.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2022-02-10 22:04:07,918 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 567.45ms. Allocated memory is still 220.2MB. Free memory was 197.1MB in the beginning and 172.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.29ms. Allocated memory is still 220.2MB. Free memory was 172.4MB in the beginning and 169.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 220.2MB. Free memory was 169.3MB in the beginning and 167.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 445.95ms. Allocated memory is still 220.2MB. Free memory was 167.2MB in the beginning and 149.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 716253.04ms. Allocated memory was 220.2MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 148.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 106 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 318 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 716.0s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 42, EmptinessCheckTime: 13.5s, AutomataDifference: 451.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130853 SdHoareTripleChecker+Valid, 91.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130853 mSDsluCounter, 570805 SdHoareTripleChecker+Invalid, 77.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 513564 mSDsCounter, 3695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211731 IncrementalHoareTripleChecker+Invalid, 215426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3695 mSolverCounterUnsat, 57241 mSDtfsCounter, 211731 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3756 GetRequests, 154 SyntacticMatches, 11 SemanticMatches, 3591 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52810 ImplicationChecksByTransitivity, 273.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168231occurred in iteration=45, InterpolantAutomatonStates: 2613, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 214.0s AutomataMinimizationTime, 45 MinimizatonAttempts, 2467877 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 4652 NumberOfCodeBlocks, 4652 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4607 ConstructedInterpolants, 0 QuantifiedInterpolants, 71188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown