/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 13:18:47,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 13:18:47,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 13:18:47,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 13:18:47,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 13:18:47,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 13:18:47,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 13:18:47,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 13:18:47,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 13:18:47,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 13:18:47,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 13:18:47,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 13:18:47,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 13:18:47,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 13:18:47,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 13:18:47,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 13:18:47,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 13:18:47,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 13:18:47,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 13:18:47,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 13:18:47,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 13:18:47,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 13:18:47,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 13:18:47,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 13:18:47,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 13:18:47,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 13:18:47,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 13:18:47,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 13:18:47,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 13:18:47,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 13:18:47,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 13:18:47,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 13:18:47,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 13:18:47,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 13:18:47,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 13:18:47,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 13:18:47,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 13:18:47,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 13:18:47,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 13:18:47,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 13:18:47,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 13:18:47,418 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-03-15 13:18:47,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 13:18:47,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 13:18:47,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 13:18:47,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 13:18:47,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 13:18:47,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 13:18:47,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 13:18:47,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 13:18:47,446 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 13:18:47,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 13:18:47,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 13:18:47,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 13:18:47,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:18:47,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 13:18:47,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 13:18:47,448 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-03-15 13:18:47,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 13:18:47,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 13:18:47,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 13:18:47,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 13:18:47,688 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 13:18:47,689 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-03-15 13:18:47,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c3b1a8c/037fb30fe27b408fbb8fcab733d79147/FLAG68a08a5ea [2022-03-15 13:18:48,152 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 13:18:48,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-03-15 13:18:48,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c3b1a8c/037fb30fe27b408fbb8fcab733d79147/FLAG68a08a5ea [2022-03-15 13:18:48,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c3b1a8c/037fb30fe27b408fbb8fcab733d79147 [2022-03-15 13:18:48,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 13:18:48,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 13:18:48,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 13:18:48,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 13:18:48,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 13:18:48,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:18:48" (1/1) ... [2022-03-15 13:18:48,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c3c3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:48, skipping insertion in model container [2022-03-15 13:18:48,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:18:48" (1/1) ... [2022-03-15 13:18:48,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 13:18:48,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 13:18:48,739 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 13:18:48,933 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-03-15 13:18:48,936 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-03-15 13:18:48,937 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-03-15 13:18:48,992 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-03-15 13:18:48,993 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-03-15 13:18:48,995 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-03-15 13:18:48,996 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-03-15 13:18:49,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:18:49,008 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 13:18:49,032 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-15 13:18:49,043 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-03-15 13:18:49,044 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-03-15 13:18:49,044 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-03-15 13:18:49,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-03-15 13:18:49,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-03-15 13:18:49,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[49462,49475] [2022-03-15 13:18:49,052 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-03-15 13:18:49,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:18:49,106 INFO L208 MainTranslator]: Completed translation [2022-03-15 13:18:49,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49 WrapperNode [2022-03-15 13:18:49,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 13:18:49,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 13:18:49,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 13:18:49,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 13:18:49,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,163 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2022-03-15 13:18:49,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 13:18:49,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 13:18:49,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 13:18:49,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 13:18:49,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 13:18:49,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 13:18:49,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 13:18:49,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 13:18:49,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (1/1) ... [2022-03-15 13:18:49,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:18:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 13:18:49,214 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-03-15 13:18:49,221 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-03-15 13:18:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-03-15 13:18:49,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-03-15 13:18:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-03-15 13:18:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 13:18:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 13:18:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 13:18:49,241 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 13:18:49,319 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 13:18:49,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 13:18:49,632 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 13:18:49,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 13:18:49,641 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 13:18:49,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:18:49 BoogieIcfgContainer [2022-03-15 13:18:49,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 13:18:49,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 13:18:49,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 13:18:49,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 13:18:49,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:18:48" (1/3) ... [2022-03-15 13:18:49,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a83d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:18:49, skipping insertion in model container [2022-03-15 13:18:49,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:18:49" (2/3) ... [2022-03-15 13:18:49,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a83d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:18:49, skipping insertion in model container [2022-03-15 13:18:49,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:18:49" (3/3) ... [2022-03-15 13:18:49,652 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-03-15 13:18:49,656 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 13:18:49,657 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 13:18:49,657 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-15 13:18:49,657 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 13:18:49,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,712 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,713 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,714 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,714 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,714 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,714 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,714 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,715 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,715 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,715 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,715 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,716 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,716 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,716 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,716 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,716 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,717 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,718 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,719 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,720 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,729 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,733 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,734 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,735 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,736 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,737 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,738 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,739 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,740 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,741 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,742 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,743 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,744 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,745 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,746 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,747 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,748 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,749 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,750 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,751 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,752 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,752 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,752 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,755 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,756 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,756 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,757 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,758 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,758 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,758 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,758 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,759 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,767 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,768 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,769 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,770 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,771 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,773 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,773 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,773 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,773 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,774 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,775 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,776 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,777 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,778 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,779 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,779 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,779 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,779 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,779 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,780 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,781 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,782 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,783 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,784 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,785 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,786 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,786 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,787 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,788 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,789 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,803 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,804 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,805 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,806 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,810 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,815 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,818 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,818 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,819 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,820 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,820 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,820 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,820 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:18:49,822 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 13:18:49,864 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 13:18:49,869 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 13:18:49,869 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-03-15 13:18:49,880 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 210 places, 220 transitions, 456 flow [2022-03-15 13:18:52,207 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-03-15 13:18:52,383 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-03-15 13:18:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-15 13:18:52,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:18:52,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:18:52,534 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-03-15 13:18:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:18:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1408739966, now seen corresponding path program 1 times [2022-03-15 13:18:52,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:18:52,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444714002] [2022-03-15 13:18:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:18:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:18:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:18:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:18:52,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:18:52,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444714002] [2022-03-15 13:18:52,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444714002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:18:52,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:18:52,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 13:18:52,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784260196] [2022-03-15 13:18:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:18:52,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 13:18:52,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:18:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 13:18:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-15 13:18:53,152 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-03-15 13:18:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:18:55,829 INFO L93 Difference]: Finished difference Result 101011 states and 310954 transitions. [2022-03-15 13:18:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 13:18:55,831 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-03-15 13:18:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:18:56,493 INFO L225 Difference]: With dead ends: 101011 [2022-03-15 13:18:56,493 INFO L226 Difference]: Without dead ends: 100951 [2022-03-15 13:18:56,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 13:18:56,499 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 1127 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:18:56,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4283 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 13:18:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100951 states. [2022-03-15 13:18:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100951 to 95266. [2022-03-15 13:18:59,300 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-03-15 13:19:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95266 states to 95266 states and 293479 transitions. [2022-03-15 13:19:00,202 INFO L78 Accepts]: Start accepts. Automaton has 95266 states and 293479 transitions. Word has length 83 [2022-03-15 13:19:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:00,203 INFO L470 AbstractCegarLoop]: Abstraction has 95266 states and 293479 transitions. [2022-03-15 13:19:00,203 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-03-15 13:19:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 95266 states and 293479 transitions. [2022-03-15 13:19:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 13:19:00,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:00,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:00,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 13:19:00,663 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-03-15 13:19:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash -176902823, now seen corresponding path program 1 times [2022-03-15 13:19:00,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:00,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744508746] [2022-03-15 13:19:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:19:01,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:01,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744508746] [2022-03-15 13:19:01,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744508746] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:01,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:01,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 13:19:01,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18350015] [2022-03-15 13:19:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:01,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 13:19:01,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:01,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 13:19:01,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-15 13:19:01,065 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-03-15 13:19:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:04,726 INFO L93 Difference]: Finished difference Result 153195 states and 472281 transitions. [2022-03-15 13:19:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 13:19:04,726 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-03-15 13:19:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:05,298 INFO L225 Difference]: With dead ends: 153195 [2022-03-15 13:19:05,299 INFO L226 Difference]: Without dead ends: 152229 [2022-03-15 13:19:05,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 13:19:05,300 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2688 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 5405 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:05,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 5405 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 13:19:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152229 states. [2022-03-15 13:19:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152229 to 120205. [2022-03-15 13:19:09,079 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-03-15 13:19:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120205 states to 120205 states and 370986 transitions. [2022-03-15 13:19:09,884 INFO L78 Accepts]: Start accepts. Automaton has 120205 states and 370986 transitions. Word has length 88 [2022-03-15 13:19:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:09,885 INFO L470 AbstractCegarLoop]: Abstraction has 120205 states and 370986 transitions. [2022-03-15 13:19:09,886 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-03-15 13:19:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 120205 states and 370986 transitions. [2022-03-15 13:19:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 13:19:09,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:09,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:09,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 13:19:09,973 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-03-15 13:19:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 929430313, now seen corresponding path program 2 times [2022-03-15 13:19:09,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:09,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588630273] [2022-03-15 13:19:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:10,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-03-15 13:19:10,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:10,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588630273] [2022-03-15 13:19:10,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588630273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:10,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:10,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 13:19:10,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4367154] [2022-03-15 13:19:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:10,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 13:19:10,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 13:19:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-15 13:19:10,356 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-03-15 13:19:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:13,468 INFO L93 Difference]: Finished difference Result 159338 states and 491229 transitions. [2022-03-15 13:19:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 13:19:13,469 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-03-15 13:19:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:14,303 INFO L225 Difference]: With dead ends: 159338 [2022-03-15 13:19:14,303 INFO L226 Difference]: Without dead ends: 159086 [2022-03-15 13:19:14,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 13:19:14,304 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 2687 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:14,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2687 Valid, 5439 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 13:19:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159086 states. [2022-03-15 13:19:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159086 to 118249. [2022-03-15 13:19:17,406 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-03-15 13:19:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118249 states to 118249 states and 364965 transitions. [2022-03-15 13:19:18,084 INFO L78 Accepts]: Start accepts. Automaton has 118249 states and 364965 transitions. Word has length 88 [2022-03-15 13:19:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:18,084 INFO L470 AbstractCegarLoop]: Abstraction has 118249 states and 364965 transitions. [2022-03-15 13:19:18,084 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-03-15 13:19:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 118249 states and 364965 transitions. [2022-03-15 13:19:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 13:19:18,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:18,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:18,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 13:19:18,149 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-03-15 13:19:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1579355583, now seen corresponding path program 3 times [2022-03-15 13:19:18,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:18,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820398616] [2022-03-15 13:19:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:19:18,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:18,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820398616] [2022-03-15 13:19:18,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820398616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:18,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:18,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 13:19:18,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587434340] [2022-03-15 13:19:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:18,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 13:19:18,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:18,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 13:19:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-15 13:19:18,507 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-03-15 13:19:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:21,494 INFO L93 Difference]: Finished difference Result 131753 states and 405812 transitions. [2022-03-15 13:19:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 13:19:21,494 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-03-15 13:19:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:21,908 INFO L225 Difference]: With dead ends: 131753 [2022-03-15 13:19:21,909 INFO L226 Difference]: Without dead ends: 131585 [2022-03-15 13:19:21,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 13:19:21,910 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 2374 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:21,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2374 Valid, 5481 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 13:19:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131585 states. [2022-03-15 13:19:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131585 to 111213. [2022-03-15 13:19:24,909 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-03-15 13:19:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111213 states to 111213 states and 342827 transitions. [2022-03-15 13:19:25,619 INFO L78 Accepts]: Start accepts. Automaton has 111213 states and 342827 transitions. Word has length 88 [2022-03-15 13:19:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:25,620 INFO L470 AbstractCegarLoop]: Abstraction has 111213 states and 342827 transitions. [2022-03-15 13:19:25,620 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-03-15 13:19:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 111213 states and 342827 transitions. [2022-03-15 13:19:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:19:25,738 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:25,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:25,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 13:19:25,738 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-03-15 13:19:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -903700515, now seen corresponding path program 1 times [2022-03-15 13:19:25,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:25,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141206270] [2022-03-15 13:19:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:19:26,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:26,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141206270] [2022-03-15 13:19:26,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141206270] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:26,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:26,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:19:26,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922566550] [2022-03-15 13:19:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:26,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:19:26,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:19:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:19:26,511 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-03-15 13:19:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:33,878 INFO L93 Difference]: Finished difference Result 163236 states and 502706 transitions. [2022-03-15 13:19:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 13:19:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 13:19:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:34,579 INFO L225 Difference]: With dead ends: 163236 [2022-03-15 13:19:34,579 INFO L226 Difference]: Without dead ends: 163236 [2022-03-15 13:19:34,580 INFO L932 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-03-15 13:19:34,581 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 2940 mSDsluCounter, 9878 mSDsCounter, 0 mSdLazyCounter, 3846 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:19:34,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2940 Valid, 10916 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3846 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 13:19:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163236 states. [2022-03-15 13:19:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163236 to 112825. [2022-03-15 13:19:37,262 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-03-15 13:19:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112825 states to 112825 states and 347770 transitions. [2022-03-15 13:19:37,932 INFO L78 Accepts]: Start accepts. Automaton has 112825 states and 347770 transitions. Word has length 105 [2022-03-15 13:19:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:37,933 INFO L470 AbstractCegarLoop]: Abstraction has 112825 states and 347770 transitions. [2022-03-15 13:19:37,933 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-03-15 13:19:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 112825 states and 347770 transitions. [2022-03-15 13:19:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:19:38,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:38,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:38,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 13:19:38,039 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-03-15 13:19:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -535260145, now seen corresponding path program 2 times [2022-03-15 13:19:38,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:38,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189886618] [2022-03-15 13:19:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:19:38,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:38,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189886618] [2022-03-15 13:19:38,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189886618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:38,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:38,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:19:38,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608037415] [2022-03-15 13:19:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:38,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:19:38,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:19:38,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:19:38,712 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-03-15 13:19:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:19:48,698 INFO L93 Difference]: Finished difference Result 170538 states and 525251 transitions. [2022-03-15 13:19:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:19:48,699 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-03-15 13:19:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:19:49,618 INFO L225 Difference]: With dead ends: 170538 [2022-03-15 13:19:49,619 INFO L226 Difference]: Without dead ends: 170538 [2022-03-15 13:19:49,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:19:49,624 INFO L933 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-03-15 13:19:49,624 INFO L934 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-03-15 13:19:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170538 states. [2022-03-15 13:19:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170538 to 113321. [2022-03-15 13:19:52,903 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-03-15 13:19:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113321 states to 113321 states and 349329 transitions. [2022-03-15 13:19:53,730 INFO L78 Accepts]: Start accepts. Automaton has 113321 states and 349329 transitions. Word has length 105 [2022-03-15 13:19:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:19:53,730 INFO L470 AbstractCegarLoop]: Abstraction has 113321 states and 349329 transitions. [2022-03-15 13:19:53,731 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-03-15 13:19:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 113321 states and 349329 transitions. [2022-03-15 13:19:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:19:53,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:19:53,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:19:53,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 13:19:53,866 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-03-15 13:19:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:19:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -813579587, now seen corresponding path program 3 times [2022-03-15 13:19:53,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:19:53,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245003138] [2022-03-15 13:19:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:19:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:19:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:19:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:19:54,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:19:54,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245003138] [2022-03-15 13:19:54,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245003138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:19:54,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:19:54,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:19:54,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598806220] [2022-03-15 13:19:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:19:54,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:19:54,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:19:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:19:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:19:54,578 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-03-15 13:20:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:02,906 INFO L93 Difference]: Finished difference Result 168926 states and 520215 transitions. [2022-03-15 13:20:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 13:20:02,919 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-03-15 13:20:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:03,385 INFO L225 Difference]: With dead ends: 168926 [2022-03-15 13:20:03,385 INFO L226 Difference]: Without dead ends: 168926 [2022-03-15 13:20:03,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1763, Invalid=4089, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 13:20:03,386 INFO L933 BasicCegarLoop]: 1242 mSDtfsCounter, 2631 mSDsluCounter, 9736 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:03,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2631 Valid, 10978 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3738 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 13:20:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168926 states. [2022-03-15 13:20:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168926 to 121350. [2022-03-15 13:20:06,518 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-03-15 13:20:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121350 states to 121350 states and 374335 transitions. [2022-03-15 13:20:06,859 INFO L78 Accepts]: Start accepts. Automaton has 121350 states and 374335 transitions. Word has length 105 [2022-03-15 13:20:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:06,860 INFO L470 AbstractCegarLoop]: Abstraction has 121350 states and 374335 transitions. [2022-03-15 13:20:06,860 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-03-15 13:20:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 121350 states and 374335 transitions. [2022-03-15 13:20:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:20:06,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:06,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:20:06,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 13:20:06,983 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-03-15 13:20:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -357336867, now seen corresponding path program 4 times [2022-03-15 13:20:06,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:06,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111567763] [2022-03-15 13:20:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:20:07,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:07,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111567763] [2022-03-15 13:20:07,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111567763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:07,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:07,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:20:07,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484231250] [2022-03-15 13:20:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:07,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:20:07,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:20:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:20:07,935 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-03-15 13:20:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:12,110 INFO L93 Difference]: Finished difference Result 179210 states and 552570 transitions. [2022-03-15 13:20:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 13:20:12,111 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-03-15 13:20:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:12,951 INFO L225 Difference]: With dead ends: 179210 [2022-03-15 13:20:12,951 INFO L226 Difference]: Without dead ends: 179210 [2022-03-15 13:20:12,952 INFO L932 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-03-15 13:20:12,952 INFO L933 BasicCegarLoop]: 773 mSDtfsCounter, 2332 mSDsluCounter, 8012 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-03-15 13:20:12,953 INFO L934 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-03-15 13:20:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179210 states. [2022-03-15 13:20:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179210 to 129999. [2022-03-15 13:20:16,467 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-03-15 13:20:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129999 states to 129999 states and 401510 transitions. [2022-03-15 13:20:16,863 INFO L78 Accepts]: Start accepts. Automaton has 129999 states and 401510 transitions. Word has length 105 [2022-03-15 13:20:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:16,864 INFO L470 AbstractCegarLoop]: Abstraction has 129999 states and 401510 transitions. [2022-03-15 13:20:16,864 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-03-15 13:20:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 129999 states and 401510 transitions. [2022-03-15 13:20:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:20:17,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:17,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:20:17,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 13:20:17,416 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-03-15 13:20:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -635656309, now seen corresponding path program 5 times [2022-03-15 13:20:17,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:17,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918434771] [2022-03-15 13:20:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:20:18,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:18,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918434771] [2022-03-15 13:20:18,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918434771] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:18,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:18,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:18,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907535871] [2022-03-15 13:20:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:18,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:18,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:18,275 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-03-15 13:20:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:27,636 INFO L93 Difference]: Finished difference Result 181315 states and 558830 transitions. [2022-03-15 13:20:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:20:27,636 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-03-15 13:20:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:28,247 INFO L225 Difference]: With dead ends: 181315 [2022-03-15 13:20:28,248 INFO L226 Difference]: Without dead ends: 181315 [2022-03-15 13:20:28,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:20:28,249 INFO L933 BasicCegarLoop]: 1497 mSDtfsCounter, 2833 mSDsluCounter, 12722 mSDsCounter, 0 mSdLazyCounter, 4859 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:28,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2833 Valid, 14219 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4859 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:20:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181315 states. [2022-03-15 13:20:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181315 to 133605. [2022-03-15 13:20:31,811 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-03-15 13:20:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133605 states to 133605 states and 412596 transitions. [2022-03-15 13:20:32,579 INFO L78 Accepts]: Start accepts. Automaton has 133605 states and 412596 transitions. Word has length 105 [2022-03-15 13:20:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:32,580 INFO L470 AbstractCegarLoop]: Abstraction has 133605 states and 412596 transitions. [2022-03-15 13:20:32,580 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-03-15 13:20:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 133605 states and 412596 transitions. [2022-03-15 13:20:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:20:32,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:32,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:20:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 13:20:32,711 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-03-15 13:20:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash -694658595, now seen corresponding path program 6 times [2022-03-15 13:20:32,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:32,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445105640] [2022-03-15 13:20:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:32,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:20:33,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:33,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445105640] [2022-03-15 13:20:33,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445105640] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:33,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:33,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:20:33,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792709104] [2022-03-15 13:20:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:33,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:20:33,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:20:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:20:33,396 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-03-15 13:20:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:45,709 INFO L93 Difference]: Finished difference Result 181605 states and 560461 transitions. [2022-03-15 13:20:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-15 13:20:45,709 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-03-15 13:20:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:46,234 INFO L225 Difference]: With dead ends: 181605 [2022-03-15 13:20:46,234 INFO L226 Difference]: Without dead ends: 181605 [2022-03-15 13:20:46,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2748, Invalid=6564, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 13:20:46,236 INFO L933 BasicCegarLoop]: 1534 mSDtfsCounter, 3039 mSDsluCounter, 12797 mSDsCounter, 0 mSdLazyCounter, 5351 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:46,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3039 Valid, 14331 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5351 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 13:20:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181605 states. [2022-03-15 13:20:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181605 to 147726. [2022-03-15 13:20:49,871 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-03-15 13:20:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147726 states to 147726 states and 456471 transitions. [2022-03-15 13:20:50,297 INFO L78 Accepts]: Start accepts. Automaton has 147726 states and 456471 transitions. Word has length 105 [2022-03-15 13:20:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:20:50,298 INFO L470 AbstractCegarLoop]: Abstraction has 147726 states and 456471 transitions. [2022-03-15 13:20:50,298 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-03-15 13:20:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 147726 states and 456471 transitions. [2022-03-15 13:20:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:20:50,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:20:50,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:20:50,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 13:20:50,875 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-03-15 13:20:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:20:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1346089269, now seen corresponding path program 7 times [2022-03-15 13:20:50,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:20:50,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629606426] [2022-03-15 13:20:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:20:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:20:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:20:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:20:51,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:20:51,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629606426] [2022-03-15 13:20:51,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629606426] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:20:51,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:20:51,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:20:51,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706205824] [2022-03-15 13:20:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:20:51,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:20:51,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:20:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:20:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:20:51,930 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-03-15 13:20:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:20:58,796 INFO L93 Difference]: Finished difference Result 245075 states and 758642 transitions. [2022-03-15 13:20:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 13:20:58,807 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-03-15 13:20:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:20:59,708 INFO L225 Difference]: With dead ends: 245075 [2022-03-15 13:20:59,709 INFO L226 Difference]: Without dead ends: 245075 [2022-03-15 13:20:59,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1098, Invalid=2934, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 13:20:59,710 INFO L933 BasicCegarLoop]: 799 mSDtfsCounter, 2866 mSDsluCounter, 9631 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:20:59,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 10430 Invalid, 4171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 13:21:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245075 states. [2022-03-15 13:21:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245075 to 163133. [2022-03-15 13:21:04,479 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-03-15 13:21:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163133 states to 163133 states and 504891 transitions. [2022-03-15 13:21:04,944 INFO L78 Accepts]: Start accepts. Automaton has 163133 states and 504891 transitions. Word has length 105 [2022-03-15 13:21:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:04,944 INFO L470 AbstractCegarLoop]: Abstraction has 163133 states and 504891 transitions. [2022-03-15 13:21:04,945 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-03-15 13:21:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 163133 states and 504891 transitions. [2022-03-15 13:21:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:21:05,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:05,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:21:05,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 13:21:05,507 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-03-15 13:21:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 496431157, now seen corresponding path program 8 times [2022-03-15 13:21:05,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:05,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687091749] [2022-03-15 13:21:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:06,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-03-15 13:21:06,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:06,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687091749] [2022-03-15 13:21:06,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687091749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:06,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:06,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:06,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376535952] [2022-03-15 13:21:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:06,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:06,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:06,243 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-03-15 13:21:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:13,307 INFO L93 Difference]: Finished difference Result 244447 states and 755883 transitions. [2022-03-15 13:21:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 13:21:13,307 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-03-15 13:21:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:14,122 INFO L225 Difference]: With dead ends: 244447 [2022-03-15 13:21:14,122 INFO L226 Difference]: Without dead ends: 244447 [2022-03-15 13:21:14,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 13:21:14,125 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 3199 mSDsluCounter, 10610 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:21:14,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 11551 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 13:21:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244447 states. [2022-03-15 13:21:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244447 to 165179. [2022-03-15 13:21:18,908 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-03-15 13:21:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165179 states to 165179 states and 511095 transitions. [2022-03-15 13:21:19,450 INFO L78 Accepts]: Start accepts. Automaton has 165179 states and 511095 transitions. Word has length 105 [2022-03-15 13:21:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:19,451 INFO L470 AbstractCegarLoop]: Abstraction has 165179 states and 511095 transitions. [2022-03-15 13:21:19,451 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-03-15 13:21:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 165179 states and 511095 transitions. [2022-03-15 13:21:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:21:20,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:20,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:21:20,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 13:21:20,065 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-03-15 13:21:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1624408711, now seen corresponding path program 9 times [2022-03-15 13:21:20,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:20,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784890175] [2022-03-15 13:21:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:20,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-03-15 13:21:20,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:20,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784890175] [2022-03-15 13:21:20,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784890175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:20,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:20,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:21:20,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220072553] [2022-03-15 13:21:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:20,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:21:20,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:21:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:21:20,867 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-03-15 13:21:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:29,997 INFO L93 Difference]: Finished difference Result 237707 states and 734606 transitions. [2022-03-15 13:21:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 13:21:29,998 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-03-15 13:21:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:31,426 INFO L225 Difference]: With dead ends: 237707 [2022-03-15 13:21:31,426 INFO L226 Difference]: Without dead ends: 237707 [2022-03-15 13:21:31,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1481, Invalid=3631, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 13:21:31,427 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 2406 mSDsluCounter, 11858 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:21:31,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2406 Valid, 12969 Invalid, 5138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 5056 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 13:21:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237707 states. [2022-03-15 13:21:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237707 to 166884. [2022-03-15 13:21:36,285 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-03-15 13:21:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166884 states to 166884 states and 516389 transitions. [2022-03-15 13:21:37,144 INFO L78 Accepts]: Start accepts. Automaton has 166884 states and 516389 transitions. Word has length 105 [2022-03-15 13:21:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:37,144 INFO L470 AbstractCegarLoop]: Abstraction has 166884 states and 516389 transitions. [2022-03-15 13:21:37,144 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-03-15 13:21:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 166884 states and 516389 transitions. [2022-03-15 13:21:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:21:37,349 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:37,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:21:37,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 13:21:37,350 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-03-15 13:21:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1683410997, now seen corresponding path program 10 times [2022-03-15 13:21:37,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:37,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606667547] [2022-03-15 13:21:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:21:37,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:37,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606667547] [2022-03-15 13:21:37,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606667547] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:37,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:37,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:21:37,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864911732] [2022-03-15 13:21:37,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:37,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:21:37,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:21:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:21:37,964 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-03-15 13:21:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:21:50,591 INFO L93 Difference]: Finished difference Result 212764 states and 657439 transitions. [2022-03-15 13:21:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 13:21:50,592 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-03-15 13:21:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:21:51,287 INFO L225 Difference]: With dead ends: 212764 [2022-03-15 13:21:51,287 INFO L226 Difference]: Without dead ends: 212764 [2022-03-15 13:21:51,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2909, Invalid=6991, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 13:21:51,288 INFO L933 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-03-15 13:21:51,288 INFO L934 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-03-15 13:21:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212764 states. [2022-03-15 13:21:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212764 to 149247. [2022-03-15 13:21:55,324 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-03-15 13:21:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149247 states to 149247 states and 461610 transitions. [2022-03-15 13:21:55,762 INFO L78 Accepts]: Start accepts. Automaton has 149247 states and 461610 transitions. Word has length 105 [2022-03-15 13:21:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:21:55,762 INFO L470 AbstractCegarLoop]: Abstraction has 149247 states and 461610 transitions. [2022-03-15 13:21:55,762 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-03-15 13:21:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 149247 states and 461610 transitions. [2022-03-15 13:21:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:21:55,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:21:55,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:21:55,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 13:21:55,937 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-03-15 13:21:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:21:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1090206221, now seen corresponding path program 11 times [2022-03-15 13:21:55,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:21:55,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561906805] [2022-03-15 13:21:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:21:55,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:21:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:21:57,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-03-15 13:21:57,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:21:57,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561906805] [2022-03-15 13:21:57,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561906805] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:21:57,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:21:57,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:21:57,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608133775] [2022-03-15 13:21:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:21:57,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:21:57,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:21:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:21:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:21:57,012 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-03-15 13:22:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:01,835 INFO L93 Difference]: Finished difference Result 200958 states and 621007 transitions. [2022-03-15 13:22:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 13:22:01,836 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-03-15 13:22:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:03,054 INFO L225 Difference]: With dead ends: 200958 [2022-03-15 13:22:03,055 INFO L226 Difference]: Without dead ends: 200958 [2022-03-15 13:22:03,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 13:22:03,057 INFO L933 BasicCegarLoop]: 780 mSDtfsCounter, 2779 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 3137 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:22:03,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2779 Valid, 8172 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 13:22:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200958 states. [2022-03-15 13:22:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200958 to 149433. [2022-03-15 13:22:06,855 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-03-15 13:22:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149433 states to 149433 states and 462267 transitions. [2022-03-15 13:22:07,700 INFO L78 Accepts]: Start accepts. Automaton has 149433 states and 462267 transitions. Word has length 105 [2022-03-15 13:22:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:07,701 INFO L470 AbstractCegarLoop]: Abstraction has 149433 states and 462267 transitions. [2022-03-15 13:22:07,701 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-03-15 13:22:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 149433 states and 462267 transitions. [2022-03-15 13:22:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:22:07,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:07,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:22:07,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 13:22:07,900 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-03-15 13:22:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 811886779, now seen corresponding path program 12 times [2022-03-15 13:22:07,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:07,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483952509] [2022-03-15 13:22:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:22:09,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:09,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483952509] [2022-03-15 13:22:09,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483952509] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:09,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:09,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:22:09,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558049872] [2022-03-15 13:22:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:09,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:22:09,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:22:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:22:09,013 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-03-15 13:22:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:16,313 INFO L93 Difference]: Finished difference Result 190870 states and 589795 transitions. [2022-03-15 13:22:16,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 13:22:16,313 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-03-15 13:22:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:17,388 INFO L225 Difference]: With dead ends: 190870 [2022-03-15 13:22:17,388 INFO L226 Difference]: Without dead ends: 190870 [2022-03-15 13:22:17,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 13:22:17,389 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 2685 mSDsluCounter, 8646 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:22:17,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2685 Valid, 9632 Invalid, 3766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 13:22:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190870 states. [2022-03-15 13:22:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190870 to 151262. [2022-03-15 13:22:21,526 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-03-15 13:22:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151262 states to 151262 states and 467968 transitions. [2022-03-15 13:22:22,438 INFO L78 Accepts]: Start accepts. Automaton has 151262 states and 467968 transitions. Word has length 105 [2022-03-15 13:22:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:22,438 INFO L470 AbstractCegarLoop]: Abstraction has 151262 states and 467968 transitions. [2022-03-15 13:22:22,438 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-03-15 13:22:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 151262 states and 467968 transitions. [2022-03-15 13:22:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:22:22,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:22,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:22:22,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 13:22:22,668 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-03-15 13:22:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 752884493, now seen corresponding path program 13 times [2022-03-15 13:22:22,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:22,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811133249] [2022-03-15 13:22:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:22:23,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:23,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811133249] [2022-03-15 13:22:23,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811133249] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:23,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:23,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:22:23,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851161702] [2022-03-15 13:22:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:23,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:22:23,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:22:23,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:22:23,434 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-03-15 13:22:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:34,551 INFO L93 Difference]: Finished difference Result 177136 states and 546989 transitions. [2022-03-15 13:22:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 13:22:34,552 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-03-15 13:22:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:35,298 INFO L225 Difference]: With dead ends: 177136 [2022-03-15 13:22:35,298 INFO L226 Difference]: Without dead ends: 177136 [2022-03-15 13:22:35,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2980, Invalid=7322, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 13:22:35,299 INFO L933 BasicCegarLoop]: 1679 mSDtfsCounter, 3134 mSDsluCounter, 15721 mSDsCounter, 0 mSdLazyCounter, 6273 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:22:35,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3134 Valid, 17400 Invalid, 6370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 6273 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 13:22:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177136 states. [2022-03-15 13:22:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177136 to 128901. [2022-03-15 13:22:38,566 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-03-15 13:22:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128901 states to 128901 states and 398093 transitions. [2022-03-15 13:22:38,952 INFO L78 Accepts]: Start accepts. Automaton has 128901 states and 398093 transitions. Word has length 105 [2022-03-15 13:22:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:38,952 INFO L470 AbstractCegarLoop]: Abstraction has 128901 states and 398093 transitions. [2022-03-15 13:22:38,952 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-03-15 13:22:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 128901 states and 398093 transitions. [2022-03-15 13:22:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:22:39,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:39,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:22:39,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 13:22:39,103 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-03-15 13:22:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -379588419, now seen corresponding path program 14 times [2022-03-15 13:22:39,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:39,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859401495] [2022-03-15 13:22:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:22:40,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:40,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859401495] [2022-03-15 13:22:40,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859401495] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:40,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:40,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:22:40,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478686284] [2022-03-15 13:22:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:40,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:22:40,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:22:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:22:40,104 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-03-15 13:22:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:22:52,083 INFO L93 Difference]: Finished difference Result 159157 states and 489956 transitions. [2022-03-15 13:22:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-15 13:22:52,083 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-03-15 13:22:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:22:52,504 INFO L225 Difference]: With dead ends: 159157 [2022-03-15 13:22:52,504 INFO L226 Difference]: Without dead ends: 159157 [2022-03-15 13:22:52,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3084, Invalid=7422, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 13:22:52,505 INFO L933 BasicCegarLoop]: 1732 mSDtfsCounter, 3155 mSDsluCounter, 13248 mSDsCounter, 0 mSdLazyCounter, 5501 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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-03-15 13:22:52,505 INFO L934 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-03-15 13:22:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159157 states. [2022-03-15 13:22:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159157 to 133034. [2022-03-15 13:22:55,763 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-03-15 13:22:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133034 states to 133034 states and 410667 transitions. [2022-03-15 13:22:56,150 INFO L78 Accepts]: Start accepts. Automaton has 133034 states and 410667 transitions. Word has length 105 [2022-03-15 13:22:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:22:56,151 INFO L470 AbstractCegarLoop]: Abstraction has 133034 states and 410667 transitions. [2022-03-15 13:22:56,151 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-03-15 13:22:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 133034 states and 410667 transitions. [2022-03-15 13:22:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:22:56,296 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:22:56,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:22:56,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 13:22:56,297 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-03-15 13:22:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:22:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1308959803, now seen corresponding path program 15 times [2022-03-15 13:22:56,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:22:56,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154287004] [2022-03-15 13:22:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:22:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:22:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:22:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:22:57,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:22:57,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154287004] [2022-03-15 13:22:57,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154287004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:22:57,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:22:57,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:22:57,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607406383] [2022-03-15 13:22:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:22:57,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:22:57,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:22:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:22:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:22:57,325 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-03-15 13:23:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:03,704 INFO L93 Difference]: Finished difference Result 180071 states and 554449 transitions. [2022-03-15 13:23:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 13:23:03,706 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-03-15 13:23:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:04,506 INFO L225 Difference]: With dead ends: 180071 [2022-03-15 13:23:04,506 INFO L226 Difference]: Without dead ends: 180071 [2022-03-15 13:23:04,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 13:23:04,507 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 3606 mSDsluCounter, 9302 mSDsCounter, 0 mSdLazyCounter, 3652 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:04,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3606 Valid, 10352 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 13:23:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180071 states. [2022-03-15 13:23:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180071 to 134522. [2022-03-15 13:23:07,851 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-03-15 13:23:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134522 states to 134522 states and 415234 transitions. [2022-03-15 13:23:08,733 INFO L78 Accepts]: Start accepts. Automaton has 134522 states and 415234 transitions. Word has length 105 [2022-03-15 13:23:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:08,734 INFO L470 AbstractCegarLoop]: Abstraction has 134522 states and 415234 transitions. [2022-03-15 13:23:08,734 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-03-15 13:23:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 134522 states and 415234 transitions. [2022-03-15 13:23:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:23:08,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:08,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:23:08,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 13:23:08,912 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-03-15 13:23:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1677400173, now seen corresponding path program 16 times [2022-03-15 13:23:08,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:08,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209282821] [2022-03-15 13:23:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:23:09,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:09,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209282821] [2022-03-15 13:23:09,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209282821] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:09,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:09,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:09,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12008063] [2022-03-15 13:23:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:09,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:09,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:09,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:09,644 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-03-15 13:23:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:17,881 INFO L93 Difference]: Finished difference Result 187373 states and 576994 transitions. [2022-03-15 13:23:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:23:17,882 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-03-15 13:23:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:18,645 INFO L225 Difference]: With dead ends: 187373 [2022-03-15 13:23:18,645 INFO L226 Difference]: Without dead ends: 187373 [2022-03-15 13:23:18,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:23:18,646 INFO L933 BasicCegarLoop]: 1335 mSDtfsCounter, 3074 mSDsluCounter, 14417 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3074 SdHoareTripleChecker+Valid, 15752 SdHoareTripleChecker+Invalid, 5834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:18,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3074 Valid, 15752 Invalid, 5834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 13:23:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187373 states. [2022-03-15 13:23:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187373 to 135018. [2022-03-15 13:23:22,011 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-03-15 13:23:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135018 states to 135018 states and 416793 transitions. [2022-03-15 13:23:22,391 INFO L78 Accepts]: Start accepts. Automaton has 135018 states and 416793 transitions. Word has length 105 [2022-03-15 13:23:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:22,391 INFO L470 AbstractCegarLoop]: Abstraction has 135018 states and 416793 transitions. [2022-03-15 13:23:22,391 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-03-15 13:23:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 135018 states and 416793 transitions. [2022-03-15 13:23:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:23:22,928 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:22,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:23:22,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 13:23:22,928 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-03-15 13:23:22,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1399080731, now seen corresponding path program 17 times [2022-03-15 13:23:22,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:22,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562298172] [2022-03-15 13:23:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:23:23,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:23,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562298172] [2022-03-15 13:23:23,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562298172] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:23,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:23,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:23:23,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396697220] [2022-03-15 13:23:23,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:23,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:23:23,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:23:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:23:23,623 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-03-15 13:23:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:32,945 INFO L93 Difference]: Finished difference Result 186495 states and 574243 transitions. [2022-03-15 13:23:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 13:23:32,945 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-03-15 13:23:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:33,463 INFO L225 Difference]: With dead ends: 186495 [2022-03-15 13:23:33,463 INFO L226 Difference]: Without dead ends: 186495 [2022-03-15 13:23:33,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 13:23:33,464 INFO L933 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:33,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2518 Valid, 11823 Invalid, 4146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 13:23:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186495 states. [2022-03-15 13:23:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186495 to 143326. [2022-03-15 13:23:36,882 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-03-15 13:23:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143326 states to 143326 states and 442645 transitions. [2022-03-15 13:23:37,697 INFO L78 Accepts]: Start accepts. Automaton has 143326 states and 442645 transitions. Word has length 105 [2022-03-15 13:23:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:37,697 INFO L470 AbstractCegarLoop]: Abstraction has 143326 states and 442645 transitions. [2022-03-15 13:23:37,697 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-03-15 13:23:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 143326 states and 442645 transitions. [2022-03-15 13:23:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:23:37,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:37,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:23:37,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 13:23:37,846 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-03-15 13:23:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1855323451, now seen corresponding path program 18 times [2022-03-15 13:23:37,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:37,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164341991] [2022-03-15 13:23:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:23:38,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:38,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164341991] [2022-03-15 13:23:38,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164341991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:38,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:38,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:38,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710622997] [2022-03-15 13:23:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:38,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:38,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:38,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:38,436 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-03-15 13:23:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:45,347 INFO L93 Difference]: Finished difference Result 199052 states and 613803 transitions. [2022-03-15 13:23:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 13:23:45,347 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-03-15 13:23:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:23:45,949 INFO L225 Difference]: With dead ends: 199052 [2022-03-15 13:23:45,949 INFO L226 Difference]: Without dead ends: 199052 [2022-03-15 13:23:45,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 13:23:45,950 INFO L933 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.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:23:45,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3476 Valid, 10247 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3793 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:23:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199052 states. [2022-03-15 13:23:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199052 to 150332. [2022-03-15 13:23:49,695 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-03-15 13:23:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150332 states to 150332 states and 464776 transitions. [2022-03-15 13:23:50,733 INFO L78 Accepts]: Start accepts. Automaton has 150332 states and 464776 transitions. Word has length 105 [2022-03-15 13:23:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:23:50,733 INFO L470 AbstractCegarLoop]: Abstraction has 150332 states and 464776 transitions. [2022-03-15 13:23:50,733 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-03-15 13:23:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 150332 states and 464776 transitions. [2022-03-15 13:23:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:23:50,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:23:50,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:23:50,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 13:23:50,947 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-03-15 13:23:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:23:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -597123419, now seen corresponding path program 19 times [2022-03-15 13:23:50,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:23:50,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963955568] [2022-03-15 13:23:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:23:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:23:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:23:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:23:51,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:23:51,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963955568] [2022-03-15 13:23:51,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963955568] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:23:51,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:23:51,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:23:51,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730521132] [2022-03-15 13:23:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:23:51,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:23:51,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:23:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:23:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:23:51,677 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-03-15 13:23:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:23:59,399 INFO L93 Difference]: Finished difference Result 199269 states and 614244 transitions. [2022-03-15 13:23:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 13:23:59,400 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-03-15 13:23:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:00,313 INFO L225 Difference]: With dead ends: 199269 [2022-03-15 13:24:00,313 INFO L226 Difference]: Without dead ends: 199269 [2022-03-15 13:24:00,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 13:24:00,317 INFO L933 BasicCegarLoop]: 958 mSDtfsCounter, 3083 mSDsluCounter, 9230 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:00,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3083 Valid, 10188 Invalid, 3835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3757 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:24:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199269 states. [2022-03-15 13:24:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199269 to 151448. [2022-03-15 13:24:03,796 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-03-15 13:24:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151448 states to 151448 states and 468160 transitions. [2022-03-15 13:24:04,630 INFO L78 Accepts]: Start accepts. Automaton has 151448 states and 468160 transitions. Word has length 105 [2022-03-15 13:24:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:04,630 INFO L470 AbstractCegarLoop]: Abstraction has 151448 states and 468160 transitions. [2022-03-15 13:24:04,630 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-03-15 13:24:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 151448 states and 468160 transitions. [2022-03-15 13:24:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:24:04,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:04,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:24:04,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 13:24:04,789 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-03-15 13:24:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1577004009, now seen corresponding path program 20 times [2022-03-15 13:24:04,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:04,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787432387] [2022-03-15 13:24:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:24:05,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:05,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787432387] [2022-03-15 13:24:05,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787432387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:05,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:05,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:05,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442290499] [2022-03-15 13:24:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:05,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:05,575 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-03-15 13:24:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:16,214 INFO L93 Difference]: Finished difference Result 198718 states and 612275 transitions. [2022-03-15 13:24:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:24:16,214 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-03-15 13:24:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:16,832 INFO L225 Difference]: With dead ends: 198718 [2022-03-15 13:24:16,832 INFO L226 Difference]: Without dead ends: 198718 [2022-03-15 13:24:16,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:24:16,834 INFO L933 BasicCegarLoop]: 1509 mSDtfsCounter, 3107 mSDsluCounter, 13220 mSDsCounter, 0 mSdLazyCounter, 5310 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:16,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3107 Valid, 14729 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 5310 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 13:24:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198718 states. [2022-03-15 13:24:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198718 to 144039. [2022-03-15 13:24:20,531 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-03-15 13:24:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144039 states to 144039 states and 445082 transitions. [2022-03-15 13:24:20,952 INFO L78 Accepts]: Start accepts. Automaton has 144039 states and 445082 transitions. Word has length 105 [2022-03-15 13:24:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:20,953 INFO L470 AbstractCegarLoop]: Abstraction has 144039 states and 445082 transitions. [2022-03-15 13:24:20,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 29 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 13:24:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 144039 states and 445082 transitions. [2022-03-15 13:24:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:24:21,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:21,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:24:21,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 13:24:21,490 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-03-15 13:24:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1518001723, now seen corresponding path program 21 times [2022-03-15 13:24:21,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:21,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395739673] [2022-03-15 13:24:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:24:22,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:22,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395739673] [2022-03-15 13:24:22,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395739673] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:22,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:22,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:24:22,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430353053] [2022-03-15 13:24:22,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:22,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:24:22,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:24:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:24:22,180 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-03-15 13:24:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:32,538 INFO L93 Difference]: Finished difference Result 190782 states and 587489 transitions. [2022-03-15 13:24:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 13:24:32,538 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-03-15 13:24:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:33,070 INFO L225 Difference]: With dead ends: 190782 [2022-03-15 13:24:33,070 INFO L226 Difference]: Without dead ends: 190782 [2022-03-15 13:24:33,070 INFO L932 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-03-15 13:24:33,071 INFO L933 BasicCegarLoop]: 1538 mSDtfsCounter, 2853 mSDsluCounter, 11410 mSDsCounter, 0 mSdLazyCounter, 4424 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-03-15 13:24:33,071 INFO L934 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-03-15 13:24:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190782 states. [2022-03-15 13:24:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190782 to 142551. [2022-03-15 13:24:37,182 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-03-15 13:24:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142551 states to 142551 states and 440460 transitions. [2022-03-15 13:24:38,262 INFO L78 Accepts]: Start accepts. Automaton has 142551 states and 440460 transitions. Word has length 105 [2022-03-15 13:24:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:38,262 INFO L470 AbstractCegarLoop]: Abstraction has 142551 states and 440460 transitions. [2022-03-15 13:24:38,262 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-03-15 13:24:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 142551 states and 440460 transitions. [2022-03-15 13:24:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:24:38,612 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:38,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:24:38,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 13:24:38,613 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-03-15 13:24:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash 866571049, now seen corresponding path program 22 times [2022-03-15 13:24:38,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:38,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893715196] [2022-03-15 13:24:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:38,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:24:39,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:39,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893715196] [2022-03-15 13:24:39,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893715196] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:39,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:39,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:39,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725806006] [2022-03-15 13:24:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:39,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:39,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:39,320 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-03-15 13:24:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:45,754 INFO L93 Difference]: Finished difference Result 233273 states and 720655 transitions. [2022-03-15 13:24:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 13:24:45,754 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-03-15 13:24:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:24:46,807 INFO L225 Difference]: With dead ends: 233273 [2022-03-15 13:24:46,807 INFO L226 Difference]: Without dead ends: 233273 [2022-03-15 13:24:46,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 13:24:46,808 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 3181 mSDsluCounter, 10654 mSDsCounter, 0 mSdLazyCounter, 4667 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:24:46,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3181 Valid, 11474 Invalid, 4750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4667 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:24:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233273 states. [2022-03-15 13:24:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233273 to 153091. [2022-03-15 13:24:50,814 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-03-15 13:24:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153091 states to 153091 states and 473595 transitions. [2022-03-15 13:24:51,767 INFO L78 Accepts]: Start accepts. Automaton has 153091 states and 473595 transitions. Word has length 105 [2022-03-15 13:24:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:24:51,767 INFO L470 AbstractCegarLoop]: Abstraction has 153091 states and 473595 transitions. [2022-03-15 13:24:51,767 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-03-15 13:24:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 153091 states and 473595 transitions. [2022-03-15 13:24:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:24:52,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:24:52,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:24:52,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 13:24:52,005 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-03-15 13:24:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:24:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1585875821, now seen corresponding path program 23 times [2022-03-15 13:24:52,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:24:52,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367448179] [2022-03-15 13:24:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:24:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:24:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:24:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:24:52,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:24:52,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367448179] [2022-03-15 13:24:52,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367448179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:24:52,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:24:52,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:24:52,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516835536] [2022-03-15 13:24:52,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:24:52,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:24:52,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:24:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:24:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:24:52,986 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-03-15 13:24:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:24:59,022 INFO L93 Difference]: Finished difference Result 232808 states and 718687 transitions. [2022-03-15 13:24:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 13:24:59,023 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-03-15 13:24:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:00,033 INFO L225 Difference]: With dead ends: 232808 [2022-03-15 13:25:00,033 INFO L226 Difference]: Without dead ends: 232808 [2022-03-15 13:25:00,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 13:25:00,034 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 2839 mSDsluCounter, 9942 mSDsCounter, 0 mSdLazyCounter, 4251 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-03-15 13:25:00,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2839 Valid, 10895 Invalid, 4322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4251 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 13:25:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232808 states. [2022-03-15 13:25:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232808 to 154207. [2022-03-15 13:25:04,111 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-03-15 13:25:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154207 states to 154207 states and 476979 transitions. [2022-03-15 13:25:04,564 INFO L78 Accepts]: Start accepts. Automaton has 154207 states and 476979 transitions. Word has length 105 [2022-03-15 13:25:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:04,565 INFO L470 AbstractCegarLoop]: Abstraction has 154207 states and 476979 transitions. [2022-03-15 13:25:04,565 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-03-15 13:25:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 154207 states and 476979 transitions. [2022-03-15 13:25:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:25:05,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:05,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:25:05,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 13:25:05,144 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-03-15 13:25:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 588251607, now seen corresponding path program 24 times [2022-03-15 13:25:05,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:05,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925510131] [2022-03-15 13:25:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:25:05,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:05,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925510131] [2022-03-15 13:25:05,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925510131] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:05,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:05,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:05,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208270121] [2022-03-15 13:25:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:05,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:05,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:05,820 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-03-15 13:25:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:12,978 INFO L93 Difference]: Finished difference Result 227349 states and 701584 transitions. [2022-03-15 13:25:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 13:25:12,979 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-03-15 13:25:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:13,696 INFO L225 Difference]: With dead ends: 227349 [2022-03-15 13:25:13,696 INFO L226 Difference]: Without dead ends: 227349 [2022-03-15 13:25:13,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1480, Invalid=3632, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 13:25:13,697 INFO L933 BasicCegarLoop]: 1123 mSDtfsCounter, 2470 mSDsluCounter, 10956 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:25:13,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2470 Valid, 12079 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 4795 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 13:25:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227349 states. [2022-03-15 13:25:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227349 to 155230. [2022-03-15 13:25:18,514 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-03-15 13:25:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155230 states to 155230 states and 480143 transitions. [2022-03-15 13:25:19,398 INFO L78 Accepts]: Start accepts. Automaton has 155230 states and 480143 transitions. Word has length 105 [2022-03-15 13:25:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:19,398 INFO L470 AbstractCegarLoop]: Abstraction has 155230 states and 480143 transitions. [2022-03-15 13:25:19,399 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-03-15 13:25:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 155230 states and 480143 transitions. [2022-03-15 13:25:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:25:19,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:19,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:25:19,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 13:25:19,657 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-03-15 13:25:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 529249321, now seen corresponding path program 25 times [2022-03-15 13:25:19,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:19,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541534405] [2022-03-15 13:25:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:25:20,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:20,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541534405] [2022-03-15 13:25:20,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541534405] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:20,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:20,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:25:20,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626641609] [2022-03-15 13:25:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:20,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:25:20,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:25:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:25:20,301 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-03-15 13:25:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:30,518 INFO L93 Difference]: Finished difference Result 221250 states and 682464 transitions. [2022-03-15 13:25:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 13:25:30,518 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-03-15 13:25:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:31,284 INFO L225 Difference]: With dead ends: 221250 [2022-03-15 13:25:31,284 INFO L226 Difference]: Without dead ends: 221250 [2022-03-15 13:25:31,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2549, Invalid=6007, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 13:25:31,286 INFO L933 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-03-15 13:25:31,286 INFO L934 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-03-15 13:25:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221250 states. [2022-03-15 13:25:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221250 to 153246. [2022-03-15 13:25:35,526 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-03-15 13:25:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153246 states to 153246 states and 474075 transitions. [2022-03-15 13:25:36,414 INFO L78 Accepts]: Start accepts. Automaton has 153246 states and 474075 transitions. Word has length 105 [2022-03-15 13:25:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:36,414 INFO L470 AbstractCegarLoop]: Abstraction has 153246 states and 474075 transitions. [2022-03-15 13:25:36,414 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-03-15 13:25:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 153246 states and 474075 transitions. [2022-03-15 13:25:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:25:36,634 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:36,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:25:36,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 13:25:36,634 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-03-15 13:25:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash -992100757, now seen corresponding path program 26 times [2022-03-15 13:25:36,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:36,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783840084] [2022-03-15 13:25:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:25:37,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:37,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783840084] [2022-03-15 13:25:37,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783840084] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:37,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:37,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:37,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768640591] [2022-03-15 13:25:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:37,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:37,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:37,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:37,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:37,250 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-03-15 13:25:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:25:45,387 INFO L93 Difference]: Finished difference Result 237654 states and 735727 transitions. [2022-03-15 13:25:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 13:25:45,388 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-03-15 13:25:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:25:46,492 INFO L225 Difference]: With dead ends: 237654 [2022-03-15 13:25:46,492 INFO L226 Difference]: Without dead ends: 237654 [2022-03-15 13:25:46,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1278, Invalid=3834, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 13:25:46,493 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 3519 mSDsluCounter, 9737 mSDsCounter, 0 mSdLazyCounter, 4349 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:25:46,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3519 Valid, 10560 Invalid, 4437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4349 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:25:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237654 states. [2022-03-15 13:25:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237654 to 166204. [2022-03-15 13:25:50,952 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-03-15 13:25:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166204 states to 166204 states and 515816 transitions. [2022-03-15 13:25:52,144 INFO L78 Accepts]: Start accepts. Automaton has 166204 states and 515816 transitions. Word has length 105 [2022-03-15 13:25:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:25:52,144 INFO L470 AbstractCegarLoop]: Abstraction has 166204 states and 515816 transitions. [2022-03-15 13:25:52,144 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-03-15 13:25:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 166204 states and 515816 transitions. [2022-03-15 13:25:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:25:52,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:25:52,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:25:52,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 13:25:52,402 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-03-15 13:25:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:25:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 850419669, now seen corresponding path program 27 times [2022-03-15 13:25:52,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:25:52,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945172522] [2022-03-15 13:25:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:25:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:25:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:25:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:25:52,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:25:52,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945172522] [2022-03-15 13:25:52,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945172522] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:25:52,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:25:52,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:25:52,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934647830] [2022-03-15 13:25:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:25:52,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:25:52,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:25:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:25:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:25:52,981 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-03-15 13:26:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:01,169 INFO L93 Difference]: Finished difference Result 227641 states and 703722 transitions. [2022-03-15 13:26:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 13:26:01,169 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-03-15 13:26:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:02,219 INFO L225 Difference]: With dead ends: 227641 [2022-03-15 13:26:02,220 INFO L226 Difference]: Without dead ends: 227641 [2022-03-15 13:26:02,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3722, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 13:26:02,220 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 2950 mSDsluCounter, 10008 mSDsCounter, 0 mSdLazyCounter, 4489 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:02,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 10964 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4489 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:26:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227641 states. [2022-03-15 13:26:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227641 to 156811. [2022-03-15 13:26:06,356 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-03-15 13:26:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156811 states to 156811 states and 485350 transitions. [2022-03-15 13:26:06,808 INFO L78 Accepts]: Start accepts. Automaton has 156811 states and 485350 transitions. Word has length 105 [2022-03-15 13:26:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:06,808 INFO L470 AbstractCegarLoop]: Abstraction has 156811 states and 485350 transitions. [2022-03-15 13:26:06,808 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-03-15 13:26:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 156811 states and 485350 transitions. [2022-03-15 13:26:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:26:07,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:07,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:26:07,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 13:26:07,380 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-03-15 13:26:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1270420199, now seen corresponding path program 28 times [2022-03-15 13:26:07,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:07,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989830847] [2022-03-15 13:26:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:26:08,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:08,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989830847] [2022-03-15 13:26:08,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989830847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:08,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:08,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:26:08,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985519340] [2022-03-15 13:26:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:08,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:26:08,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:26:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:26:08,036 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-03-15 13:26:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:14,139 INFO L93 Difference]: Finished difference Result 214794 states and 663183 transitions. [2022-03-15 13:26:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 13:26:14,140 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-03-15 13:26:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:15,133 INFO L225 Difference]: With dead ends: 214794 [2022-03-15 13:26:15,133 INFO L226 Difference]: Without dead ends: 214794 [2022-03-15 13:26:15,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1210, Invalid=3080, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 13:26:15,134 INFO L933 BasicCegarLoop]: 998 mSDtfsCounter, 2789 mSDsluCounter, 8425 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:15,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2789 Valid, 9423 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 13:26:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214794 states. [2022-03-15 13:26:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214794 to 158547. [2022-03-15 13:26:19,403 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-03-15 13:26:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158547 states to 158547 states and 490769 transitions. [2022-03-15 13:26:20,246 INFO L78 Accepts]: Start accepts. Automaton has 158547 states and 490769 transitions. Word has length 105 [2022-03-15 13:26:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:20,246 INFO L470 AbstractCegarLoop]: Abstraction has 158547 states and 490769 transitions. [2022-03-15 13:26:20,247 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-03-15 13:26:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 158547 states and 490769 transitions. [2022-03-15 13:26:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:26:20,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:20,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:26:20,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 13:26:20,447 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-03-15 13:26:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1329422485, now seen corresponding path program 29 times [2022-03-15 13:26:20,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:20,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088878948] [2022-03-15 13:26:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:26:20,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:20,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088878948] [2022-03-15 13:26:20,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088878948] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:20,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:20,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:26:20,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120240596] [2022-03-15 13:26:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:20,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:26:20,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:26:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:26:20,988 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-03-15 13:26:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:30,490 INFO L93 Difference]: Finished difference Result 212229 states and 654614 transitions. [2022-03-15 13:26:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 13:26:30,491 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-03-15 13:26:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:31,498 INFO L225 Difference]: With dead ends: 212229 [2022-03-15 13:26:31,498 INFO L226 Difference]: Without dead ends: 212229 [2022-03-15 13:26:31,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2594, Invalid=6148, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 13:26:31,499 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 2524 mSDsluCounter, 13609 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:31,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2524 Valid, 15268 Invalid, 5752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 13:26:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212229 states. [2022-03-15 13:26:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212229 to 153339. [2022-03-15 13:26:35,121 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-03-15 13:26:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153339 states to 153339 states and 474450 transitions. [2022-03-15 13:26:35,948 INFO L78 Accepts]: Start accepts. Automaton has 153339 states and 474450 transitions. Word has length 105 [2022-03-15 13:26:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:26:35,948 INFO L470 AbstractCegarLoop]: Abstraction has 153339 states and 474450 transitions. [2022-03-15 13:26:35,948 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-03-15 13:26:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 153339 states and 474450 transitions. [2022-03-15 13:26:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:26:36,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:26:36,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:26:36,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 13:26:36,142 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-03-15 13:26:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:26:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1833071899, now seen corresponding path program 30 times [2022-03-15 13:26:36,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:26:36,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403320221] [2022-03-15 13:26:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:26:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:26:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:26:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:26:37,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:26:37,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403320221] [2022-03-15 13:26:37,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403320221] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:26:37,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:26:37,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:26:37,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806422044] [2022-03-15 13:26:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:26:37,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:26:37,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:26:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:26:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:26:37,217 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-03-15 13:26:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:26:54,101 INFO L93 Difference]: Finished difference Result 237913 states and 732847 transitions. [2022-03-15 13:26:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 13:26:54,101 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-03-15 13:26:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:26:55,414 INFO L225 Difference]: With dead ends: 237913 [2022-03-15 13:26:55,414 INFO L226 Difference]: Without dead ends: 237913 [2022-03-15 13:26:55,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=3990, Invalid=10530, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 13:26:55,416 INFO L933 BasicCegarLoop]: 1901 mSDtfsCounter, 3612 mSDsluCounter, 14754 mSDsCounter, 0 mSdLazyCounter, 6406 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:26:55,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3612 Valid, 16655 Invalid, 6500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 6406 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 13:26:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237913 states. [2022-03-15 13:26:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237913 to 140877. [2022-03-15 13:26:59,233 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-03-15 13:27:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140877 states to 140877 states and 435109 transitions. [2022-03-15 13:27:00,066 INFO L78 Accepts]: Start accepts. Automaton has 140877 states and 435109 transitions. Word has length 105 [2022-03-15 13:27:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:00,067 INFO L470 AbstractCegarLoop]: Abstraction has 140877 states and 435109 transitions. [2022-03-15 13:27:00,067 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-03-15 13:27:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 140877 states and 435109 transitions. [2022-03-15 13:27:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:27:00,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:00,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:27:00,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 13:27:00,216 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-03-15 13:27:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1635135007, now seen corresponding path program 31 times [2022-03-15 13:27:00,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:00,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234131013] [2022-03-15 13:27:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:27:00,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:00,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234131013] [2022-03-15 13:27:00,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234131013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:00,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:00,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:27:00,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248851402] [2022-03-15 13:27:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:00,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:27:00,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:27:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:27:00,939 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-03-15 13:27:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:19,020 INFO L93 Difference]: Finished difference Result 246583 states and 761014 transitions. [2022-03-15 13:27:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 13:27:19,020 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-03-15 13:27:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:19,803 INFO L225 Difference]: With dead ends: 246583 [2022-03-15 13:27:19,803 INFO L226 Difference]: Without dead ends: 246583 [2022-03-15 13:27:19,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4164, Invalid=10842, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 13:27:19,804 INFO L933 BasicCegarLoop]: 2352 mSDtfsCounter, 3513 mSDsluCounter, 21274 mSDsCounter, 0 mSdLazyCounter, 9241 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3513 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, 3.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:27:19,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3513 Valid, 23626 Invalid, 9341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 9241 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-03-15 13:27:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246583 states. [2022-03-15 13:27:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246583 to 153587. [2022-03-15 13:27:24,166 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-03-15 13:27:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153587 states to 153587 states and 475158 transitions. [2022-03-15 13:27:25,061 INFO L78 Accepts]: Start accepts. Automaton has 153587 states and 475158 transitions. Word has length 105 [2022-03-15 13:27:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:25,062 INFO L470 AbstractCegarLoop]: Abstraction has 153587 states and 475158 transitions. [2022-03-15 13:27:25,062 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-03-15 13:27:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 153587 states and 475158 transitions. [2022-03-15 13:27:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:27:25,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:25,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:27:25,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 13:27:25,295 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-03-15 13:27:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 382514239, now seen corresponding path program 32 times [2022-03-15 13:27:25,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:25,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143522117] [2022-03-15 13:27:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:27:26,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:26,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143522117] [2022-03-15 13:27:26,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143522117] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:26,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:26,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:27:26,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760208792] [2022-03-15 13:27:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:26,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:27:26,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:27:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:27:26,592 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-03-15 13:27:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:27:45,938 INFO L93 Difference]: Finished difference Result 253290 states and 783061 transitions. [2022-03-15 13:27:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 13:27:45,939 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-03-15 13:27:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:27:46,866 INFO L225 Difference]: With dead ends: 253290 [2022-03-15 13:27:46,866 INFO L226 Difference]: Without dead ends: 253290 [2022-03-15 13:27:46,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3717 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=4723, Invalid=13367, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 13:27:46,867 INFO L933 BasicCegarLoop]: 2526 mSDtfsCounter, 3154 mSDsluCounter, 18480 mSDsCounter, 0 mSdLazyCounter, 8172 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:27:46,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3154 Valid, 21006 Invalid, 8261 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 8172 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 13:27:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253290 states. [2022-03-15 13:27:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253290 to 153649. [2022-03-15 13:27:51,368 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-03-15 13:27:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153649 states to 153649 states and 475346 transitions. [2022-03-15 13:27:52,301 INFO L78 Accepts]: Start accepts. Automaton has 153649 states and 475346 transitions. Word has length 105 [2022-03-15 13:27:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:27:52,301 INFO L470 AbstractCegarLoop]: Abstraction has 153649 states and 475346 transitions. [2022-03-15 13:27:52,301 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-03-15 13:27:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 153649 states and 475346 transitions. [2022-03-15 13:27:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:27:52,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:27:52,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:27:52,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 13:27:52,518 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-03-15 13:27:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:27:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1308604067, now seen corresponding path program 33 times [2022-03-15 13:27:52,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:27:52,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740448715] [2022-03-15 13:27:52,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:27:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:27:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:27:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:27:53,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:27:53,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740448715] [2022-03-15 13:27:53,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740448715] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:27:53,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:27:53,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:27:53,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259589623] [2022-03-15 13:27:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:27:53,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:27:53,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:27:53,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:27:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:27:53,096 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-03-15 13:28:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:11,541 INFO L93 Difference]: Finished difference Result 246346 states and 762005 transitions. [2022-03-15 13:28:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 13:28:11,541 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-03-15 13:28:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:12,712 INFO L225 Difference]: With dead ends: 246346 [2022-03-15 13:28:12,712 INFO L226 Difference]: Without dead ends: 246346 [2022-03-15 13:28:12,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=4985, Invalid=14475, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 13:28:12,713 INFO L933 BasicCegarLoop]: 2647 mSDtfsCounter, 3786 mSDsluCounter, 19984 mSDsCounter, 0 mSdLazyCounter, 8907 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:12,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3786 Valid, 22631 Invalid, 9015 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 8907 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 13:28:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246346 states. [2022-03-15 13:28:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246346 to 153928. [2022-03-15 13:28:17,223 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-03-15 13:28:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153928 states to 153928 states and 476223 transitions. [2022-03-15 13:28:17,899 INFO L78 Accepts]: Start accepts. Automaton has 153928 states and 476223 transitions. Word has length 105 [2022-03-15 13:28:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:17,899 INFO L470 AbstractCegarLoop]: Abstraction has 153928 states and 476223 transitions. [2022-03-15 13:28:17,899 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-03-15 13:28:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 153928 states and 476223 transitions. [2022-03-15 13:28:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:28:18,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:18,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:28:18,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 13:28:18,502 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-03-15 13:28:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash -371924933, now seen corresponding path program 34 times [2022-03-15 13:28:18,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:18,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549553341] [2022-03-15 13:28:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:28:19,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:19,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549553341] [2022-03-15 13:28:19,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549553341] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:19,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:19,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:28:19,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990096427] [2022-03-15 13:28:19,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:19,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:28:19,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:19,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:28:19,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:28:19,284 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-03-15 13:28:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:36,601 INFO L93 Difference]: Finished difference Result 236157 states and 729167 transitions. [2022-03-15 13:28:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-03-15 13:28:36,602 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-03-15 13:28:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:37,633 INFO L225 Difference]: With dead ends: 236157 [2022-03-15 13:28:37,633 INFO L226 Difference]: Without dead ends: 236157 [2022-03-15 13:28:37,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4584 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=4945, Invalid=15077, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 13:28:37,634 INFO L933 BasicCegarLoop]: 2644 mSDtfsCounter, 3211 mSDsluCounter, 21541 mSDsCounter, 0 mSdLazyCounter, 9320 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.6s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:37,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3211 Valid, 24185 Invalid, 9415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 9320 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 13:28:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236157 states. [2022-03-15 13:28:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236157 to 141509. [2022-03-15 13:28:41,861 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-03-15 13:28:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141509 states to 141509 states and 437068 transitions. [2022-03-15 13:28:42,535 INFO L78 Accepts]: Start accepts. Automaton has 141509 states and 437068 transitions. Word has length 105 [2022-03-15 13:28:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:42,535 INFO L470 AbstractCegarLoop]: Abstraction has 141509 states and 437068 transitions. [2022-03-15 13:28:42,535 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-03-15 13:28:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 141509 states and 437068 transitions. [2022-03-15 13:28:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:28:43,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:43,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:28:43,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 13:28:43,166 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-03-15 13:28:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1588554697, now seen corresponding path program 35 times [2022-03-15 13:28:43,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:43,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50561098] [2022-03-15 13:28:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:28:43,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:43,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50561098] [2022-03-15 13:28:43,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50561098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:43,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:43,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:43,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363616827] [2022-03-15 13:28:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:43,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:43,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:43,788 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-03-15 13:28:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:28:50,683 INFO L93 Difference]: Finished difference Result 170978 states and 526669 transitions. [2022-03-15 13:28:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 13:28:50,683 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-03-15 13:28:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:28:51,357 INFO L225 Difference]: With dead ends: 170978 [2022-03-15 13:28:51,357 INFO L226 Difference]: Without dead ends: 170978 [2022-03-15 13:28:51,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 13:28:51,358 INFO L933 BasicCegarLoop]: 1047 mSDtfsCounter, 3152 mSDsluCounter, 11632 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:28:51,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3152 Valid, 12679 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 13:28:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170978 states. [2022-03-15 13:28:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170978 to 142129. [2022-03-15 13:28:55,506 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-03-15 13:28:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142129 states to 142129 states and 439003 transitions. [2022-03-15 13:28:56,419 INFO L78 Accepts]: Start accepts. Automaton has 142129 states and 439003 transitions. Word has length 105 [2022-03-15 13:28:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:28:56,419 INFO L470 AbstractCegarLoop]: Abstraction has 142129 states and 439003 transitions. [2022-03-15 13:28:56,419 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-03-15 13:28:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 142129 states and 439003 transitions. [2022-03-15 13:28:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:28:56,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:28:56,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:28:56,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 13:28:56,608 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-03-15 13:28:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:28:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995067, now seen corresponding path program 36 times [2022-03-15 13:28:56,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:28:56,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818849285] [2022-03-15 13:28:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:28:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:28:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:28:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:28:57,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:28:57,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818849285] [2022-03-15 13:28:57,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818849285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:28:57,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:28:57,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:28:57,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421137360] [2022-03-15 13:28:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:28:57,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:28:57,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:28:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:28:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:28:57,100 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-03-15 13:29:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:05,676 INFO L93 Difference]: Finished difference Result 178280 states and 549214 transitions. [2022-03-15 13:29:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:29:05,677 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-03-15 13:29:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:06,336 INFO L225 Difference]: With dead ends: 178280 [2022-03-15 13:29:06,336 INFO L226 Difference]: Without dead ends: 178280 [2022-03-15 13:29:06,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2093, Invalid=5917, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:29:06,337 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 2897 mSDsluCounter, 13545 mSDsCounter, 0 mSdLazyCounter, 5391 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:06,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2897 Valid, 14877 Invalid, 5462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 13:29:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178280 states. [2022-03-15 13:29:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178280 to 142625. [2022-03-15 13:29:10,480 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-03-15 13:29:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142625 states to 142625 states and 440562 transitions. [2022-03-15 13:29:11,313 INFO L78 Accepts]: Start accepts. Automaton has 142625 states and 440562 transitions. Word has length 105 [2022-03-15 13:29:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:11,313 INFO L470 AbstractCegarLoop]: Abstraction has 142625 states and 440562 transitions. [2022-03-15 13:29:11,313 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-03-15 13:29:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 142625 states and 440562 transitions. [2022-03-15 13:29:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:29:11,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:11,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:29:11,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 13:29:11,473 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-03-15 13:29:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1678675625, now seen corresponding path program 37 times [2022-03-15 13:29:11,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:11,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469121908] [2022-03-15 13:29:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:29:12,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:12,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469121908] [2022-03-15 13:29:12,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469121908] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:12,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:12,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:29:12,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117516827] [2022-03-15 13:29:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:12,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:29:12,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:12,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:29:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:29:12,126 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-03-15 13:29:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:23,593 INFO L93 Difference]: Finished difference Result 176668 states and 544178 transitions. [2022-03-15 13:29:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 13:29:23,594 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-03-15 13:29:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:24,549 INFO L225 Difference]: With dead ends: 176668 [2022-03-15 13:29:24,549 INFO L226 Difference]: Without dead ends: 176668 [2022-03-15 13:29:24,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 13:29:24,550 INFO L933 BasicCegarLoop]: 1379 mSDtfsCounter, 2547 mSDsluCounter, 12390 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:24,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2547 Valid, 13769 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 13:29:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176668 states. [2022-03-15 13:29:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176668 to 149042. [2022-03-15 13:29:28,238 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-03-15 13:29:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149042 states to 149042 states and 460680 transitions. [2022-03-15 13:29:28,694 INFO L78 Accepts]: Start accepts. Automaton has 149042 states and 460680 transitions. Word has length 105 [2022-03-15 13:29:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:28,694 INFO L470 AbstractCegarLoop]: Abstraction has 149042 states and 460680 transitions. [2022-03-15 13:29:28,694 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-03-15 13:29:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 149042 states and 460680 transitions. [2022-03-15 13:29:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:29:29,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:29,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:29:29,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 13:29:29,285 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-03-15 13:29:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2134918345, now seen corresponding path program 38 times [2022-03-15 13:29:29,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:29,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967517362] [2022-03-15 13:29:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:29:29,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:29,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967517362] [2022-03-15 13:29:29,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967517362] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:29,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:29,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-15 13:29:29,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962245739] [2022-03-15 13:29:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:29,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 13:29:29,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 13:29:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-03-15 13:29:29,792 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-03-15 13:29:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:34,546 INFO L93 Difference]: Finished difference Result 185557 states and 572303 transitions. [2022-03-15 13:29:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 13:29:34,547 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-03-15 13:29:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:35,119 INFO L225 Difference]: With dead ends: 185557 [2022-03-15 13:29:35,120 INFO L226 Difference]: Without dead ends: 185557 [2022-03-15 13:29:35,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 13:29:35,120 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 2255 mSDsluCounter, 8783 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:35,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2255 Valid, 9565 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3567 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 13:29:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185557 states. [2022-03-15 13:29:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185557 to 157691. [2022-03-15 13:29:38,907 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-03-15 13:29:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157691 states to 157691 states and 487855 transitions. [2022-03-15 13:29:39,845 INFO L78 Accepts]: Start accepts. Automaton has 157691 states and 487855 transitions. Word has length 105 [2022-03-15 13:29:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:39,846 INFO L470 AbstractCegarLoop]: Abstraction has 157691 states and 487855 transitions. [2022-03-15 13:29:39,846 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-03-15 13:29:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 157691 states and 487855 transitions. [2022-03-15 13:29:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:29:40,080 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:40,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:29:40,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 13:29:40,081 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-03-15 13:29:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1856598903, now seen corresponding path program 39 times [2022-03-15 13:29:40,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:40,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293687081] [2022-03-15 13:29:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:29:41,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:41,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293687081] [2022-03-15 13:29:41,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293687081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:41,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:41,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-15 13:29:41,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087078264] [2022-03-15 13:29:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:41,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 13:29:41,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 13:29:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-15 13:29:41,193 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-03-15 13:29:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:29:51,911 INFO L93 Difference]: Finished difference Result 189057 states and 582793 transitions. [2022-03-15 13:29:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 13:29:51,911 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-03-15 13:29:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:29:53,004 INFO L225 Difference]: With dead ends: 189057 [2022-03-15 13:29:53,005 INFO L226 Difference]: Without dead ends: 189057 [2022-03-15 13:29:53,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2320, Invalid=5690, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:29:53,021 INFO L933 BasicCegarLoop]: 1506 mSDtfsCounter, 2833 mSDsluCounter, 13717 mSDsCounter, 0 mSdLazyCounter, 5522 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:29:53,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2833 Valid, 15223 Invalid, 5612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 5522 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 13:29:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189057 states. [2022-03-15 13:29:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189057 to 159117. [2022-03-15 13:29:57,191 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-03-15 13:29:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159117 states to 159117 states and 492289 transitions. [2022-03-15 13:29:58,147 INFO L78 Accepts]: Start accepts. Automaton has 159117 states and 492289 transitions. Word has length 105 [2022-03-15 13:29:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:29:58,149 INFO L470 AbstractCegarLoop]: Abstraction has 159117 states and 492289 transitions. [2022-03-15 13:29:58,149 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-03-15 13:29:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 159117 states and 492289 transitions. [2022-03-15 13:29:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 13:29:58,359 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:29:58,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:29:58,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 13:29:58,360 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-03-15 13:29:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:29:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1797596617, now seen corresponding path program 40 times [2022-03-15 13:29:58,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:29:58,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624887958] [2022-03-15 13:29:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:29:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:29:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:29:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:29:59,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:29:59,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624887958] [2022-03-15 13:29:59,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624887958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:29:59,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:29:59,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-15 13:29:59,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317780318] [2022-03-15 13:29:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:29:59,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 13:29:59,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:29:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 13:29:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-03-15 13:29:59,425 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-03-15 13:30:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:30:09,488 INFO L93 Difference]: Finished difference Result 190555 states and 587377 transitions. [2022-03-15 13:30:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 13:30:09,488 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-03-15 13:30:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:30:10,365 INFO L225 Difference]: With dead ends: 190555 [2022-03-15 13:30:10,365 INFO L226 Difference]: Without dead ends: 190555 [2022-03-15 13:30:10,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2387, Invalid=5623, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 13:30:10,366 INFO L933 BasicCegarLoop]: 1535 mSDtfsCounter, 2413 mSDsluCounter, 11836 mSDsCounter, 0 mSdLazyCounter, 4483 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 13:30:10,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2413 Valid, 13371 Invalid, 4555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4483 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 13:30:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190555 states. [2022-03-15 13:30:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190555 to 157691. [2022-03-15 13:30:14,839 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)