/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 10:55:23,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 10:55:23,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 10:55:23,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 10:55:23,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 10:55:23,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 10:55:23,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 10:55:23,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 10:55:23,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 10:55:23,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 10:55:23,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 10:55:23,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 10:55:23,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 10:55:23,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 10:55:23,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 10:55:23,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 10:55:23,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 10:55:23,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 10:55:23,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 10:55:23,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 10:55:23,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 10:55:23,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 10:55:23,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 10:55:23,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 10:55:23,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 10:55:23,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 10:55:23,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 10:55:23,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 10:55:23,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 10:55:23,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 10:55:23,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 10:55:23,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 10:55:23,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 10:55:23,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 10:55:23,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 10:55:23,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 10:55:23,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 10:55:23,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 10:55:23,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 10:55:23,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 10:55:23,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 10:55:23,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-15 10:55:23,569 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 10:55:23,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 10:55:23,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 10:55:23,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 10:55:23,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 10:55:23,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 10:55:23,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 10:55:23,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 10:55:23,571 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 10:55:23,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 10:55:23,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 10:55:23,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 10:55:23,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 10:55:23,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 10:55:23,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:55:23,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 10:55:23,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 10:55:23,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 10:55:23,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 10:55:23,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 10:55:23,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-15 10:55:23,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 10:55:23,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 10:55:23,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 10:55:23,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 10:55:23,785 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 10:55:23,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-02-15 10:55:23,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c28fbbae/ff56af09e9cc4a6e8a61a0f7bbabb96e/FLAG3c8b5d14a [2022-02-15 10:55:24,240 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 10:55:24,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-02-15 10:55:24,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c28fbbae/ff56af09e9cc4a6e8a61a0f7bbabb96e/FLAG3c8b5d14a [2022-02-15 10:55:24,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c28fbbae/ff56af09e9cc4a6e8a61a0f7bbabb96e [2022-02-15 10:55:24,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 10:55:24,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 10:55:24,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 10:55:24,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 10:55:24,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 10:55:24,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:24,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f2b1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24, skipping insertion in model container [2022-02-15 10:55:24,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:24,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 10:55:24,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 10:55:24,756 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-15 10:55:24,876 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-1.i[39095,39108] [2022-02-15 10:55:24,879 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-1.i[39180,39193] [2022-02-15 10:55:24,880 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-1.i[39232,39245] [2022-02-15 10:55:24,908 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-1.i[49388,49401] [2022-02-15 10:55:24,908 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-1.i[49437,49450] [2022-02-15 10:55:24,910 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-1.i[49565,49578] [2022-02-15 10:55:24,910 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-1.i[49623,49636] [2022-02-15 10:55:24,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:55:24,919 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 10:55:24,926 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-15 10:55:24,939 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-1.i[39095,39108] [2022-02-15 10:55:24,940 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-1.i[39180,39193] [2022-02-15 10:55:24,940 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-1.i[39232,39245] [2022-02-15 10:55:24,946 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-1.i[49388,49401] [2022-02-15 10:55:24,947 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-1.i[49437,49450] [2022-02-15 10:55:24,947 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-1.i[49565,49578] [2022-02-15 10:55:24,948 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-1.i[49623,49636] [2022-02-15 10:55:24,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:55:24,997 INFO L208 MainTranslator]: Completed translation [2022-02-15 10:55:24,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24 WrapperNode [2022-02-15 10:55:24,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 10:55:24,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 10:55:25,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 10:55:25,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 10:55:25,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,061 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-02-15 10:55:25,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 10:55:25,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 10:55:25,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 10:55:25,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 10:55:25,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 10:55:25,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 10:55:25,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 10:55:25,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 10:55:25,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (1/1) ... [2022-02-15 10:55:25,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:55:25,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:55:25,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 10:55:25,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-02-15 10:55:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-02-15 10:55:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-15 10:55:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 10:55:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 10:55:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 10:55:25,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 10:55:25,175 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 10:55:25,305 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 10:55:25,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 10:55:25,568 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 10:55:25,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 10:55:25,575 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-15 10:55:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:55:25 BoogieIcfgContainer [2022-02-15 10:55:25,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 10:55:25,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 10:55:25,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 10:55:25,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 10:55:25,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:55:24" (1/3) ... [2022-02-15 10:55:25,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2138518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:55:25, skipping insertion in model container [2022-02-15 10:55:25,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:55:24" (2/3) ... [2022-02-15 10:55:25,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2138518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:55:25, skipping insertion in model container [2022-02-15 10:55:25,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:55:25" (3/3) ... [2022-02-15 10:55:25,583 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-02-15 10:55:25,587 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 10:55:25,587 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 10:55:25,587 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-15 10:55:25,587 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 10:55:25,631 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,631 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,631 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,632 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,633 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,634 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,635 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,636 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,637 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,638 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,639 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,640 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,641 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,642 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,643 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,644 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,645 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,646 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,647 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,648 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,649 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,650 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,651 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,652 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,653 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,654 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,655 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,656 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,657 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,658 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,659 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,660 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,661 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,662 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,663 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,664 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,664 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,664 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,665 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,666 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,666 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,666 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,667 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,667 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,667 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,668 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,669 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,670 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,671 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,672 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,673 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,674 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,674 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,674 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,674 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,675 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,676 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,677 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,678 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,678 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,679 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,679 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,679 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,680 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,682 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,684 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,684 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,684 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,684 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,684 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,685 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,685 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,686 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,686 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,688 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,692 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,693 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,694 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,699 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,700 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,701 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,702 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,703 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,704 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,704 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,704 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,705 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,706 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,707 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,708 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,709 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,710 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,711 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,712 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,712 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,713 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,716 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,716 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,717 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,718 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,719 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,719 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,719 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,719 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,719 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,722 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,723 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,724 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,725 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,726 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,727 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,728 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:55:25,732 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-15 10:55:25,762 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 10:55:25,767 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 10:55:25,767 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-15 10:55:25,777 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 223 places, 233 transitions, 482 flow [2022-02-15 10:55:28,141 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-15 10:55:28,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:28,588 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] [2022-02-15 10:55:28,588 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:55:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash 508547485, now seen corresponding path program 1 times [2022-02-15 10:55:28,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:28,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448336857] [2022-02-15 10:55:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:28,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:29,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:29,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448336857] [2022-02-15 10:55:29,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448336857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:29,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:29,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 10:55:29,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492399700] [2022-02-15 10:55:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:29,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 10:55:29,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 10:55:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:55:29,640 INFO L87 Difference]: Start difference. First operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 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 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:55:32,304 INFO L93 Difference]: Finished difference Result 105175 states and 323599 transitions. [2022-02-15 10:55:32,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-15 10:55:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-15 10:55:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:55:32,784 INFO L225 Difference]: With dead ends: 105175 [2022-02-15 10:55:32,784 INFO L226 Difference]: Without dead ends: 105120 [2022-02-15 10:55:32,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=890, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 10:55:32,788 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 923 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 10:55:32,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 1876 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 10:55:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105120 states. [2022-02-15 10:55:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105120 to 105095. [2022-02-15 10:55:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105095 states, 105091 states have (on average 3.0777516628445825) internal successors, (323444), 105094 states have internal predecessors, (323444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105095 states to 105095 states and 323444 transitions. [2022-02-15 10:55:36,576 INFO L78 Accepts]: Start accepts. Automaton has 105095 states and 323444 transitions. Word has length 90 [2022-02-15 10:55:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:55:36,577 INFO L470 AbstractCegarLoop]: Abstraction has 105095 states and 323444 transitions. [2022-02-15 10:55:36,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 105095 states and 323444 transitions. [2022-02-15 10:55:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-15 10:55:36,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:36,679 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] [2022-02-15 10:55:36,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 10:55:36,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:55:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1997030488, now seen corresponding path program 1 times [2022-02-15 10:55:36,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:36,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209999501] [2022-02-15 10:55:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:36,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:37,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:37,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209999501] [2022-02-15 10:55:37,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209999501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:37,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:37,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 10:55:37,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040424002] [2022-02-15 10:55:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:37,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-15 10:55:37,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-15 10:55:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-02-15 10:55:37,031 INFO L87 Difference]: Start difference. First operand 105095 states and 323444 transitions. Second operand has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:55:39,187 INFO L93 Difference]: Finished difference Result 119915 states and 368682 transitions. [2022-02-15 10:55:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 10:55:39,188 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-15 10:55:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:55:39,766 INFO L225 Difference]: With dead ends: 119915 [2022-02-15 10:55:39,766 INFO L226 Difference]: Without dead ends: 119915 [2022-02-15 10:55:39,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2022-02-15 10:55:39,767 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 1299 mSDsluCounter, 3974 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 10:55:39,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1299 Valid, 4404 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 10:55:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119915 states. [2022-02-15 10:55:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119915 to 113165. [2022-02-15 10:55:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113165 states, 113161 states have (on average 3.076077447177031) internal successors, (348092), 113164 states have internal predecessors, (348092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113165 states to 113165 states and 348092 transitions. [2022-02-15 10:55:43,282 INFO L78 Accepts]: Start accepts. Automaton has 113165 states and 348092 transitions. Word has length 95 [2022-02-15 10:55:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:55:43,283 INFO L470 AbstractCegarLoop]: Abstraction has 113165 states and 348092 transitions. [2022-02-15 10:55:43,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113165 states and 348092 transitions. [2022-02-15 10:55:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-15 10:55:43,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:43,344 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] [2022-02-15 10:55:43,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 10:55:43,344 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:55:43,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1144672626, now seen corresponding path program 2 times [2022-02-15 10:55:43,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:43,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075365862] [2022-02-15 10:55:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:43,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:43,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:43,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075365862] [2022-02-15 10:55:43,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075365862] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:43,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:43,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-15 10:55:43,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854564892] [2022-02-15 10:55:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:43,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-15 10:55:43,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:43,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-15 10:55:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-15 10:55:43,724 INFO L87 Difference]: Start difference. First operand 113165 states and 348092 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:55:46,654 INFO L93 Difference]: Finished difference Result 155725 states and 478789 transitions. [2022-02-15 10:55:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 10:55:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-15 10:55:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:55:47,422 INFO L225 Difference]: With dead ends: 155725 [2022-02-15 10:55:47,423 INFO L226 Difference]: Without dead ends: 154885 [2022-02-15 10:55:47,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 10:55:47,425 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 1981 mSDsluCounter, 5486 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:55:47,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1981 Valid, 6124 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-15 10:55:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154885 states. [2022-02-15 10:55:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154885 to 132244. [2022-02-15 10:55:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132244 states, 132240 states have (on average 3.0773744706594073) internal successors, (406952), 132243 states have internal predecessors, (406952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132244 states to 132244 states and 406952 transitions. [2022-02-15 10:55:51,377 INFO L78 Accepts]: Start accepts. Automaton has 132244 states and 406952 transitions. Word has length 95 [2022-02-15 10:55:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:55:51,377 INFO L470 AbstractCegarLoop]: Abstraction has 132244 states and 406952 transitions. [2022-02-15 10:55:51,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:55:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 132244 states and 406952 transitions. [2022-02-15 10:55:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:55:51,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:55:51,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:55:51,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 10:55:51,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:55:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:55:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1175061358, now seen corresponding path program 1 times [2022-02-15 10:55:51,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:55:51,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255952879] [2022-02-15 10:55:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:55:51,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:55:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:55:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:55:52,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:55:52,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255952879] [2022-02-15 10:55:52,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255952879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:55:52,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:55:52,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:55:52,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892906555] [2022-02-15 10:55:52,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:55:52,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:55:52,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:55:52,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:55:52,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:55:52,537 INFO L87 Difference]: Start difference. First operand 132244 states and 406952 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:00,218 INFO L93 Difference]: Finished difference Result 156625 states and 481546 transitions. [2022-02-15 10:56:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 10:56:00,219 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:56:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:00,701 INFO L225 Difference]: With dead ends: 156625 [2022-02-15 10:56:00,702 INFO L226 Difference]: Without dead ends: 156625 [2022-02-15 10:56:00,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1568, Invalid=4284, Unknown=0, NotChecked=0, Total=5852 [2022-02-15 10:56:00,703 INFO L933 BasicCegarLoop]: 1139 mSDtfsCounter, 3628 mSDsluCounter, 10478 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3628 SdHoareTripleChecker+Valid, 11617 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:00,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3628 Valid, 11617 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3636 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 10:56:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156625 states. [2022-02-15 10:56:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156625 to 133003. [2022-02-15 10:56:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133003 states, 132999 states have (on average 3.0775494552590623) internal successors, (409311), 133002 states have internal predecessors, (409311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133003 states to 133003 states and 409311 transitions. [2022-02-15 10:56:04,466 INFO L78 Accepts]: Start accepts. Automaton has 133003 states and 409311 transitions. Word has length 114 [2022-02-15 10:56:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:04,467 INFO L470 AbstractCegarLoop]: Abstraction has 133003 states and 409311 transitions. [2022-02-15 10:56:04,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 133003 states and 409311 transitions. [2022-02-15 10:56:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:56:04,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:04,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:56:04,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 10:56:04,938 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:56:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 788572584, now seen corresponding path program 2 times [2022-02-15 10:56:04,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:04,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173964567] [2022-02-15 10:56:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:04,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:05,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:05,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173964567] [2022-02-15 10:56:05,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173964567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:05,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:05,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:05,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184587240] [2022-02-15 10:56:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:05,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:05,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:05,720 INFO L87 Difference]: Start difference. First operand 133003 states and 409311 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:14,646 INFO L93 Difference]: Finished difference Result 167617 states and 515385 transitions. [2022-02-15 10:56:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-15 10:56:14,646 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:56:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:15,099 INFO L225 Difference]: With dead ends: 167617 [2022-02-15 10:56:15,100 INFO L226 Difference]: Without dead ends: 167617 [2022-02-15 10:56:15,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1678, Invalid=4642, Unknown=0, NotChecked=0, Total=6320 [2022-02-15 10:56:15,101 INFO L933 BasicCegarLoop]: 1144 mSDtfsCounter, 3287 mSDsluCounter, 13563 mSDsCounter, 0 mSdLazyCounter, 4887 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 14707 SdHoareTripleChecker+Invalid, 4962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:15,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3287 Valid, 14707 Invalid, 4962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4887 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-15 10:56:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167617 states. [2022-02-15 10:56:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167617 to 133036. [2022-02-15 10:56:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133036 states, 133032 states have (on average 3.077537735281737) internal successors, (409411), 133035 states have internal predecessors, (409411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133036 states to 133036 states and 409411 transitions. [2022-02-15 10:56:19,330 INFO L78 Accepts]: Start accepts. Automaton has 133036 states and 409411 transitions. Word has length 114 [2022-02-15 10:56:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:19,330 INFO L470 AbstractCegarLoop]: Abstraction has 133036 states and 409411 transitions. [2022-02-15 10:56:19,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 133036 states and 409411 transitions. [2022-02-15 10:56:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:56:19,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:19,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:56:19,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 10:56:19,467 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:56:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash 124783814, now seen corresponding path program 3 times [2022-02-15 10:56:19,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:19,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845979677] [2022-02-15 10:56:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:19,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:20,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:20,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845979677] [2022-02-15 10:56:20,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845979677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:20,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:20,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:20,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950151750] [2022-02-15 10:56:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:20,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:20,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:20,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:20,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:20,408 INFO L87 Difference]: Start difference. First operand 133036 states and 409411 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:29,893 INFO L93 Difference]: Finished difference Result 167485 states and 514985 transitions. [2022-02-15 10:56:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-02-15 10:56:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:56:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:30,369 INFO L225 Difference]: With dead ends: 167485 [2022-02-15 10:56:30,370 INFO L226 Difference]: Without dead ends: 167485 [2022-02-15 10:56:30,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1797, Invalid=5009, Unknown=0, NotChecked=0, Total=6806 [2022-02-15 10:56:30,371 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 3590 mSDsluCounter, 12746 mSDsCounter, 0 mSdLazyCounter, 4580 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 13951 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 4580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:30,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3590 Valid, 13951 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 4580 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 10:56:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167485 states. [2022-02-15 10:56:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167485 to 133069. [2022-02-15 10:56:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133069 states, 133065 states have (on average 3.077526021117499) internal successors, (409511), 133068 states have internal predecessors, (409511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133069 states to 133069 states and 409511 transitions. [2022-02-15 10:56:34,111 INFO L78 Accepts]: Start accepts. Automaton has 133069 states and 409511 transitions. Word has length 114 [2022-02-15 10:56:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:34,111 INFO L470 AbstractCegarLoop]: Abstraction has 133069 states and 409511 transitions. [2022-02-15 10:56:34,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 133069 states and 409511 transitions. [2022-02-15 10:56:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:56:34,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:34,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:56:34,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 10:56:34,222 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:56:34,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2145687926, now seen corresponding path program 4 times [2022-02-15 10:56:34,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:34,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154957893] [2022-02-15 10:56:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:34,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:35,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:35,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154957893] [2022-02-15 10:56:35,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154957893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:35,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:35,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:35,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65333530] [2022-02-15 10:56:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:35,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:35,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:35,123 INFO L87 Difference]: Start difference. First operand 133069 states and 409511 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:56:44,589 INFO L93 Difference]: Finished difference Result 166624 states and 512374 transitions. [2022-02-15 10:56:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-15 10:56:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:56:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:56:45,476 INFO L225 Difference]: With dead ends: 166624 [2022-02-15 10:56:45,476 INFO L226 Difference]: Without dead ends: 166624 [2022-02-15 10:56:45,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1921, Invalid=5389, Unknown=0, NotChecked=0, Total=7310 [2022-02-15 10:56:45,478 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 3295 mSDsluCounter, 14169 mSDsCounter, 0 mSdLazyCounter, 5069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 15435 SdHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 5069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 10:56:45,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3295 Valid, 15435 Invalid, 5145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 5069 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 10:56:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166624 states. [2022-02-15 10:56:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166624 to 133267. [2022-02-15 10:56:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133267 states, 133263 states have (on average 3.0776509608818654) internal successors, (410137), 133266 states have internal predecessors, (410137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133267 states to 133267 states and 410137 transitions. [2022-02-15 10:56:49,421 INFO L78 Accepts]: Start accepts. Automaton has 133267 states and 410137 transitions. Word has length 114 [2022-02-15 10:56:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:56:49,421 INFO L470 AbstractCegarLoop]: Abstraction has 133267 states and 410137 transitions. [2022-02-15 10:56:49,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:56:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 133267 states and 410137 transitions. [2022-02-15 10:56:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:56:49,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:56:49,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:56:49,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 10:56:49,534 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:56:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:56:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash 793775866, now seen corresponding path program 5 times [2022-02-15 10:56:49,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:56:49,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370854699] [2022-02-15 10:56:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:56:49,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:56:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:56:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:56:50,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:56:50,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370854699] [2022-02-15 10:56:50,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370854699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:56:50,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:56:50,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:56:50,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041036818] [2022-02-15 10:56:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:56:50,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:56:50,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:56:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:56:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:56:50,182 INFO L87 Difference]: Start difference. First operand 133267 states and 410137 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:00,650 INFO L93 Difference]: Finished difference Result 165733 states and 509648 transitions. [2022-02-15 10:57:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-02-15 10:57:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:57:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:01,089 INFO L225 Difference]: With dead ends: 165733 [2022-02-15 10:57:01,089 INFO L226 Difference]: Without dead ends: 165733 [2022-02-15 10:57:01,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2184, Invalid=6188, Unknown=0, NotChecked=0, Total=8372 [2022-02-15 10:57:01,091 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 3446 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 4949 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 15449 SdHoareTripleChecker+Invalid, 5035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:01,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3446 Valid, 15449 Invalid, 5035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4949 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 10:57:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165733 states. [2022-02-15 10:57:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165733 to 133630. [2022-02-15 10:57:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133630 states, 133626 states have (on average 3.0777692963944143) internal successors, (411270), 133629 states have internal predecessors, (411270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133630 states to 133630 states and 411270 transitions. [2022-02-15 10:57:04,823 INFO L78 Accepts]: Start accepts. Automaton has 133630 states and 411270 transitions. Word has length 114 [2022-02-15 10:57:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:04,823 INFO L470 AbstractCegarLoop]: Abstraction has 133630 states and 411270 transitions. [2022-02-15 10:57:04,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 133630 states and 411270 transitions. [2022-02-15 10:57:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:57:04,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:04,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:57:04,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 10:57:04,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:57:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -767686718, now seen corresponding path program 6 times [2022-02-15 10:57:04,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:04,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056112988] [2022-02-15 10:57:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:04,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:05,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:05,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056112988] [2022-02-15 10:57:05,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056112988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:05,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:05,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:05,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267795836] [2022-02-15 10:57:05,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:05,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:05,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:05,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:05,865 INFO L87 Difference]: Start difference. First operand 133630 states and 411270 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:17,338 INFO L93 Difference]: Finished difference Result 164875 states and 506916 transitions. [2022-02-15 10:57:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-02-15 10:57:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:57:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:17,791 INFO L225 Difference]: With dead ends: 164875 [2022-02-15 10:57:17,791 INFO L226 Difference]: Without dead ends: 164875 [2022-02-15 10:57:17,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2492, Invalid=7014, Unknown=0, NotChecked=0, Total=9506 [2022-02-15 10:57:17,793 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 3877 mSDsluCounter, 15984 mSDsCounter, 0 mSdLazyCounter, 5724 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 17480 SdHoareTripleChecker+Invalid, 5827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:17,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3877 Valid, 17480 Invalid, 5827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5724 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 10:57:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164875 states. [2022-02-15 10:57:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164875 to 133663. [2022-02-15 10:57:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133663 states, 133659 states have (on average 3.0777575771178896) internal successors, (411370), 133662 states have internal predecessors, (411370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133663 states to 133663 states and 411370 transitions. [2022-02-15 10:57:22,046 INFO L78 Accepts]: Start accepts. Automaton has 133663 states and 411370 transitions. Word has length 114 [2022-02-15 10:57:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:22,047 INFO L470 AbstractCegarLoop]: Abstraction has 133663 states and 411370 transitions. [2022-02-15 10:57:22,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 133663 states and 411370 transitions. [2022-02-15 10:57:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:57:22,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:22,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:57:22,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 10:57:22,167 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:57:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1979149546, now seen corresponding path program 7 times [2022-02-15 10:57:22,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:22,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285318923] [2022-02-15 10:57:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:22,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:22,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:22,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285318923] [2022-02-15 10:57:22,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285318923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:22,887 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:22,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:57:22,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533277255] [2022-02-15 10:57:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:22,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:57:22,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:57:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:57:22,888 INFO L87 Difference]: Start difference. First operand 133663 states and 411370 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:33,767 INFO L93 Difference]: Finished difference Result 163753 states and 503417 transitions. [2022-02-15 10:57:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 10:57:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:57:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:34,468 INFO L225 Difference]: With dead ends: 163753 [2022-02-15 10:57:34,468 INFO L226 Difference]: Without dead ends: 163753 [2022-02-15 10:57:34,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2300, Invalid=5532, Unknown=0, NotChecked=0, Total=7832 [2022-02-15 10:57:34,470 INFO L933 BasicCegarLoop]: 1500 mSDtfsCounter, 2666 mSDsluCounter, 12223 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 13723 SdHoareTripleChecker+Invalid, 4574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:34,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2666 Valid, 13723 Invalid, 4574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 10:57:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163753 states. [2022-02-15 10:57:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163753 to 142999. [2022-02-15 10:57:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142999 states, 142995 states have (on average 3.0793943844190355) internal successors, (440338), 142998 states have internal predecessors, (440338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142999 states to 142999 states and 440338 transitions. [2022-02-15 10:57:38,564 INFO L78 Accepts]: Start accepts. Automaton has 142999 states and 440338 transitions. Word has length 114 [2022-02-15 10:57:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:38,564 INFO L470 AbstractCegarLoop]: Abstraction has 142999 states and 440338 transitions. [2022-02-15 10:57:38,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 142999 states and 440338 transitions. [2022-02-15 10:57:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:57:38,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:38,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:57:38,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 10:57:38,705 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:57:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -386091310, now seen corresponding path program 8 times [2022-02-15 10:57:38,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:38,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59906517] [2022-02-15 10:57:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:38,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:39,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:39,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59906517] [2022-02-15 10:57:39,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59906517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:39,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:39,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:39,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777452379] [2022-02-15 10:57:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:39,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:39,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:39,348 INFO L87 Difference]: Start difference. First operand 142999 states and 440338 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:57:46,784 INFO L93 Difference]: Finished difference Result 187159 states and 575304 transitions. [2022-02-15 10:57:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-15 10:57:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:57:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:57:47,383 INFO L225 Difference]: With dead ends: 187159 [2022-02-15 10:57:47,383 INFO L226 Difference]: Without dead ends: 187159 [2022-02-15 10:57:47,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-15 10:57:47,384 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3762 mSDsluCounter, 8850 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3762 SdHoareTripleChecker+Valid, 9985 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:57:47,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3762 Valid, 9985 Invalid, 3131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-15 10:57:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187159 states. [2022-02-15 10:57:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187159 to 144220. [2022-02-15 10:57:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144220 states, 144216 states have (on average 3.079387862650469) internal successors, (444097), 144219 states have internal predecessors, (444097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144220 states to 144220 states and 444097 transitions. [2022-02-15 10:57:51,616 INFO L78 Accepts]: Start accepts. Automaton has 144220 states and 444097 transitions. Word has length 114 [2022-02-15 10:57:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:57:51,616 INFO L470 AbstractCegarLoop]: Abstraction has 144220 states and 444097 transitions. [2022-02-15 10:57:51,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:57:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 144220 states and 444097 transitions. [2022-02-15 10:57:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:57:51,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:57:51,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:57:51,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 10:57:51,746 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:57:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:57:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1049880080, now seen corresponding path program 9 times [2022-02-15 10:57:51,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:57:51,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348134508] [2022-02-15 10:57:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:57:51,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:57:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:57:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:57:52,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:57:52,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348134508] [2022-02-15 10:57:52,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348134508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:57:52,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:57:52,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:57:52,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416562709] [2022-02-15 10:57:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:57:52,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:57:52,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:57:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:57:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:57:52,755 INFO L87 Difference]: Start difference. First operand 144220 states and 444097 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:01,098 INFO L93 Difference]: Finished difference Result 197656 states and 607643 transitions. [2022-02-15 10:58:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-15 10:58:01,098 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:58:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:01,725 INFO L225 Difference]: With dead ends: 197656 [2022-02-15 10:58:01,726 INFO L226 Difference]: Without dead ends: 197656 [2022-02-15 10:58:01,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-02-15 10:58:01,727 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3383 mSDsluCounter, 12520 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 13716 SdHoareTripleChecker+Invalid, 4549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:01,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3383 Valid, 13716 Invalid, 4549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 10:58:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197656 states. [2022-02-15 10:58:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197656 to 144253. [2022-02-15 10:58:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144253 states, 144249 states have (on average 3.079376633460197) internal successors, (444197), 144252 states have internal predecessors, (444197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144253 states to 144253 states and 444197 transitions. [2022-02-15 10:58:06,406 INFO L78 Accepts]: Start accepts. Automaton has 144253 states and 444197 transitions. Word has length 114 [2022-02-15 10:58:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:06,407 INFO L470 AbstractCegarLoop]: Abstraction has 144253 states and 444197 transitions. [2022-02-15 10:58:06,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 144253 states and 444197 transitions. [2022-02-15 10:58:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:58:06,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:06,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:58:06,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 10:58:06,566 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:58:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash 974615476, now seen corresponding path program 10 times [2022-02-15 10:58:06,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:06,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908551886] [2022-02-15 10:58:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:06,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:07,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:07,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908551886] [2022-02-15 10:58:07,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908551886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:07,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:07,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:58:07,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678770723] [2022-02-15 10:58:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:07,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:58:07,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:07,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:58:07,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:58:07,474 INFO L87 Difference]: Start difference. First operand 144253 states and 444197 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:16,999 INFO L93 Difference]: Finished difference Result 196795 states and 605032 transitions. [2022-02-15 10:58:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-15 10:58:17,000 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:58:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:17,695 INFO L225 Difference]: With dead ends: 196795 [2022-02-15 10:58:17,695 INFO L226 Difference]: Without dead ends: 196795 [2022-02-15 10:58:17,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1705, Invalid=4775, Unknown=0, NotChecked=0, Total=6480 [2022-02-15 10:58:17,696 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3096 mSDsluCounter, 13880 mSDsCounter, 0 mSdLazyCounter, 4952 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 15137 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:17,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3096 Valid, 15137 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4952 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 10:58:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196795 states. [2022-02-15 10:58:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196795 to 144451. [2022-02-15 10:58:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144451 states, 144447 states have (on average 3.0794893628805027) internal successors, (444823), 144450 states have internal predecessors, (444823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144451 states to 144451 states and 444823 transitions. [2022-02-15 10:58:21,978 INFO L78 Accepts]: Start accepts. Automaton has 144451 states and 444823 transitions. Word has length 114 [2022-02-15 10:58:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:21,978 INFO L470 AbstractCegarLoop]: Abstraction has 144451 states and 444823 transitions. [2022-02-15 10:58:21,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 144451 states and 444823 transitions. [2022-02-15 10:58:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:58:22,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:58:22,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 10:58:22,502 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:58:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash -380888028, now seen corresponding path program 11 times [2022-02-15 10:58:22,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:22,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438059451] [2022-02-15 10:58:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:22,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:23,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:23,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438059451] [2022-02-15 10:58:23,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438059451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:23,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:23,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-15 10:58:23,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784362818] [2022-02-15 10:58:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:23,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-15 10:58:23,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-15 10:58:23,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2022-02-15 10:58:23,335 INFO L87 Difference]: Start difference. First operand 144451 states and 444823 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:37,287 INFO L93 Difference]: Finished difference Result 194812 states and 598988 transitions. [2022-02-15 10:58:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-02-15 10:58:37,288 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:58:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:38,129 INFO L225 Difference]: With dead ends: 194812 [2022-02-15 10:58:38,129 INFO L226 Difference]: Without dead ends: 194812 [2022-02-15 10:58:38,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2647, Invalid=7453, Unknown=0, NotChecked=0, Total=10100 [2022-02-15 10:58:38,131 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 3396 mSDsluCounter, 17753 mSDsCounter, 0 mSdLazyCounter, 6360 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 19420 SdHoareTripleChecker+Invalid, 6439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 6360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:38,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3396 Valid, 19420 Invalid, 6439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 6360 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-15 10:58:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194812 states. [2022-02-15 10:58:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194812 to 145802. [2022-02-15 10:58:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145802 states, 145798 states have (on average 3.0792191936789255) internal successors, (448944), 145801 states have internal predecessors, (448944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145802 states to 145802 states and 448944 transitions. [2022-02-15 10:58:42,508 INFO L78 Accepts]: Start accepts. Automaton has 145802 states and 448944 transitions. Word has length 114 [2022-02-15 10:58:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:42,508 INFO L470 AbstractCegarLoop]: Abstraction has 145802 states and 448944 transitions. [2022-02-15 10:58:42,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 145802 states and 448944 transitions. [2022-02-15 10:58:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:58:42,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:58:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:58:42,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 10:58:42,634 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:58:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:58:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1942350612, now seen corresponding path program 12 times [2022-02-15 10:58:42,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:58:42,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063732171] [2022-02-15 10:58:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:58:42,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:58:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:58:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:58:43,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:58:43,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063732171] [2022-02-15 10:58:43,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063732171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:58:43,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:58:43,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:58:43,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000477697] [2022-02-15 10:58:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:58:43,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:58:43,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:58:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:58:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:58:43,237 INFO L87 Difference]: Start difference. First operand 145802 states and 448944 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:58:54,351 INFO L93 Difference]: Finished difference Result 193954 states and 596256 transitions. [2022-02-15 10:58:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-15 10:58:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:58:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:58:55,174 INFO L225 Difference]: With dead ends: 193954 [2022-02-15 10:58:55,174 INFO L226 Difference]: Without dead ends: 193954 [2022-02-15 10:58:55,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-02-15 10:58:55,175 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 2996 mSDsluCounter, 16115 mSDsCounter, 0 mSdLazyCounter, 5755 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 17602 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 5755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 10:58:55,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2996 Valid, 17602 Invalid, 5830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 5755 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 10:58:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193954 states. [2022-02-15 10:58:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193954 to 145835. [2022-02-15 10:58:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145835 states, 145831 states have (on average 3.079208124472849) internal successors, (449044), 145834 states have internal predecessors, (449044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145835 states to 145835 states and 449044 transitions. [2022-02-15 10:58:59,859 INFO L78 Accepts]: Start accepts. Automaton has 145835 states and 449044 transitions. Word has length 114 [2022-02-15 10:58:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:58:59,859 INFO L470 AbstractCegarLoop]: Abstraction has 145835 states and 449044 transitions. [2022-02-15 10:58:59,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:58:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 145835 states and 449044 transitions. [2022-02-15 10:59:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:59:00,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:00,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:59:00,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 10:59:00,062 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:59:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 804485652, now seen corresponding path program 13 times [2022-02-15 10:59:00,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:00,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775217592] [2022-02-15 10:59:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:00,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:00,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:00,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775217592] [2022-02-15 10:59:00,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775217592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:00,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:00,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:59:00,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249439065] [2022-02-15 10:59:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:00,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:59:00,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:59:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:59:00,944 INFO L87 Difference]: Start difference. First operand 145835 states and 449044 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:12,166 INFO L93 Difference]: Finished difference Result 196747 states and 604701 transitions. [2022-02-15 10:59:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-15 10:59:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:59:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:13,004 INFO L225 Difference]: With dead ends: 196747 [2022-02-15 10:59:13,004 INFO L226 Difference]: Without dead ends: 196747 [2022-02-15 10:59:13,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2358, Invalid=5652, Unknown=0, NotChecked=0, Total=8010 [2022-02-15 10:59:13,005 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 3242 mSDsluCounter, 12047 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3242 SdHoareTripleChecker+Valid, 13539 SdHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:13,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3242 Valid, 13539 Invalid, 4284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-15 10:59:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196747 states. [2022-02-15 10:59:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196747 to 155155. [2022-02-15 10:59:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155155 states, 155151 states have (on average 3.0788070976016915) internal successors, (477680), 155154 states have internal predecessors, (477680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155155 states to 155155 states and 477680 transitions. [2022-02-15 10:59:17,461 INFO L78 Accepts]: Start accepts. Automaton has 155155 states and 477680 transitions. Word has length 114 [2022-02-15 10:59:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:17,461 INFO L470 AbstractCegarLoop]: Abstraction has 155155 states and 477680 transitions. [2022-02-15 10:59:17,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 155155 states and 477680 transitions. [2022-02-15 10:59:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:59:17,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:17,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:59:17,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 10:59:17,626 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:59:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1129835852, now seen corresponding path program 14 times [2022-02-15 10:59:17,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:17,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511829778] [2022-02-15 10:59:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:17,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:18,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-02-15 10:59:18,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:18,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511829778] [2022-02-15 10:59:18,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511829778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:18,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:18,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:59:18,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889442053] [2022-02-15 10:59:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:18,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:59:18,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:59:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:59:18,592 INFO L87 Difference]: Start difference. First operand 155155 states and 477680 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:26,100 INFO L93 Difference]: Finished difference Result 198292 states and 609546 transitions. [2022-02-15 10:59:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-15 10:59:26,101 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:59:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:26,951 INFO L225 Difference]: With dead ends: 198292 [2022-02-15 10:59:26,952 INFO L226 Difference]: Without dead ends: 198292 [2022-02-15 10:59:26,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-02-15 10:59:26,953 INFO L933 BasicCegarLoop]: 1086 mSDtfsCounter, 3033 mSDsluCounter, 10560 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 11646 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:26,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3033 Valid, 11646 Invalid, 3778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 10:59:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198292 states. [2022-02-15 10:59:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198292 to 156343. [2022-02-15 10:59:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156343 states, 156339 states have (on average 3.0788159064596807) internal successors, (481339), 156342 states have internal predecessors, (481339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156343 states to 156343 states and 481339 transitions. [2022-02-15 10:59:31,315 INFO L78 Accepts]: Start accepts. Automaton has 156343 states and 481339 transitions. Word has length 114 [2022-02-15 10:59:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:31,316 INFO L470 AbstractCegarLoop]: Abstraction has 156343 states and 481339 transitions. [2022-02-15 10:59:31,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 156343 states and 481339 transitions. [2022-02-15 10:59:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:59:31,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:31,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:59:31,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 10:59:31,464 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:59:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 894659704, now seen corresponding path program 15 times [2022-02-15 10:59:31,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:31,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107021439] [2022-02-15 10:59:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:31,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:32,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:32,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107021439] [2022-02-15 10:59:32,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107021439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:32,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:32,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:59:32,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739106280] [2022-02-15 10:59:32,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:32,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:59:32,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:32,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:59:32,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:59:32,408 INFO L87 Difference]: Start difference. First operand 156343 states and 481339 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:40,719 INFO L93 Difference]: Finished difference Result 207565 states and 638174 transitions. [2022-02-15 10:59:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-15 10:59:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:59:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:41,361 INFO L225 Difference]: With dead ends: 207565 [2022-02-15 10:59:41,362 INFO L226 Difference]: Without dead ends: 207565 [2022-02-15 10:59:41,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1492, Invalid=4208, Unknown=0, NotChecked=0, Total=5700 [2022-02-15 10:59:41,362 INFO L933 BasicCegarLoop]: 1147 mSDtfsCounter, 3791 mSDsluCounter, 11761 mSDsCounter, 0 mSdLazyCounter, 4215 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 12908 SdHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:41,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3791 Valid, 12908 Invalid, 4300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4215 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 10:59:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207565 states. [2022-02-15 10:59:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207565 to 156541. [2022-02-15 10:59:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156541 states, 156537 states have (on average 3.0789206385710726) internal successors, (481965), 156540 states have internal predecessors, (481965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156541 states to 156541 states and 481965 transitions. [2022-02-15 10:59:46,211 INFO L78 Accepts]: Start accepts. Automaton has 156541 states and 481965 transitions. Word has length 114 [2022-02-15 10:59:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:59:46,212 INFO L470 AbstractCegarLoop]: Abstraction has 156541 states and 481965 transitions. [2022-02-15 10:59:46,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 156541 states and 481965 transitions. [2022-02-15 10:59:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 10:59:46,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:59:46,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:59:46,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 10:59:46,750 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 10:59:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:59:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -460843800, now seen corresponding path program 16 times [2022-02-15 10:59:46,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:59:46,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348165821] [2022-02-15 10:59:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:59:46,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:59:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:59:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:59:47,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:59:47,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348165821] [2022-02-15 10:59:47,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348165821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:59:47,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:59:47,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 10:59:47,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749393178] [2022-02-15 10:59:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:59:47,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 10:59:47,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:59:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 10:59:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-02-15 10:59:47,357 INFO L87 Difference]: Start difference. First operand 156541 states and 481965 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:59:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:59:56,315 INFO L93 Difference]: Finished difference Result 206674 states and 635448 transitions. [2022-02-15 10:59:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-02-15 10:59:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 10:59:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:59:57,221 INFO L225 Difference]: With dead ends: 206674 [2022-02-15 10:59:57,222 INFO L226 Difference]: Without dead ends: 206674 [2022-02-15 10:59:57,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-02-15 10:59:57,222 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 3148 mSDsluCounter, 11723 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3148 SdHoareTripleChecker+Valid, 12994 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:59:57,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3148 Valid, 12994 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 10:59:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206674 states. [2022-02-15 11:00:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206674 to 156904. [2022-02-15 11:00:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156904 states, 156900 states have (on average 3.079018483110261) internal successors, (483098), 156903 states have internal predecessors, (483098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156904 states to 156904 states and 483098 transitions. [2022-02-15 11:00:01,599 INFO L78 Accepts]: Start accepts. Automaton has 156904 states and 483098 transitions. Word has length 114 [2022-02-15 11:00:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:01,599 INFO L470 AbstractCegarLoop]: Abstraction has 156904 states and 483098 transitions. [2022-02-15 11:00:01,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 156904 states and 483098 transitions. [2022-02-15 11:00:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:00:01,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:01,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:00:01,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 11:00:01,769 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:00:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2022306384, now seen corresponding path program 17 times [2022-02-15 11:00:01,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:01,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374024785] [2022-02-15 11:00:01,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:01,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:02,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:02,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374024785] [2022-02-15 11:00:02,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374024785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:02,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:02,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:00:02,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039135442] [2022-02-15 11:00:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:02,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:00:02,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:00:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:00:02,742 INFO L87 Difference]: Start difference. First operand 156904 states and 483098 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:12,918 INFO L93 Difference]: Finished difference Result 205816 states and 632716 transitions. [2022-02-15 11:00:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-15 11:00:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:00:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:13,624 INFO L225 Difference]: With dead ends: 205816 [2022-02-15 11:00:13,624 INFO L226 Difference]: Without dead ends: 205816 [2022-02-15 11:00:13,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2027, Invalid=5629, Unknown=0, NotChecked=0, Total=7656 [2022-02-15 11:00:13,626 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2950 mSDsluCounter, 12055 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 13432 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:13,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 13432 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 11:00:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205816 states. [2022-02-15 11:00:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205816 to 156937. [2022-02-15 11:00:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156937 states, 156933 states have (on average 3.079008239184875) internal successors, (483198), 156936 states have internal predecessors, (483198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156937 states to 156937 states and 483198 transitions. [2022-02-15 11:00:18,206 INFO L78 Accepts]: Start accepts. Automaton has 156937 states and 483198 transitions. Word has length 114 [2022-02-15 11:00:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:18,207 INFO L470 AbstractCegarLoop]: Abstraction has 156937 states and 483198 transitions. [2022-02-15 11:00:18,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 156937 states and 483198 transitions. [2022-02-15 11:00:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:00:18,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:18,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:00:18,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 11:00:18,760 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:00:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash 724529880, now seen corresponding path program 18 times [2022-02-15 11:00:18,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:18,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706448117] [2022-02-15 11:00:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:18,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:19,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:19,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706448117] [2022-02-15 11:00:19,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706448117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:19,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:19,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:00:19,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030749999] [2022-02-15 11:00:19,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:19,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:00:19,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:00:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:00:19,481 INFO L87 Difference]: Start difference. First operand 156937 states and 483198 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:30,365 INFO L93 Difference]: Finished difference Result 200170 states and 615675 transitions. [2022-02-15 11:00:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-02-15 11:00:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:00:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:31,352 INFO L225 Difference]: With dead ends: 200170 [2022-02-15 11:00:31,352 INFO L226 Difference]: Without dead ends: 200170 [2022-02-15 11:00:31,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2414, Invalid=5776, Unknown=0, NotChecked=0, Total=8190 [2022-02-15 11:00:31,354 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 3090 mSDsluCounter, 10849 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 12379 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:31,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3090 Valid, 12379 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 11:00:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200170 states. [2022-02-15 11:00:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200170 to 144653. [2022-02-15 11:00:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144653 states, 144649 states have (on average 3.0793023111117255) internal successors, (445418), 144652 states have internal predecessors, (445418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144653 states to 144653 states and 445418 transitions. [2022-02-15 11:00:36,002 INFO L78 Accepts]: Start accepts. Automaton has 144653 states and 445418 transitions. Word has length 114 [2022-02-15 11:00:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:36,003 INFO L470 AbstractCegarLoop]: Abstraction has 144653 states and 445418 transitions. [2022-02-15 11:00:36,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 144653 states and 445418 transitions. [2022-02-15 11:00:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:00:36,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:36,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:00:36,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 11:00:36,506 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:00:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1771845934, now seen corresponding path program 19 times [2022-02-15 11:00:36,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:36,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685041156] [2022-02-15 11:00:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:36,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:00:37,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:37,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685041156] [2022-02-15 11:00:37,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685041156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:37,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:37,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-02-15 11:00:37,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575368908] [2022-02-15 11:00:37,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:37,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-15 11:00:37,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-15 11:00:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2022-02-15 11:00:37,219 INFO L87 Difference]: Start difference. First operand 144653 states and 445418 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:45,936 INFO L93 Difference]: Finished difference Result 186533 states and 573473 transitions. [2022-02-15 11:00:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 11:00:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:00:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:46,755 INFO L225 Difference]: With dead ends: 186533 [2022-02-15 11:00:46,755 INFO L226 Difference]: Without dead ends: 186533 [2022-02-15 11:00:46,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1631, Invalid=4531, Unknown=0, NotChecked=0, Total=6162 [2022-02-15 11:00:46,756 INFO L933 BasicCegarLoop]: 1201 mSDtfsCounter, 3621 mSDsluCounter, 9321 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:46,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3621 Valid, 10522 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 11:00:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186533 states. [2022-02-15 11:00:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186533 to 145860. [2022-02-15 11:00:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145860 states, 145856 states have (on average 3.0791396994295743) internal successors, (449111), 145859 states have internal predecessors, (449111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145860 states to 145860 states and 449111 transitions. [2022-02-15 11:00:51,195 INFO L78 Accepts]: Start accepts. Automaton has 145860 states and 449111 transitions. Word has length 114 [2022-02-15 11:00:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:00:51,196 INFO L470 AbstractCegarLoop]: Abstraction has 145860 states and 449111 transitions. [2022-02-15 11:00:51,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 145860 states and 449111 transitions. [2022-02-15 11:00:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:00:51,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:00:51,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:00:51,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 11:00:51,342 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:00:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:00:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1466241108, now seen corresponding path program 20 times [2022-02-15 11:00:51,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:00:51,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875734165] [2022-02-15 11:00:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:00:51,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:00:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:00: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-02-15 11:00:51,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:00:51,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875734165] [2022-02-15 11:00:51,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875734165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:00:51,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:00:51,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:00:51,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854350430] [2022-02-15 11:00:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:00:51,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:00:51,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:00:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:00:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:00:51,930 INFO L87 Difference]: Start difference. First operand 145860 states and 449111 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:00:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:00:59,251 INFO L93 Difference]: Finished difference Result 186750 states and 574166 transitions. [2022-02-15 11:00:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 11:00:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:00:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:00:59,804 INFO L225 Difference]: With dead ends: 186750 [2022-02-15 11:00:59,804 INFO L226 Difference]: Without dead ends: 186750 [2022-02-15 11:00:59,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 11:00:59,807 INFO L933 BasicCegarLoop]: 1037 mSDtfsCounter, 2880 mSDsluCounter, 10987 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 12024 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:00:59,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2880 Valid, 12024 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 11:01:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186750 states. [2022-02-15 11:01:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186750 to 148196. [2022-02-15 11:01:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148196 states, 148192 states have (on average 3.081009771107752) internal successors, (456581), 148195 states have internal predecessors, (456581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148196 states to 148196 states and 456581 transitions. [2022-02-15 11:01:04,345 INFO L78 Accepts]: Start accepts. Automaton has 148196 states and 456581 transitions. Word has length 114 [2022-02-15 11:01:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:04,345 INFO L470 AbstractCegarLoop]: Abstraction has 148196 states and 456581 transitions. [2022-02-15 11:01:04,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 148196 states and 456581 transitions. [2022-02-15 11:01:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:01:04,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:04,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:01:04,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 11:01:04,496 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:01:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1167617858, now seen corresponding path program 21 times [2022-02-15 11:01:04,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:04,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631082691] [2022-02-15 11:01:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:04,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:05,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:05,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631082691] [2022-02-15 11:01:05,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631082691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:05,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:05,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:01:05,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393291927] [2022-02-15 11:01:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:05,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:01:05,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:01:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:01:05,087 INFO L87 Difference]: Start difference. First operand 148196 states and 456581 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:13,588 INFO L93 Difference]: Finished difference Result 191462 states and 588908 transitions. [2022-02-15 11:01:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 11:01:13,589 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:01:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:14,442 INFO L225 Difference]: With dead ends: 191462 [2022-02-15 11:01:14,442 INFO L226 Difference]: Without dead ends: 191462 [2022-02-15 11:01:14,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-02-15 11:01:14,443 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 3215 mSDsluCounter, 12491 mSDsCounter, 0 mSdLazyCounter, 4444 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3215 SdHoareTripleChecker+Valid, 13652 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:14,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3215 Valid, 13652 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4444 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 11:01:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191462 states. [2022-02-15 11:01:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191462 to 148559. [2022-02-15 11:01:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148559 states, 148555 states have (on average 3.0811080071354042) internal successors, (457714), 148558 states have internal predecessors, (457714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148559 states to 148559 states and 457714 transitions. [2022-02-15 11:01:19,677 INFO L78 Accepts]: Start accepts. Automaton has 148559 states and 457714 transitions. Word has length 114 [2022-02-15 11:01:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:19,677 INFO L470 AbstractCegarLoop]: Abstraction has 148559 states and 457714 transitions. [2022-02-15 11:01:19,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 148559 states and 457714 transitions. [2022-02-15 11:01:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:01:19,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:19,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:01:19,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 11:01:19,821 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:01:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -393844726, now seen corresponding path program 22 times [2022-02-15 11:01:19,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:19,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974723477] [2022-02-15 11:01:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:19,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:20,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:20,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974723477] [2022-02-15 11:01:20,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974723477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:20,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:20,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:01:20,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328773237] [2022-02-15 11:01:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:20,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:01:20,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:01:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:01:20,466 INFO L87 Difference]: Start difference. First operand 148559 states and 457714 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:30,206 INFO L93 Difference]: Finished difference Result 190604 states and 586176 transitions. [2022-02-15 11:01:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-02-15 11:01:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:01:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:30,725 INFO L225 Difference]: With dead ends: 190604 [2022-02-15 11:01:30,725 INFO L226 Difference]: Without dead ends: 190604 [2022-02-15 11:01:30,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-02-15 11:01:30,726 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 3563 mSDsluCounter, 11384 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3563 SdHoareTripleChecker+Valid, 12651 SdHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:30,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3563 Valid, 12651 Invalid, 4159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 11:01:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190604 states. [2022-02-15 11:01:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190604 to 148592. [2022-02-15 11:01:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148592 states, 148588 states have (on average 3.081096723826958) internal successors, (457814), 148591 states have internal predecessors, (457814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148592 states to 148592 states and 457814 transitions. [2022-02-15 11:01:34,911 INFO L78 Accepts]: Start accepts. Automaton has 148592 states and 457814 transitions. Word has length 114 [2022-02-15 11:01:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:34,911 INFO L470 AbstractCegarLoop]: Abstraction has 148592 states and 457814 transitions. [2022-02-15 11:01:34,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 148592 states and 457814 transitions. [2022-02-15 11:01:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:01:35,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:01:35,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 11:01:35,039 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:01:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1941975758, now seen corresponding path program 23 times [2022-02-15 11:01:35,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:35,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639372155] [2022-02-15 11:01:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:35,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:36,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:36,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639372155] [2022-02-15 11:01:36,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639372155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:36,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:36,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:01:36,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489814876] [2022-02-15 11:01:36,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:36,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:01:36,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:36,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:01:36,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:01:36,069 INFO L87 Difference]: Start difference. First operand 148592 states and 457814 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:47,301 INFO L93 Difference]: Finished difference Result 184232 states and 566935 transitions. [2022-02-15 11:01:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-15 11:01:47,302 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:01:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:47,832 INFO L225 Difference]: With dead ends: 184232 [2022-02-15 11:01:47,832 INFO L226 Difference]: Without dead ends: 184232 [2022-02-15 11:01:47,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2466, Invalid=5906, Unknown=0, NotChecked=0, Total=8372 [2022-02-15 11:01:47,833 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 2895 mSDsluCounter, 12414 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 13973 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:47,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2895 Valid, 13973 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-15 11:01:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184232 states. [2022-02-15 11:01:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184232 to 145429. [2022-02-15 11:01:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145429 states, 145425 states have (on average 3.079635550971291) internal successors, (447856), 145428 states have internal predecessors, (447856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145429 states to 145429 states and 447856 transitions. [2022-02-15 11:01:52,007 INFO L78 Accepts]: Start accepts. Automaton has 145429 states and 447856 transitions. Word has length 114 [2022-02-15 11:01:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:01:52,007 INFO L470 AbstractCegarLoop]: Abstraction has 145429 states and 447856 transitions. [2022-02-15 11:01:52,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 145429 states and 447856 transitions. [2022-02-15 11:01:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:01:52,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:01:52,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:01:52,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 11:01:52,146 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:01:52,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:01:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1860149644, now seen corresponding path program 24 times [2022-02-15 11:01:52,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:01:52,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32250877] [2022-02-15 11:01:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:01:52,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:01:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:01:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:01:53,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:01:53,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32250877] [2022-02-15 11:01:53,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32250877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:01:53,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:01:53,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 11:01:53,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28504961] [2022-02-15 11:01:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:01:53,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 11:01:53,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:01:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 11:01:53,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2022-02-15 11:01:53,046 INFO L87 Difference]: Start difference. First operand 145429 states and 447856 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:01:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:01:58,018 INFO L93 Difference]: Finished difference Result 182356 states and 561013 transitions. [2022-02-15 11:01:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-15 11:01:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:01:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:01:58,805 INFO L225 Difference]: With dead ends: 182356 [2022-02-15 11:01:58,805 INFO L226 Difference]: Without dead ends: 182356 [2022-02-15 11:01:58,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 11:01:58,806 INFO L933 BasicCegarLoop]: 838 mSDtfsCounter, 2452 mSDsluCounter, 8918 mSDsCounter, 0 mSdLazyCounter, 3158 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 9756 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:01:58,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2452 Valid, 9756 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3158 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-15 11:01:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182356 states. [2022-02-15 11:02:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182356 to 152161. [2022-02-15 11:02:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152161 states, 152157 states have (on average 3.081573637755739) internal successors, (468883), 152160 states have internal predecessors, (468883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152161 states to 152161 states and 468883 transitions. [2022-02-15 11:02:03,662 INFO L78 Accepts]: Start accepts. Automaton has 152161 states and 468883 transitions. Word has length 114 [2022-02-15 11:02:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:03,663 INFO L470 AbstractCegarLoop]: Abstraction has 152161 states and 468883 transitions. [2022-02-15 11:02:03,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 152161 states and 468883 transitions. [2022-02-15 11:02:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:02:03,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:03,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:02:03,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 11:02:03,882 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:02:03,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 873355068, now seen corresponding path program 25 times [2022-02-15 11:02:03,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:03,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743571095] [2022-02-15 11:02:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:03,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:04,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:04,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743571095] [2022-02-15 11:02:04,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743571095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:04,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:04,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:04,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597164489] [2022-02-15 11:02:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:04,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:04,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:04,736 INFO L87 Difference]: Start difference. First operand 152161 states and 468883 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:12,688 INFO L93 Difference]: Finished difference Result 189715 states and 583874 transitions. [2022-02-15 11:02:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-15 11:02:12,689 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:02:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:13,275 INFO L225 Difference]: With dead ends: 189715 [2022-02-15 11:02:13,275 INFO L226 Difference]: Without dead ends: 189715 [2022-02-15 11:02:13,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-02-15 11:02:13,276 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 3048 mSDsluCounter, 11728 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 12761 SdHoareTripleChecker+Invalid, 4352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:13,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 12761 Invalid, 4352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-15 11:02:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189715 states. [2022-02-15 11:02:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189715 to 152326. [2022-02-15 11:02:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152326 states, 152322 states have (on average 3.0815180998148657) internal successors, (469383), 152325 states have internal predecessors, (469383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152326 states to 152326 states and 469383 transitions. [2022-02-15 11:02:17,571 INFO L78 Accepts]: Start accepts. Automaton has 152326 states and 469383 transitions. Word has length 114 [2022-02-15 11:02:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:17,572 INFO L470 AbstractCegarLoop]: Abstraction has 152326 states and 469383 transitions. [2022-02-15 11:02:17,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 152326 states and 469383 transitions. [2022-02-15 11:02:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:02:18,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:18,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:02:18,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 11:02:18,124 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:02:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -674775964, now seen corresponding path program 26 times [2022-02-15 11:02:18,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:18,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729521995] [2022-02-15 11:02:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:18,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:18,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:18,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729521995] [2022-02-15 11:02:18,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729521995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:18,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:18,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:18,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377494092] [2022-02-15 11:02:18,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:18,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:18,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:18,911 INFO L87 Difference]: Start difference. First operand 152326 states and 469383 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:31,343 INFO L93 Difference]: Finished difference Result 177835 states and 547323 transitions. [2022-02-15 11:02:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-15 11:02:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:02:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:31,910 INFO L225 Difference]: With dead ends: 177835 [2022-02-15 11:02:31,911 INFO L226 Difference]: Without dead ends: 177835 [2022-02-15 11:02:31,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2581, Invalid=6349, Unknown=0, NotChecked=0, Total=8930 [2022-02-15 11:02:31,912 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3236 mSDsluCounter, 15515 mSDsCounter, 0 mSdLazyCounter, 5654 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3236 SdHoareTripleChecker+Valid, 17133 SdHoareTripleChecker+Invalid, 5757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:31,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3236 Valid, 17133 Invalid, 5757 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [103 Valid, 5654 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 11:02:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177835 states. [2022-02-15 11:02:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177835 to 146518. [2022-02-15 11:02:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146518 states, 146514 states have (on average 3.079944578675075) internal successors, (451255), 146517 states have internal predecessors, (451255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146518 states to 146518 states and 451255 transitions. [2022-02-15 11:02:36,019 INFO L78 Accepts]: Start accepts. Automaton has 146518 states and 451255 transitions. Word has length 114 [2022-02-15 11:02:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:36,019 INFO L470 AbstractCegarLoop]: Abstraction has 146518 states and 451255 transitions. [2022-02-15 11:02:36,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 146518 states and 451255 transitions. [2022-02-15 11:02:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:02:36,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:02:36,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 11:02:36,145 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:02:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -939404236, now seen corresponding path program 27 times [2022-02-15 11:02:36,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:36,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659819121] [2022-02-15 11:02:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:36,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:36,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:36,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659819121] [2022-02-15 11:02:36,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659819121] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:36,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:36,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:02:36,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149389296] [2022-02-15 11:02:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:36,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:02:36,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:02:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:02:36,711 INFO L87 Difference]: Start difference. First operand 146518 states and 451255 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:02:42,330 INFO L93 Difference]: Finished difference Result 175723 states and 540154 transitions. [2022-02-15 11:02:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-15 11:02:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:02:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:02:43,038 INFO L225 Difference]: With dead ends: 175723 [2022-02-15 11:02:43,039 INFO L226 Difference]: Without dead ends: 175723 [2022-02-15 11:02:43,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=874, Invalid=3032, Unknown=0, NotChecked=0, Total=3906 [2022-02-15 11:02:43,039 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 3052 mSDsluCounter, 11464 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 12282 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:02:43,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3052 Valid, 12282 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 11:02:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175723 states. [2022-02-15 11:02:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175723 to 147112. [2022-02-15 11:02:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147112 states, 147108 states have (on average 3.079744133561737) internal successors, (453055), 147111 states have internal predecessors, (453055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147112 states to 147112 states and 453055 transitions. [2022-02-15 11:02:47,620 INFO L78 Accepts]: Start accepts. Automaton has 147112 states and 453055 transitions. Word has length 114 [2022-02-15 11:02:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:02:47,620 INFO L470 AbstractCegarLoop]: Abstraction has 147112 states and 453055 transitions. [2022-02-15 11:02:47,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:02:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 147112 states and 453055 transitions. [2022-02-15 11:02:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:02:47,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:02:47,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:02:47,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 11:02:47,778 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:02:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:02:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1807432028, now seen corresponding path program 28 times [2022-02-15 11:02:47,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:02:47,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551351641] [2022-02-15 11:02:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:02:47,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:02:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:02:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:02:48,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:02:48,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551351641] [2022-02-15 11:02:48,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551351641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:02:48,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:02:48,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:02:48,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406822165] [2022-02-15 11:02:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:02:48,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:02:48,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:02:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:02:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:02:48,742 INFO L87 Difference]: Start difference. First operand 147112 states and 453055 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:01,589 INFO L93 Difference]: Finished difference Result 168364 states and 517567 transitions. [2022-02-15 11:03:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-02-15 11:03:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:03:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:02,128 INFO L225 Difference]: With dead ends: 168364 [2022-02-15 11:03:02,128 INFO L226 Difference]: Without dead ends: 168364 [2022-02-15 11:03:02,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2623, Invalid=6497, Unknown=0, NotChecked=0, Total=9120 [2022-02-15 11:03:02,129 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 3415 mSDsluCounter, 16771 mSDsCounter, 0 mSdLazyCounter, 6178 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3415 SdHoareTripleChecker+Valid, 18448 SdHoareTripleChecker+Invalid, 6280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 6178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:02,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3415 Valid, 18448 Invalid, 6280 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [102 Valid, 6178 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-15 11:03:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168364 states. [2022-02-15 11:03:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168364 to 145285. [2022-02-15 11:03:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145285 states, 145281 states have (on average 3.0796387690062708) internal successors, (447413), 145284 states have internal predecessors, (447413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145285 states to 145285 states and 447413 transitions. [2022-02-15 11:03:06,154 INFO L78 Accepts]: Start accepts. Automaton has 145285 states and 447413 transitions. Word has length 114 [2022-02-15 11:03:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:06,154 INFO L470 AbstractCegarLoop]: Abstraction has 145285 states and 447413 transitions. [2022-02-15 11:03:06,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 145285 states and 447413 transitions. [2022-02-15 11:03:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:03:06,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:06,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:03:06,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 11:03:06,284 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -825115224, now seen corresponding path program 29 times [2022-02-15 11:03:06,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:06,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668811306] [2022-02-15 11:03:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:06,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:07,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:07,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668811306] [2022-02-15 11:03:07,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668811306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:07,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:07,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:03:07,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184233456] [2022-02-15 11:03:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:07,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:03:07,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:07,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:03:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:03:07,162 INFO L87 Difference]: Start difference. First operand 145285 states and 447413 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:14,708 INFO L93 Difference]: Finished difference Result 216438 states and 665741 transitions. [2022-02-15 11:03:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-15 11:03:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:03:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:15,676 INFO L225 Difference]: With dead ends: 216438 [2022-02-15 11:03:15,676 INFO L226 Difference]: Without dead ends: 216438 [2022-02-15 11:03:15,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-02-15 11:03:15,677 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3244 mSDsluCounter, 10416 mSDsCounter, 0 mSdLazyCounter, 3764 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3244 SdHoareTripleChecker+Valid, 11551 SdHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:15,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3244 Valid, 11551 Invalid, 3826 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3764 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-15 11:03:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216438 states. [2022-02-15 11:03:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216438 to 146902. [2022-02-15 11:03:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146902 states, 146898 states have (on average 3.079497338289153) internal successors, (452372), 146901 states have internal predecessors, (452372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146902 states to 146902 states and 452372 transitions. [2022-02-15 11:03:20,122 INFO L78 Accepts]: Start accepts. Automaton has 146902 states and 452372 transitions. Word has length 114 [2022-02-15 11:03:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:20,123 INFO L470 AbstractCegarLoop]: Abstraction has 146902 states and 452372 transitions. [2022-02-15 11:03:20,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 146902 states and 452372 transitions. [2022-02-15 11:03:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:03:20,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:20,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:03:20,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 11:03:20,256 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1488903994, now seen corresponding path program 30 times [2022-02-15 11:03:20,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:20,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324409255] [2022-02-15 11:03:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:20,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:21,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:21,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324409255] [2022-02-15 11:03:21,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324409255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:21,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:21,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:03:21,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810544816] [2022-02-15 11:03:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:21,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:03:21,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:03:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:03:21,233 INFO L87 Difference]: Start difference. First operand 146902 states and 452372 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:30,437 INFO L93 Difference]: Finished difference Result 234522 states and 721482 transitions. [2022-02-15 11:03:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-15 11:03:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:03:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:31,264 INFO L225 Difference]: With dead ends: 234522 [2022-02-15 11:03:31,264 INFO L226 Difference]: Without dead ends: 234522 [2022-02-15 11:03:31,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-02-15 11:03:31,265 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3745 mSDsluCounter, 12178 mSDsCounter, 0 mSdLazyCounter, 4520 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3745 SdHoareTripleChecker+Valid, 13374 SdHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:31,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3745 Valid, 13374 Invalid, 4600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-15 11:03:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234522 states. [2022-02-15 11:03:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234522 to 146935. [2022-02-15 11:03:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146935 states, 146931 states have (on average 3.0794862894828183) internal successors, (452472), 146934 states have internal predecessors, (452472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146935 states to 146935 states and 452472 transitions. [2022-02-15 11:03:36,841 INFO L78 Accepts]: Start accepts. Automaton has 146935 states and 452472 transitions. Word has length 114 [2022-02-15 11:03:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:36,841 INFO L470 AbstractCegarLoop]: Abstraction has 146935 states and 452472 transitions. [2022-02-15 11:03:36,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146935 states and 452472 transitions. [2022-02-15 11:03:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:03:36,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:36,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:03:36,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 11:03:36,972 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 535591562, now seen corresponding path program 31 times [2022-02-15 11:03:36,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:36,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422139930] [2022-02-15 11:03:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:36,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:03:37,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:37,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422139930] [2022-02-15 11:03:37,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422139930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:37,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:37,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:03:37,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061980595] [2022-02-15 11:03:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:37,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:03:37,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:03:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:03:37,525 INFO L87 Difference]: Start difference. First operand 146935 states and 452472 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:03:46,734 INFO L93 Difference]: Finished difference Result 233067 states and 717071 transitions. [2022-02-15 11:03:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-15 11:03:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:03:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:03:47,547 INFO L225 Difference]: With dead ends: 233067 [2022-02-15 11:03:47,547 INFO L226 Difference]: Without dead ends: 233067 [2022-02-15 11:03:47,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-02-15 11:03:47,548 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3324 mSDsluCounter, 12798 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 14055 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:03:47,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3324 Valid, 14055 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-15 11:03:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233067 states. [2022-02-15 11:03:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233067 to 147133. [2022-02-15 11:03:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147133 states, 147129 states have (on average 3.0795968163992145) internal successors, (453098), 147132 states have internal predecessors, (453098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147133 states to 147133 states and 453098 transitions. [2022-02-15 11:03:52,577 INFO L78 Accepts]: Start accepts. Automaton has 147133 states and 453098 transitions. Word has length 114 [2022-02-15 11:03:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:03:52,577 INFO L470 AbstractCegarLoop]: Abstraction has 147133 states and 453098 transitions. [2022-02-15 11:03:52,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:03:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 147133 states and 453098 transitions. [2022-02-15 11:03:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:03:52,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:03:52,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:03:52,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 11:03:52,703 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:03:52,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:03:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash -819911942, now seen corresponding path program 32 times [2022-02-15 11:03:52,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:03:52,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393059481] [2022-02-15 11:03:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:03:52,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:03:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:03:53,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-02-15 11:03:53,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:03:53,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393059481] [2022-02-15 11:03:53,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393059481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:03:53,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:03:53,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 11:03:53,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816660959] [2022-02-15 11:03:53,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:03:53,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 11:03:53,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:03:53,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 11:03:53,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-02-15 11:03:53,218 INFO L87 Difference]: Start difference. First operand 147133 states and 453098 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:02,419 INFO L93 Difference]: Finished difference Result 229602 states and 706248 transitions. [2022-02-15 11:04:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-15 11:04:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:04:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:04:03,205 INFO L225 Difference]: With dead ends: 229602 [2022-02-15 11:04:03,205 INFO L226 Difference]: Without dead ends: 229602 [2022-02-15 11:04:03,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1587, Invalid=3815, Unknown=0, NotChecked=0, Total=5402 [2022-02-15 11:04:03,206 INFO L933 BasicCegarLoop]: 1292 mSDtfsCounter, 2689 mSDsluCounter, 11509 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 12801 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:04:03,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2689 Valid, 12801 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4229 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 11:04:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229602 states. [2022-02-15 11:04:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229602 to 148651. [2022-02-15 11:04:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148651 states, 148647 states have (on average 3.0801092521207964) internal successors, (457849), 148650 states have internal predecessors, (457849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148651 states to 148651 states and 457849 transitions. [2022-02-15 11:04:07,812 INFO L78 Accepts]: Start accepts. Automaton has 148651 states and 457849 transitions. Word has length 114 [2022-02-15 11:04:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:04:07,812 INFO L470 AbstractCegarLoop]: Abstraction has 148651 states and 457849 transitions. [2022-02-15 11:04:07,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 148651 states and 457849 transitions. [2022-02-15 11:04:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:04:08,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:04:08,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:04:08,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 11:04:08,309 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:04:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:04:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1913592770, now seen corresponding path program 33 times [2022-02-15 11:04:08,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:04:08,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169287628] [2022-02-15 11:04:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:04:08,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:04:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:04:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:04:08,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:04:08,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169287628] [2022-02-15 11:04:08,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169287628] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:04:08,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:04:08,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:04:08,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116987849] [2022-02-15 11:04:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:04:08,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:04:08,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:04:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:04:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:04:08,869 INFO L87 Difference]: Start difference. First operand 148651 states and 457849 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:19,854 INFO L93 Difference]: Finished difference Result 230097 states and 707814 transitions. [2022-02-15 11:04:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-15 11:04:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:04:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:04:20,971 INFO L225 Difference]: With dead ends: 230097 [2022-02-15 11:04:20,971 INFO L226 Difference]: Without dead ends: 230097 [2022-02-15 11:04:20,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-02-15 11:04:20,972 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 2857 mSDsluCounter, 14659 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2857 SdHoareTripleChecker+Valid, 16146 SdHoareTripleChecker+Invalid, 5455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:04:20,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2857 Valid, 16146 Invalid, 5455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 11:04:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230097 states. [2022-02-15 11:04:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230097 to 148816. [2022-02-15 11:04:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148816 states, 148812 states have (on average 3.080054027900976) internal successors, (458349), 148815 states have internal predecessors, (458349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148816 states to 148816 states and 458349 transitions. [2022-02-15 11:04:26,102 INFO L78 Accepts]: Start accepts. Automaton has 148816 states and 458349 transitions. Word has length 114 [2022-02-15 11:04:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:04:26,102 INFO L470 AbstractCegarLoop]: Abstraction has 148816 states and 458349 transitions. [2022-02-15 11:04:26,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 148816 states and 458349 transitions. [2022-02-15 11:04:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:04:26,241 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:04:26,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:04:26,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 11:04:26,241 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:04:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:04:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 365461738, now seen corresponding path program 34 times [2022-02-15 11:04:26,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:04:26,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879452757] [2022-02-15 11:04:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:04:26,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:04:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:04:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:04:26,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:04:26,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879452757] [2022-02-15 11:04:26,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879452757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:04:26,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:04:26,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:04:26,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845993121] [2022-02-15 11:04:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:04:26,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:04:26,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:04:26,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:04:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:04:26,884 INFO L87 Difference]: Start difference. First operand 148816 states and 458349 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:37,460 INFO L93 Difference]: Finished difference Result 229305 states and 705315 transitions. [2022-02-15 11:04:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-15 11:04:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:04:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:04:38,486 INFO L225 Difference]: With dead ends: 229305 [2022-02-15 11:04:38,486 INFO L226 Difference]: Without dead ends: 229305 [2022-02-15 11:04:38,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-02-15 11:04:38,487 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 2956 mSDsluCounter, 10662 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 12153 SdHoareTripleChecker+Invalid, 3887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:04:38,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2956 Valid, 12153 Invalid, 3887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 11:04:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229305 states. [2022-02-15 11:04:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229305 to 155119. [2022-02-15 11:04:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155119 states, 155115 states have (on average 3.081836057118912) internal successors, (478039), 155118 states have internal predecessors, (478039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155119 states to 155119 states and 478039 transitions. [2022-02-15 11:04:43,147 INFO L78 Accepts]: Start accepts. Automaton has 155119 states and 478039 transitions. Word has length 114 [2022-02-15 11:04:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:04:43,147 INFO L470 AbstractCegarLoop]: Abstraction has 155119 states and 478039 transitions. [2022-02-15 11:04:43,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 155119 states and 478039 transitions. [2022-02-15 11:04:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:04:43,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:04:43,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:04:43,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 11:04:43,666 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:04:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:04:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1568859766, now seen corresponding path program 35 times [2022-02-15 11:04:43,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:04:43,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600916886] [2022-02-15 11:04:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:04:43,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:04:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:04:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:04:44,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:04:44,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600916886] [2022-02-15 11:04:44,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600916886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:04:44,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:04:44,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 11:04:44,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040930886] [2022-02-15 11:04:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:04:44,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 11:04:44,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:04:44,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 11:04:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-02-15 11:04:44,165 INFO L87 Difference]: Start difference. First operand 155119 states and 478039 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:04:50,511 INFO L93 Difference]: Finished difference Result 249206 states and 767289 transitions. [2022-02-15 11:04:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-15 11:04:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:04:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:04:51,635 INFO L225 Difference]: With dead ends: 249206 [2022-02-15 11:04:51,635 INFO L226 Difference]: Without dead ends: 249206 [2022-02-15 11:04:51,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1013, Invalid=2527, Unknown=0, NotChecked=0, Total=3540 [2022-02-15 11:04:51,636 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 2867 mSDsluCounter, 8803 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 9809 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:04:51,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2867 Valid, 9809 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 11:04:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249206 states. [2022-02-15 11:04:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249206 to 157396. [2022-02-15 11:04:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157396 states, 157392 states have (on average 3.082215106231575) internal successors, (485116), 157395 states have internal predecessors, (485116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157396 states to 157396 states and 485116 transitions. [2022-02-15 11:04:56,425 INFO L78 Accepts]: Start accepts. Automaton has 157396 states and 485116 transitions. Word has length 114 [2022-02-15 11:04:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:04:56,425 INFO L470 AbstractCegarLoop]: Abstraction has 157396 states and 485116 transitions. [2022-02-15 11:04:56,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:04:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 157396 states and 485116 transitions. [2022-02-15 11:04:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:04:56,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:04:56,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:04:56,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 11:04:56,978 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:04:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:04:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash 455635790, now seen corresponding path program 36 times [2022-02-15 11:04:56,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:04:56,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112758953] [2022-02-15 11:04:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:04:56,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:04:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:04:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:04:57,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:04:57,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112758953] [2022-02-15 11:04:57,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112758953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:04:57,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:04:57,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:04:57,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352803769] [2022-02-15 11:04:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:04:57,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:04:57,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:04:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:04:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:04:57,566 INFO L87 Difference]: Start difference. First operand 157396 states and 485116 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:05:05,806 INFO L93 Difference]: Finished difference Result 270255 states and 832562 transitions. [2022-02-15 11:05:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-15 11:05:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:05:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:05:07,087 INFO L225 Difference]: With dead ends: 270255 [2022-02-15 11:05:07,087 INFO L226 Difference]: Without dead ends: 270255 [2022-02-15 11:05:07,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-02-15 11:05:07,088 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 3518 mSDsluCounter, 8985 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3518 SdHoareTripleChecker+Valid, 10141 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:05:07,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3518 Valid, 10141 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-15 11:05:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270255 states. [2022-02-15 11:05:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270255 to 158287. [2022-02-15 11:05:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158287 states, 158283 states have (on average 3.0824598977780306) internal successors, (487901), 158286 states have internal predecessors, (487901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158287 states to 158287 states and 487901 transitions. [2022-02-15 11:05:12,567 INFO L78 Accepts]: Start accepts. Automaton has 158287 states and 487901 transitions. Word has length 114 [2022-02-15 11:05:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:05:12,567 INFO L470 AbstractCegarLoop]: Abstraction has 158287 states and 487901 transitions. [2022-02-15 11:05:12,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 158287 states and 487901 transitions. [2022-02-15 11:05:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:05:12,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:05:12,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:05:12,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 11:05:12,719 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:05:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:05:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -899867714, now seen corresponding path program 37 times [2022-02-15 11:05:12,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:05:12,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113981952] [2022-02-15 11:05:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:05:12,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:05:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:05:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:05:13,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:05:13,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113981952] [2022-02-15 11:05:13,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113981952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:05:13,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:05:13,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:05:13,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505528517] [2022-02-15 11:05:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:05:13,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:05:13,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:05:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:05:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:05:13,272 INFO L87 Difference]: Start difference. First operand 158287 states and 487901 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:05:23,362 INFO L93 Difference]: Finished difference Result 269364 states and 829895 transitions. [2022-02-15 11:05:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-02-15 11:05:23,362 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:05:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:05:24,684 INFO L225 Difference]: With dead ends: 269364 [2022-02-15 11:05:24,684 INFO L226 Difference]: Without dead ends: 269364 [2022-02-15 11:05:24,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-02-15 11:05:24,685 INFO L933 BasicCegarLoop]: 1280 mSDtfsCounter, 3095 mSDsluCounter, 14700 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3095 SdHoareTripleChecker+Valid, 15980 SdHoareTripleChecker+Invalid, 5488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 5416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:05:24,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3095 Valid, 15980 Invalid, 5488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 5416 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 11:05:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269364 states. [2022-02-15 11:05:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269364 to 158650. [2022-02-15 11:05:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158650 states, 158646 states have (on average 3.082548567250356) internal successors, (489034), 158649 states have internal predecessors, (489034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158650 states to 158650 states and 489034 transitions. [2022-02-15 11:05:30,323 INFO L78 Accepts]: Start accepts. Automaton has 158650 states and 489034 transitions. Word has length 114 [2022-02-15 11:05:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:05:30,323 INFO L470 AbstractCegarLoop]: Abstraction has 158650 states and 489034 transitions. [2022-02-15 11:05:30,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 158650 states and 489034 transitions. [2022-02-15 11:05:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:05:30,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:05:30,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:05:30,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 11:05:30,496 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:05:30,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:05:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1833636998, now seen corresponding path program 38 times [2022-02-15 11:05:30,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:05:30,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918208160] [2022-02-15 11:05:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:05:30,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:05:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:05:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:05:31,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:05:31,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918208160] [2022-02-15 11:05:31,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918208160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:05:31,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:05:31,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:05:31,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028344425] [2022-02-15 11:05:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:05:31,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:05:31,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:05:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:05:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:05:31,097 INFO L87 Difference]: Start difference. First operand 158650 states and 489034 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:05:41,764 INFO L93 Difference]: Finished difference Result 268011 states and 825564 transitions. [2022-02-15 11:05:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-15 11:05:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:05:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:05:43,042 INFO L225 Difference]: With dead ends: 268011 [2022-02-15 11:05:43,042 INFO L226 Difference]: Without dead ends: 268011 [2022-02-15 11:05:43,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-02-15 11:05:43,043 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 3487 mSDsluCounter, 12154 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3487 SdHoareTripleChecker+Valid, 13540 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:05:43,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3487 Valid, 13540 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 11:05:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268011 states. [2022-02-15 11:05:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268011 to 158683. [2022-02-15 11:05:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158683 states, 158679 states have (on average 3.0825377019013227) internal successors, (489134), 158682 states have internal predecessors, (489134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158683 states to 158683 states and 489134 transitions. [2022-02-15 11:05:48,748 INFO L78 Accepts]: Start accepts. Automaton has 158683 states and 489134 transitions. Word has length 114 [2022-02-15 11:05:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:05:48,748 INFO L470 AbstractCegarLoop]: Abstraction has 158683 states and 489134 transitions. [2022-02-15 11:05:48,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:05:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 158683 states and 489134 transitions. [2022-02-15 11:05:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:05:48,955 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:05:48,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:05:48,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 11:05:48,955 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:05:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:05:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 285505966, now seen corresponding path program 39 times [2022-02-15 11:05:48,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:05:48,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769014084] [2022-02-15 11:05:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:05:48,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:05:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:05:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:05:49,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:05:49,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769014084] [2022-02-15 11:05:49,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769014084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:05:49,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:05:49,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 11:05:49,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897767986] [2022-02-15 11:05:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:05:49,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 11:05:49,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:05:49,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 11:05:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-02-15 11:05:49,835 INFO L87 Difference]: Start difference. First operand 158683 states and 489134 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:06:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:06:01,252 INFO L93 Difference]: Finished difference Result 263610 states and 812337 transitions. [2022-02-15 11:06:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-15 11:06:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-02-15 11:06:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:06:02,195 INFO L225 Difference]: With dead ends: 263610 [2022-02-15 11:06:02,196 INFO L226 Difference]: Without dead ends: 263610 [2022-02-15 11:06:02,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2126, Invalid=5014, Unknown=0, NotChecked=0, Total=7140 [2022-02-15 11:06:02,196 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 2814 mSDsluCounter, 10648 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 12159 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:06:02,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2814 Valid, 12159 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 11:06:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263610 states. [2022-02-15 11:06:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263610 to 168595. [2022-02-15 11:06:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168595 states, 168591 states have (on average 3.083925001927742) internal successors, (519922), 168594 states have internal predecessors, (519922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:06:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168595 states to 168595 states and 519922 transitions. [2022-02-15 11:06:07,760 INFO L78 Accepts]: Start accepts. Automaton has 168595 states and 519922 transitions. Word has length 114 [2022-02-15 11:06:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:06:07,761 INFO L470 AbstractCegarLoop]: Abstraction has 168595 states and 519922 transitions. [2022-02-15 11:06:07,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:06:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 168595 states and 519922 transitions. [2022-02-15 11:06:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-15 11:06:08,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:06:08,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:06:08,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 11:06:08,364 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-02-15 11:06:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:06:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2084097448, now seen corresponding path program 40 times [2022-02-15 11:06:08,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:06:08,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56191060] [2022-02-15 11:06:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:06:08,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:06:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:06:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:06:08,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:06:08,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56191060] [2022-02-15 11:06:08,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56191060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:06:08,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:06:08,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-02-15 11:06:08,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861106452] [2022-02-15 11:06:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:06:08,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 11:06:08,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:06:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 11:06:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:06:08,907 INFO L87 Difference]: Start difference. First operand 168595 states and 519922 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-02-15 11:06:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 11:06:15,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-02-15 11:06:15,432 INFO L933 BasicCegarLoop]: 853 mSDtfsCounter, 2364 mSDsluCounter, 9458 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 10311 SdHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 11:06:15,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2364 Valid, 10311 Invalid, 3950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-15 11:06:15,432 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-02-15 11:06:15,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 11:06:15,433 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). [2022-02-15 11:06:15,434 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-02-15 11:06:15,435 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-02-15 11:06:15,435 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-02-15 11:06:15,435 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-02-15 11:06:15,435 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-02-15 11:06:15,435 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-02-15 11:06:15,436 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-02-15 11:06:15,436 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-02-15 11:06:15,436 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-02-15 11:06:15,438 INFO L732 BasicCegarLoop]: Path program histogram: [40, 2, 1] [2022-02-15 11:06:15,440 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-15 11:06:15,440 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 11:06:15,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:06:15 BasicIcfg [2022-02-15 11:06:15,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 11:06:15,442 INFO L158 Benchmark]: Toolchain (without parser) took 650865.35ms. Allocated memory was 195.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 137.5MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-02-15 11:06:15,442 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 11:06:15,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.02ms. Allocated memory was 195.0MB in the beginning and 325.1MB in the end (delta: 130.0MB). Free memory was 137.4MB in the beginning and 272.9MB in the end (delta: -135.6MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-02-15 11:06:15,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.42ms. Allocated memory is still 325.1MB. Free memory was 272.4MB in the beginning and 269.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-15 11:06:15,443 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 325.1MB. Free memory was 269.3MB in the beginning and 267.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 11:06:15,443 INFO L158 Benchmark]: RCFGBuilder took 469.08ms. Allocated memory is still 325.1MB. Free memory was 267.2MB in the beginning and 247.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-15 11:06:15,443 INFO L158 Benchmark]: TraceAbstraction took 649863.41ms. Allocated memory was 325.1MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 246.7MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-02-15 11:06:15,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-02-15 11:06:15,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.02ms. Allocated memory was 195.0MB in the beginning and 325.1MB in the end (delta: 130.0MB). Free memory was 137.4MB in the beginning and 272.9MB in the end (delta: -135.6MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.42ms. Allocated memory is still 325.1MB. Free memory was 272.4MB in the beginning and 269.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 325.1MB. Free memory was 269.3MB in the beginning and 267.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 469.08ms. Allocated memory is still 325.1MB. Free memory was 267.2MB in the beginning and 247.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 649863.41ms. Allocated memory was 325.1MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 246.7MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (168595states) and FLOYD_HOARE automaton (currently 46 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (84701 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 649.7s, OverallIterations: 43, TraceHistogramMax: 1, PathProgramHistogramMax: 40, EmptinessCheckTime: 10.3s, AutomataDifference: 415.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132216 SdHoareTripleChecker+Valid, 80.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132216 mSDsluCounter, 552746 SdHoareTripleChecker+Invalid, 67.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 500418 mSDsCounter, 3295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179350 IncrementalHoareTripleChecker+Invalid, 182645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3295 mSolverCounterUnsat, 52328 mSDtfsCounter, 179350 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3404 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 3289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43669 ImplicationChecksByTransitivity, 260.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168595occurred in iteration=42, InterpolantAutomatonStates: 2292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 189.5s AutomataMinimizationTime, 42 MinimizatonAttempts, 2125853 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 4840 NumberOfCodeBlocks, 4840 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4797 ConstructedInterpolants, 0 QuantifiedInterpolants, 73540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown